Insensitive load balancing

A large variety of communication systems, including telephone and data networks, can be represented by so-called Whittle networks. The stationary distribution of these networks is insensitive, depending on the service requirements at each node through their mean only. These models are of considerable practical interest as derived engineering rules are robust to the evolution of traffic characteristics. In this paper we relax the usual assumption of static routing and address the issue of dynamic load balancing. Specifically, we identify the class of load balancing policies which preserve insensitivity and characterize optimal strategies in some specific cases. Analytical results are illustrated numerically on a number of toy network examples.

[1]  Mor Harchol-Balter,et al.  On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..

[2]  Debasis Mitra,et al.  State-dependent routing on symmetric loss networks with trunk reservations. I , 1993, IEEE Trans. Commun..

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

[4]  F. Kelly.  Network routing , 1991, Philosophical Transactions of the Royal Society of London. Series A: Physical and Engineering Sciences.

[5]  S. Aalto,et al.  Load balancing in cellular networks using first policy iteration , 2001 .

[6]  Ward Whitt,et al.  Deciding Which Queue to Join: Some Counterexamples , 1986, Oper. Res..

[7]  Alexandre Proutière,et al.  Insensitivity in processor-sharing networks , 2002, Perform. Evaluation.

[8]  F. P. Kelly,et al.  Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..

[9]  Jr. Shaler Stidham.  Optimal control of admission to a queueing system , 1985 .

[10]  Tapani Lehtonen,et al.  On the optimality of the shortest line discipline , 1984 .

[11]  F. P. Kelly.  Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks , 1994, Math. Oper. Res..

[12]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[13]  Alexandre Proutière,et al.  Insensitive Bandwidth Sharing in Data Networks , 2003, Queueing Syst. Theory Appl..

[14]  Frank Kelly,et al.  Mathematical Modelling of the Internet , 2001 .

[15]  R. Serfozo.  Introduction to Stochastic Networks , 1999 .

[16]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[17]  J. W. Cohen,et al.  The multiple phase service network with generalized processor sharing , 1979, Acta Informatica.

[18]  Onno J. Boxma,et al.  Optimization of Static Traffic Allocation Policies , 1994, Theor. Comput. Sci..

[19]  Christos G. Cassandras,et al.  Optimal routing and buffer allocation for a class of finite capacity queueing systems , 1992 .

[20]  Masakiyo Miyazawa,et al.  Markov network processes with product form stationary distributions , 1998, Queueing Syst. Theory Appl..

[21]  Ger Koole,et al.  On the Assignment of Customers to Parallel Queues , 1992, Probability in the Engineering and Informational Sciences.

[22]  S Oueslati-Boulahia,et al.  An Approach to Routing Elastic Flows , 1999 .

[23]  Randolph D. Nelson,et al.  An Approximation for the Mean Response Time for Shortest Queue Routing with General Inerarrival and Service Times , 1993, Perform. Evaluation.

[24]  Srihari Nelakuditi,et al.  Adaptive proportional routing: a localized QoS routing approach , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[25]  Bruce E. Hajek,et al.  Analysis of Simple Algorithms for Dynamic Load Balancing , 1997, Math. Oper. Res..

[26]  Asser N. Tantawi,et al.  Optimal static load balancing in distributed computer systems , 1985, JACM.

[27]  P. D. Sparaggis,et al.  Optimal control of multiclass parallel service systems with and without state information , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.