期刊
IEEE TRANSACTIONS ON COMPUTERS
卷 58, 期 3, 页码 365-379出版社
IEEE COMPUTER SOC
DOI: 10.1109/TC.2008.176
关键词
Packet scheduling; proportional fairness; worst-case fairness; round-robin scheduler
资金
- US National Science Foundation (NSF) [CCF-0342540, CCF-0541096, CCF-0551555]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据