.png){kind=icon}
返回
Efficient fair quelling using deficit round-robin
.png){kind=icon}
PRE
AI
DOI：10.1109/90.502236.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement; specifically, the work required to process a packet in these schemes was O(log(n)), where n is the number of active flows. This is expensive at high speeds. On the other hand, cheaper approximations of fair queuing reported in the literature exhibit unfair behavior. In this paper, we describe a new approximation of fair queuing, that we call deficit round-robin. Our scheme achieves nearly perfect fairness in terms of throughput, requires only O(1) work to process a packet, and is simple enough to implement in hardware, Deficit round-robin is also applicable to other scheduling problems where servicing cannot be broken up into smaller units (such as load balancing) and to distributed queues.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
分享收藏Electrospinning preparation and upconversion luminescence of yttrium fluoride nanofibers.png)
CrystEngComm
CrystEngCommIF0
PREAI
分享收藏Response to oral administration of pteroylmonoglutamic acid or pteroylpolyglutamate in newborn infants of low birth weight低出生体重新生儿对口服四氢叶酸单谷氨酸盐或四氢叶酸多谷氨酸盐的应答
OAAI
OAAI分享收藏 没有更多内容
没有更多内容