Heavy-Traffic Optimality of a Stochastic Network under Utility-Maximizing Resource Control

We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while being processed, and each server is shared among the job classes in a head-of-the-line processor-sharing mechanism. The allocation of the service capacities is a real-time control mechanism: in each network state, the control is the solution to an optimization problem that maximizes a general utility function. Whereas this resource control optimizes in a ``greedy'' fashion, with respect to each state, we establish its asymptotic optimality in terms of (a) deriving the fluid and diffusion limits of the network under this control, and (b) identifying a cost function that is minimized in the diffusion limit, along with a characterization of the so-called fixed point state of the network.

[1]  C. Laws.  Resource pooling in queueing networks with dynamic routing , 1992, Advances in Applied Probability.

[2]  Hong Chen,et al.  Existence Condition for the Diffusion Approximations of Multiclass Priority Queueing Networks , 2001, Queueing Syst. Theory Appl..

[3]  J. Harrison.  Brownian models of open processing networks: canonical representation of workload , 2000 .

[4]  A. Stolyar.  MaxWeight scheduling in a generalized switch: State space collapse and workload minimization in heavy traffic , 2004 .

[5]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[6]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[7]  Hong Chen,et al.  Diffusion approximations for Kumar-Seidman network under a priority service discipline , 1998, Oper. Res. Lett..

[8]  Heng-Qing Ye,et al.  Stability of data networks under an optimization-based bandwidth allocation , 2003, IEEE Trans. Autom. Control..

[9]  J. Michael Harrison,et al.  Heavy traffic resource pooling in parallel‐server systems , 1999, Queueing Syst. Theory Appl..

[10]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[11]  Alexander L. Stolyar,et al.  Scheduling Flexible Servers with Convex Delay Costs: Heavy-Traffic Optimality of the Generalized cµ-Rule , 2004, Oper. Res..

[12]  Xue-Ming Yuan,et al.  Stability of Data Networks: Stationary and Bursty Models , 2005, Oper. Res..

[13]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[14]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2004, IEEE Transactions on Automatic Control.

[15]  F. P. Kelly,et al.  Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling , 1993, Queueing Syst. Theory Appl..

[16]  R. J. Williams,et al.  Fluid model for a network operating under a fair bandwidth-sharing policy , 2004, math/0407057.

[17]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[18]  Laurent Massoulié,et al.  Best-effort networks: modeling and performance analysis via large networks asymptotics , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[20]  Frank Kelly,et al.  Mathematical modeling of the Internet , 1999 .

[21]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[22]  Hong Chen,et al.  A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines , 1999, Queueing Syst. Theory Appl..

[23]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[24]  Gustavo de Veciana,et al.  Stability and performance analysis of networks supporting elastic services , 2001, TNET.

[25]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[26]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[27]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[28]  D. Yao,et al.  Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization , 2001, IEEE Transactions on Automatic Control.

[29]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[30]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[31]  Jan A. Van Mieghem,et al.  Dynamic Control of Brownian Networks: State Space Collapse and Equivalent Workload Formulations , 1997 .

[32]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[33]  J. Harrison.  A broader view of Brownian networks , 2003 .