Optimal static load balancing in distributed computer systems
Journal of the ACM (JACM)
Deciding which queue to join: Some counterexamples
Operations Research
Routing and capacity allocation in networks with trunk reservation
Mathematics of Operations Research
Optimization of static traffic allocation policies
Theoretical Computer Science - Special issue on probabilistic modelling
Bounds on the performance of dynamic routing schemes for highly connected networks
Mathematics of Operations Research
Analysis of simple algorithms for dynamic load balancing
Mathematics of Operations Research
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Markov network processes with product form stationary distributions
Queueing Systems: Theory and Applications
Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
Optimal insensitive routing and bandwidth sharing in simple data networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Analysis of Alternating-Priority Queueing Models with (Cross) Correlated Switchover Times
Queueing Systems: Theory and Applications
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
Queueing Systems: Theory and Applications
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Insensitive queueing models for communication networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Stability of two interfering processors with load balancing
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Providing statistically guaranteed streaming quality for peer-to-peer live streaming
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Nash equilibrium based fairness
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Towards an Erlang formula for multiclass networks
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.