Insensitive load balancing

Performance Evaluation Review

Volumn 32, Issue 1, 2004, Pages 367-377

  Bonald, T ^a   Jonckheere, M ^a   Proutiere A ^a  

^a ORANGE LABS   (France)

Author keywords

Insensitivity; Load balancing; Whittle networks

Indexed keywords

COMPUTER NETWORKS; DATA PROCESSING; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS; TELECOMMUNICATION TRAFFIC;

DATA NETWORKS; INSENSITIVITY; LOAD BALANCING; WHITTLE NETWORKS;

COMMUNICATION SYSTEMS;

EID: 8344287537     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1012888.1005729     Document Type: Conference Paper

References (27)

1. M. Alanyali, B. Hajek, Analysis of simple algorithms for dynamic load balancing, Mathematics of Operations Research 22-4 (1997) 840-871.
2. T. Bonald, A. Prontière, Insensitivity in processor-sharing networks, Performance Evaluation 49 (2002) 193-209.
3. T. Bonald, A. Proutière, Insensitive bandwidth sharing in data networks, Queueing Systems 44-1 (2003) 69-100.
4. X. Chao, M. Miyazawa, R. F. Serfozo and H. Takada, Markov network processes with product form stationary distributions, Queueing Systems 28 (1998) 377-401.
5. J.W. Cohen, The multiple phase service network with generalized processor sharing, Acta Informatica 12 (1979) 245-284.
6. M.B. Combe, O.J. Boxma, Optimization of static traffic allocation policies, Theoretical Computer Science 125 (1994) 17-43.
7. A. Ephremides, P. Varaiya, J. Walrand, A simple dynamic routing problem, IEEE Transactions on Automatic control 25 (1980) 690-593.
8. M. Harchol-Balter, M. Crovella, C. Murta, On choosing a task assignment policy for a distributed server system, IEEE journal of parallel and distributed computing 59 (1999) 204-228.
9. A. Hordijk, G. Koole, On the assignment of customers to parallel queues, Probability in the Engineering and Informational Sciences 6 (1992) 495-511.
10. F.P. Kelly, Blocking Probabilities in Large Circuit-switched Networks, Adv. Applied Probability 18 (1986) 473-505.
11. F.P. Kelly, Routing and capacities allocations in networks with trunk reservations. Mathematics of operations research 15 (1990) 771-793.
12. F.P. Kelly, Network routing, Philosophical Transactions of the Royal Society A337 (1991) 343-367.
13. F.P. Kelly, Loss Networks, Annals of Applied Probabilities 1-3 (1991) 319-378.
14. F.P. Kelly, Bounds on the performance of dynamic routing schemes for highly connected networks, Mathematics of Operations Research 19 (1994) 1-20.
15. P.P. Kelly, Mathematical modelling of the Internet, in: Mathematics Unlimited - 2001 and Beyond (Editors B. Engquist and W. Schmid), Springer-Verlag, Berlin (2001) 685-702.
16. J. van Leeuwaarden, S. Aalto, J. Virtamo, Load balancing in cellular networks using first policy iteration, Technical Report, Networking Laboratory, Helsinki University of Technology, 2001.
17. D. Mitra, R.J. Gibbens, B.D. Huang, State dependent routing on symmetric loss networks with trunk reservations, IEEE Transactions on communications 41-2 (1993) 400-411.
18. S. Nelakuditi, Adaptive proportional routing: a localized QoS routing approach, in: Proc. of IEEE Infocom, 2000.
19. R. Nelson, T. Philips, An approximation for the mean response time for shortest queue routing with general interarrival and service times, Performance evaluation 17 (1993) 123-139.
20. S. Oueslati-Boulahia, E. Oubagha, An approach to routing elastic flows, in: Proc. of ITC 16, 1999.
21. R. Serfozo, Introduction to stochastic networks, Springer, 1999.
22. P. Sparaggis, C. Cassandras, D. Towley, Optimal control of multiclass parallel service systems with and without state information, in: proc. of the 32nd Conference on Decision Control, San Antonio, 1993.
23. S. Stidham, Optimal control of admission to a queueing system, IEEE Transactions on Automatic Control 30-8 (1985) 705-713.
24. A.N. Tantawi and D. Towsley, Optimal static load balancing in distributed computer systems, Journal of the ACM 32-2 (1985) 445-465.
25. D. Towsley, D. Panayotis, P. Sparaggis, C. Cassandras, Optimal routing and buffer allocation for a class of finite capacity queueing systems, IEEE Trans. on Automatic Control 37-9 (1992) 1446-1451.
26. W. Whitt, Deciding which queue to join: some counterexamples, Operations research 34-1 (1986) 226-244.
27. W. Winston, Optimality of the shortest line discipline. Journal of Applied Probability 14 (1977) 181-189.