Affiliation:
1. Xerox PARC, 3333 Coyote Hill Road, Palo Alto, CA
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Cited by
274 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adaptive Approximate Fair Queueing for Shared-Memory Programmable Switches;IEEE Transactions on Network Science and Engineering;2024-07
2. Dragonfly: In-Flight CCA Identification;IEEE Transactions on Network and Service Management;2024-06
3. D-PIFO: A Dynamic Priority Scheduling Algorithm for Performance-Critical Packets Based on the Programmable Data Plane;2024 27th International Conference on Computer Supported Cooperative Work in Design (CSCWD);2024-05-08
4. BFQ, Multiqueue-Deadline, or Kyber? Performance Characterization of Linux Storage Schedulers in the NVMe Era;Proceedings of the 15th ACM/SPEC International Conference on Performance Engineering;2024-05-07
5. A Systematic Configuration Space Exploration of the Linux Kyber I/O Scheduler;Companion of the 15th ACM/SPEC International Conference on Performance Engineering;2024-05-07