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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.