Multi-layered round robin routing for parallel servers

DOI10.1007/s11134-006-7419-9zbMath1099.68532OpenAlexW2095784707MaRDI QIDQ2505098

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

Light trafficHeavy trafficParallel serversRound robin routingShortest remaining processing time scheduling

Mathematics Subject Classification ID

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

Related Items

Round robin scheduling of heterogeneous parallel servers in heavy traffic ⋮ Diffusion limits for shortest remaining processing time queues ⋮ Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ Queueing System MAP/M/ ∞ with n Types of Customers ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ Research of Heterogeneous Queueing System SM|M $$^{(n)}|\infty $$ ⋮ Balanced routing with partial information in a distributed parallel many-server queueing system ⋮ Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits

Uses Software

• EquiLoad
• MCQueue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Validity of heavy traffic steady-state approximations in generalized Jackson networks
• Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
• On extremal service disciplines in single-stage queueing systems
• Deciding Which Queue to Join: Some Counterexamples
• Light Traffic Limits of Sojourn Time Distributions in Markovian Queueing Networks
• Open Queueing Systems in Light Traffic
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• On the optimal assignment of customers to parallel servers
• On the stability of polling models with multiple servers
• Optimality of the round-robin routing policy
• EquiLoad: a load balancing policy for clustered web servers
• Multiple channel queues in heavy traffic. II: sequences, networks, and batches
• Weak convergence theorems for priority queues: preemptive-resume discipline
• Multiple channel queues in heavy traffic. I
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline

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