Insensitive versus efficient dynamic load balancing in networks without blocking

DOI10.1007/s11134-006-0066-3zbMath1118.60074OpenAlexW2023836781MaRDI QIDQ855000

Matthieu Jonckheere

Publication date: 20 December 2006

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-006-0066-3

zbMATH Keywords

performance evaluationqueueing theorynetwork modelsteletraffic problems

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Traffic problems in operations research (90B20)

Related Items

From Erlang formula to robust control ⋮ Asymptotics of insensitive load balancing and blocking phases ⋮ Universality of Power-of-d Load Balancing in Many-Server Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Le théorème de représentation intégrale dans les ensembles convexes compacts
• Markov network processes with product form stationary distributions
• Insensitive bandwidth sharing in data networks
• On linear functional operations and the moment problem for a finite interval in one or several dimensions
• A queueing analysis of max-min fairness, proportional fairness and balanced fairness
• On the Assignment of Customers to Parallel Queues
• Deciding Which Queue to Join: Some Counterexamples
• A simple dynamic routing problem
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Optimality of the shortest line discipline
• Insensitivity in processor-sharing networks

This page was built for publication: Insensitive versus efficient dynamic load balancing in networks without blocking