Journal
IEEE TRANSACTIONS ON COMPUTERS
Volume 58, Issue 3, Pages 365-379Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TC.2008.176
Keywords
Packet scheduling; proportional fairness; worst-case fairness; round-robin scheduler
Funding
- US National Science Foundation (NSF) [CCF-0342540, CCF-0541096, CCF-0551555]
Ask authors/readers for more resources
Round-robin-based packet schedulers generally have a low complexity and provide long-term fairness. The main limitation of such schemes is that they do not support short-term fairness. In this paper, we propose a new low-complexity round-robin scheduler, called Fair Round-Robin (FRR), that overcomes this limitation. FRR has similar complexity and long-term fairness properties as the STratified Round-Robin (STRR) scheduler, a recently proposed scheme that arguably provides the best quality-of-service properties among all existing round-robin-based low-complexity packet schedulers. FRR offers better short-term fairness than STRR and other existing round-robin schedulers.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available