Optimality of the round-robin routing policy
From MaRDI portal
Publication:4305650
DOI10.2307/3215039zbMath0804.60080OpenAlexW2044451965MaRDI QIDQ4305650
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
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) Discrete location and assignment (90B80) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30) Problems with incomplete information (optimization) (49N30)
Related Items
Allocation of flows in closed bipartite queueing networks, Sample path methods in the control of queues, Optimal Routing of Fixed Size Jobs to Two Parallel Servers, Size- and state-aware dispatching problem with queue-specific job sizes, To split or not to split: selecting the right server with batch arrivals, On the Value Function of the M/G/1 FCFS and LCFS Queues, On the stability of a class of non-monotonic systems of parallel queues, Asymptotic optimality of the round-robin policy in multipath routing with resequencing, Multi-layered round robin routing for parallel servers, Algorithms of distributed task allocation for cooperative agents, Optimizing Bernoulli routing policies for balancing loads on call centers and minimizing transmission costs, Partial Flexibility in Routeing and Scheduling
