Insensitive versus efficient dynamic load balancing in networks without blocking

DOI10.1007/S11134-006-0066-3MaRDI QIDQ855000zbMATH OpenOpenAlexFDO

Authors 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

network modelsperformance evaluationqueueing theoryteletraffic problems

Mathematics Subject Classification ID

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

Review text

The queueing networks without blocking are studied. A set of insensitive dynamic load balancing schemes preserving the structure of Whittle networks (i.e., a locally balanced network of processor sharing nodes -- one for each class) in the case of infinite buffers is considered. By use of Hausdorff's theorem it is proven that the optimal insensitive schemes are static in this case, in which routing decisions do not depend on the current state of the queues. The obtained results demonstrate that the insensitivity might be too strong a requirement to find efficient policies in the case of infinite buffers. On the other hand, strict insensitivity and efficiency may be incompatible objectives for queueing networks with dynamic load balancing in case of infinite buffers.

Recommendations

• Insensitive load balancing in data networks
• Asymptotics of insensitive load balancing and blocking phases
• Insensitivity in processor-sharing networks
• Insensitive bandwidth sharing in data networks
• Analysis of Simple Algorithms for Dynamic Load Balancing

Cites work

• A queueing analysis of max-min fairness, proportional fairness and balanced fairness
• A simple dynamic routing problem
• Deciding Which Queue to Join: Some Counterexamples
• scientific article; zbMATH DE number 1350310 (Why is no real title available?)
• scientific article; zbMATH DE number 3219970 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• scientific article; zbMATH DE number 3049368 (Why is no real title available?)
• Insensitive bandwidth sharing in data networks
• Insensitivity in processor-sharing networks
• Le théorème de représentation intégrale dans les ensembles convexes compacts
• Markov network processes with product form stationary distributions
• On linear functional operations and the moment problem for a finite interval in one or several dimensions
• On the Assignment of Customers to Parallel Queues
• Optimal routing and buffer allocation for a class of finite capacity queueing systems
• Optimality of the shortest line discipline
• The moment problem for the standard k-dimensional simplex

Cited in

(6)

• Asymptotics of insensitive load balancing and blocking phases
• From Erlang formula to robust control
• Insensitive load balancing in data networks
• Efficient Load Balancing by Adaptive Bypasses for the Migration on the Internet
• Universality of power-of-d load balancing in many-server systems
• Large-system insensitivity of zero-waiting load balancing algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855000)