Multi-layered round robin routing for parallel servers

DOI10.1007/S11134-006-7419-9MaRDI QIDQ2505098zbMATH OpenOpenAlexFDO

Authors Douglas G. Down, Rong Wu

Publication date 29 September 2006

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/multilayered-round-robin-routing-for-parallel-servers(e0e4b585-1737-41ed-9093-7a47f08be629).html

zbMATH Keywords

Heavy trafficLight trafficParallel serversRound robin routingShortest remaining processing time scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Round robin scheduling of heterogeneous parallel servers in heavy traffic
• Optimality of the round-robin routing policy
• Asymptotic optimality of the round-robin policy in multipath routing with resequencing
• Stability of parallel server systems
• Asymptotic optimality of balanced routing

Cites work

• scientific article; zbMATH DE number 3868389 (Why is no real title available?)
• scientific article; zbMATH DE number 49989 (Why is no real title available?)
• scientific article; zbMATH DE number 52160 (Why is no real title available?)
• scientific article; zbMATH DE number 2080856 (Why is no real title available?)
• A first course in stochastic models.
• A simple dynamic routing problem
• Deciding Which Queue to Join: Some Counterexamples
• EquiLoad: a load balancing policy for clustered web servers
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks
• Multiple channel queues in heavy traffic. I
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• On extremal service disciplines in single-stage queueing systems
• On the optimal assignment of customers to parallel servers
• On the stability of polling models with multiple servers
• Open Queueing Systems in Light Traffic
• Optimal load balancing on distributed homogeneous unreliable processors
• Optimality of the round-robin routing policy
• Optimality of the shortest line discipline
• Validity of heavy traffic steady-state approximations in generalized Jackson networks
• Weak convergence theorems for priority queues: preemptive-resume discipline

Cited in

(11)

• Research of heterogeneous queueing system \(SM| M^{(n)}|\infty\)
• Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits
• Size- and state-aware dispatching problem with queue-specific job sizes
• Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice
• Queueing system \(\mathrm{MAP}/\mathrm{M}/\infty\) with \(n\) types of customers
• Asymptotic optimality of the round-robin policy in multipath routing with resequencing
• Customer routing to parallel servers with different rates
• Fluid limits for multiple-input shortest remaining processing time queues
• Balanced routing with partial information in a distributed parallel many-server queueing system
• Diffusion limits for shortest remaining processing time queues
• Round robin scheduling of heterogeneous parallel servers in heavy traffic

Describes a project that uses

Uses Software

• MCQueue
• EquiLoad

This page was built for publication: Multi-layered round robin routing for parallel servers

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