Deciding which queue to join: Some counterexamples
Operations Research
Optimization of static traffic allocation policies
Theoretical Computer Science - Special issue on probabilistic modelling
Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
On performance bounds for balanced fairness
Performance Evaluation - Internet performance symposium (IPS 2002)
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the joint international conference on Measurement and modeling of computer systems
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
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
Optimal load balancing in insensitive data networks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
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
Hi-index | 0.00 |
In this paper, we extend and summarize our earlier work on optimal insensitive load balancing. Based on the insensitivity results by Bonald and Proutière, we study insensitive load balancing in data networks executed either at packet or flow level. When insensitive load balancing is used, the flow size distribution does not affect the state distribution or performance of the system. The most efficient capacity allocation policy can be determined recursively when packet-level balancing is used. The flow-level balancing problem is analyzed using the theory of Markov decision processes. By using the linear programming formulation of MDP theory, the optimal routing policy can be solved either separately or jointly with the capacity allocation. Performance of the different methods is compared in a toy network. Packet-level balancing performs best of the insensitive policies. The performance of flow-level balancing is improved if capacity allocation and routing are jointly balanced and optimized. However, the requirement of insensitivity still implies some performance penalty in comparison with the best sensitive policy.