Queues, Counters, Deficits and Surpluses

ABSTRACT

Resource allocation problems in queueing networks can often be posed as convex optimization problems, and the relationship between queue lengths and Lagrange multipliers can then be used to derive optimal algorithms for routing, scheduling and flow control. In this talk, we will present applications of this theory to problems in wireless networks and online advertising with budget constraints.