Optimality of the round-robin routing policy

DOI10.2307/3215039zbMath0804.60080MaRDI QIDQ4305650

Zhen Liu, Don Towsley

Publication date: 13 October 1994

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/658fc90308bc2ad2c080df000fcf5b66d774213c

zbMATH Keywords

scheduling; stochastic ordering; optimal routing; sample path analysis; round-robin policy

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

90B80: Discrete location and assignment

49K30: Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.)

49N30: Problems with incomplete information (optimization)

Related Items

On the Value Function of the M/G/1 FCFS and LCFS Queues, Optimal Routing of Fixed Size Jobs to Two Parallel Servers, Allocation of flows in closed bipartite queueing networks, Size- and state-aware dispatching problem with queue-specific job sizes, On the stability of a class of non-monotonic systems of parallel queues, Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs, Algorithms of distributed task allocation for cooperative agents, Sample path methods in the control of queues, To split or not to split: selecting the right server with batch arrivals, Asymptotic optimality of the round-robin policy in multipath routing with resequencing, Multi-layered round robin routing for parallel servers, Partial Flexibility in Routeing and Scheduling