Proceedings ArticleDOI
Analysis and simulation of a fair queueing algorithm
Alan J. Demers,Srinivasan Keshav,Scott Shenker +2 more
- Vol. 19, Iss: 4, pp 1-12
Reads0
Chats0
TLDR
It is found 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.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.read more
Citations
More filters
Journal ArticleDOI
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Book
Principles and Practices of Interconnection Networks
William J. Dally,Brian Towles +1 more
TL;DR: This book offers a detailed and comprehensive presentation of the basic principles of interconnection network design, clearly illustrating them with numerous examples, chapter exercises, and case studies, allowing a designer to see all the steps of the process from abstract design to concrete implementation.
Journal ArticleDOI
Quality-of-service routing for supporting multimedia applications
Zheng Wang,Jon Crowcroft +1 more
TL;DR: This paper first examines the basic problem of QoS routing, namely, finding a path that satisfies multiple constraints, and its implications on routing metric selection, and presents three path computation algorithms for source routing and for hop-by-hop routing.
Book
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
TL;DR: The application of Network Calculus to the Internet and basic Min-plus and Max-plus Calculus and Optimal Multimedia Smoothing and Adaptive and Packet Scale Rate Guarantees are studied.
Journal ArticleDOI
Efficient fair queueing using deficit round-robin
M. Shreedhar,George Varghese +1 more
TL;DR: This paper describes a new approximation of fair queuing that 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.
References
More filters
Journal ArticleDOI
Congestion avoidance and control
TL;DR: The measurements and the reports of beta testers suggest that the final product is fairly good at dealing with congested conditions on the Internet, and an algorithm recently developed by Phil Karn of Bell Communications Research is described in a soon-to-be-published RFC.
Internet Protocol
TL;DR: Along with TCP, IP represents the heart of the Internet protocols and has two primary responsibilities: providing connectionless, best-effort delivery of datagrams through an internetwork; and providing fragmentation and reassembly of data links to support data links with different maximum transmission unit (MTU) sizes.
Journal ArticleDOI
Congestion control in IP/TCP internetworks
TL;DR: It is discovered that the Department of Defense's Internet Protocol (IP), a pure datagram protocol, and Transmission Control Protocol (TCP), a transport layer protocol, are subject to unusual congestion problems caused by interactions between the transport and datagram layers.
Journal ArticleDOI
Flow Control: A Comparative Survey
Mario Gerla,Leonard Kleinrock +1 more
TL;DR: Flow control can be exercised at various levels in a packet network: hop level, entry-to-exit level, network access level, and transport level, where the interaction between the different levels is discussed and the most representative techniques are surveyed and compared.
Related Papers (5)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more