Comparing load balancing algorithms for distributed queueing networks

MaRDI QIDQ2702299zbMATH OpenFDO

Authors S. R. E. Turner, David R. Mcdonald

Publication date 24 March 2002

zbMATH Keywords

distributed queueing networksjoint the shorter actual waiting time

Mathematics Subject Classification ID

Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• Replicate to the shortest queues
• Load balancing in a multiserver queueing system
• Join the shortest queue: Stability and exact asymptotics
• Stability of join the shortest queue networks
• Delay-join the shortest queue routing for a parallel queueing system with removable servers

Cited in

(9)

• Queueing network models for load balancing in distributed systems
• On large deviations in load sharing networks
• Load balancing in a multiserver queueing system
• Stationary distribution analysis of a queueing model with local choice
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Subdiffusive load balancing in time-varying queueing systems
• Trade-Offs between Latency, Complexity, and Load Balancing with Multicast Algorithms
• Mean-field analysis for load balancing on spatial graphs
• Handling load with less stress

This page was built for publication: Comparing load balancing algorithms for distributed queueing networks

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