Algorithms for generalized round robin routing

Authors:
Yair Arian;Yonatan Levy
Affiliations:
AT&T Bell Laboratories, Holmdel, NJ 07733, USA;AT&T Bell Laboratories, Holmdel, NJ 07733, USA
Venue:
Operations Research Letters
Year:
1992

Citing 1
Cited 2

The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks

Journal of the ACM (JACM)

The price of forgetting in parallel and non-observable queues

Performance Evaluation
Tracking highly mobile users using replicated databases

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents new algorithms to construct a Generalized Round Robin (GRR) routing sequence for distributing one stream of traffic to multiple queues. The performance objective is to minimize the expected delay. Given a target allocation in terms of the fraction of jobs that should be routed to each queue, the algorithms scan the queues in order of descending fraction and assign the next job to the first queue with current allocation not exceeding an easilycomputed threshold. We prove that the constructed sequence has properties related to Hajek's most regular sequence; in particular, it is optimal for the case of two queues. Simulation results show improvement over Itai-Rosberg's Golden Ratio Rule and come very close to a lower bound obtained by Hajek.