Analysis and simulation of a fair queueing algorithm
Analysis and simulation of a fair queueing algorithm
复制标题
DOI：
10.1145/75246.75248
复制
发表时间：
1989-08
期刊：
影响因子：
--
通讯作者：
A. Demers;S. Keshav;S. Shenker
中科院分区：
文献类型：
--
作者：
A. Demers;S. Keshav;S. Shenker
我们讨论了网关调度算法及其在控制数据报网络拥塞中的作用。在Nagle早期建议的基础上，提出了一种公平排队算法。分析和仿真是用来比较该算法与其他拥塞控制方案。我们发现，公平分配提供了几个重要的优势，通常的先来先服务分配算法：公平分配带宽，较低的延迟源使用不到其全部份额的带宽，并保护不良行为的来源。
We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.