Article

Free access

Analysis and simulation of a fair queueing algorithm

Authors:

S. ShenkerAuthors Info & Claims

SIGCOMM '89: Symposium proceedings on Communications architectures & protocols

August 1989

Pages 1 - 12

https://doi.org/10.1145/75246.75248

Published: 01 August 1989 Publication History

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.

References

[1]

R. Jain and K. K. Ramakrishnan, "Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I-Concepts, Goals, and Alternatives", DEC Technical Report TR-507, Digital Equipment Corporation, April 1987.]]

[2]

K. K. Ramakrishnan and R. Jain, "Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part I{-An Explicit Binary Feedback Scheme", DEC Technical Report TR-508, Digital Equipment Corporation, April 1987.]]

[3]

D.-M. Chiu and R. Jain, "Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part {II- Analysis of Increase and Decrease Algorithms", DEC Technical Report TR-509, Digital Equipment Corporation, April 1987.]]

[4]

K. K. Ramakrishnan, D.-M. Chiu, and R. Jain "Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part IV-A Selective Binary Feedback Scheme for General Topologies", DEC Technical Report TR-510, Digital Equipment Corporation, November 1987.]]

[5]

A. Fraser and S. Morgan, "Queueing and Framing Disciplines for a Mixture of Data Traffic Types", AT&T Bell Laboratories Technical Journal, Volume 63, No. 6, pp 1061-1087, 1984.]]

[6]

E. Gafni and D. Bertsekas, "Dynamic Control of Session Input Rates in Communication Networks", IEEE Transactions on Automatic Control, Volume 29, No. 10, pp 1009-1016, 1984.]]

[7]

M. Gerla and L. Kleinrock, "Flow Control: A Comparative Survey", {EEE Transactions on Communications, Volume 28, pp 553-574, 1980.]]

[8]

A. Greenberg and N. Madras, private communication, 1989.]]

[9]

E. Hahne, "Round Robin Scheduling for Fair Flow Control in Data Communication Networks", Report LIDS-TH-1631, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts. December, 1986.]]

[10]

E. Hashem, private communication. 1989.]]

[11]

A. Heybey and C. Davin, private communication, 1989.]]

[12]

International Organization for Standardization (ISO), "Protocol for Providing the Connectionless Mode Network Service", Draft International Standard 8473, 1986.]]

Digital Library

[13]

V. Jacobson, "Congestion Avoidance and Control", ACM SigComm Proceedings, pp 314-329, 1988.]]

Digital Library

[14]

V. Jacobson, private communication, 1988.]]

[15]

R. Jain, "Divergence of Timeout Algorithms for Packet Retransmission", Proceedings of the Fifth Annual International Phoenix Conference on Computers and Communications, pp 1162-1167, 1987.]]

[16]

P. Karn and C. Partridge, "Improving Round-Trip Time Estimates in Reliable Transport Protocols", ACM SigComm Proceedings, pp 2-7, 1987.]]

Digital Library

[17]

M. Katevenis, "Fast Switching and Fair Control of Congested Flow in Broadband Networks", IEEE Journal on Selected Areas in Communications, Volume 5, No. 8, pp 1315-1327, 1987.]]

Digital Library

[18]

C.-Y. Lo, "Performance Analysis and Application of a Two-Priority Packet Queue", AT&T Technical Journal, Volume 66, No. 3, pp 83-99, 1987.]]

[19]

D. Luan and D. Lucantoni, "Throughput Analysis of an Adaptive Window-Based Flow Control Subject to Bandwidth Management", Proceedings of the International Teletraffic Conference, 1988.]]

[20]

A. Mankin and K. Thompson, "Limiting Factors in the Performance of the Slostart TCP Algorithms", preprint.]]

[21]

S. Morgan, "Queueing Disciplines and Passive Congestion Control in Byte- Stream Networks", IEEE INFOCOM '89 Proceedings, pp 711-720, 1989.]]

[22]

D. Mills and W.-W. Braun, "The NSFNET Backbone Network", ACM SigComm Proceedings, pp 191-196, 1987.]]

Digital Library

[23]

D. Mills, "The Fuzzball", ACM SigComm Proceedings, pp 115-122. 1988.]]

Digital Library

[24]

J. Nagle, "Congestion Control in IP/TCP Networks, Computer Communication Review, Vol 14, No. 4, pp 11-17, 1984.]]

Digital Library

[25]

J. Nagle, "On Packet Switches with Infinite Storage", RFC 896 1985.]]

[26]

J. Nagle, "On Packet Switches with Infinite Storage", IEEE Transactions on Communications, Volume 35, pp 435-438, 1987.]]

[27]

D. Bacon, A. Dupuy, J. Schwartz, and Y. Yemini, "Nest: A Network Simulation and Prototyping Tool", Dallas Winter 1988 Usenix Conference Proceedings, pp. 71-78, 1988.]]

[28]

IETF Performance and Congestion Control Working Group, "Gateway Congestion Control Policies", draft, 1989.]]

[29]

J. Postel, "Internet Protocol", RFC 791 1981.]]

[30]

W. Prue and J. Postel, "A Queueing Algorithm to Provide Type-of-Service for IP Links", RFC1046, 1988.]]

Digital Library

[31]

S. Shenker, "Game-Theoretic Analysis of Gateway Algorithms", in preparation, 1989.]]

[32]

S. Shenker, "Comments on the IETF Performance and Congestion Control Working Group Draft on Gateway Congestion Control Policies", unpublished, 1989.]]

[33]

H. Sturgis, private communication, 1988.]]

[34]

USC Information Science Institute, "Transmission Control Protocol", RFC 793, 1981.]]

[35]

Xerox Corporation, "Internet Transport Protoco Is", XSIS 028112, 1981.]]

[36]

L. Zhang, "A New Architecture for Packet Switching Network Protocols", MIT Ph.D. Thesis, forthcoming, 1989.]]

Cited By

Ren ZDoekemeijer KTrivedi ABalsamo SKnottenbelt WAbad CShang W(2024)A Systematic Configuration Space Exploration of the Linux Kyber I/O SchedulerCompanion of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629527.3651416(167-173)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629527.3651416
Ren ZDoekemeijer KTehrany NTrivedi ABalsamo SKnottenbelt WAbad CShang W(2024)BFQ, Multiqueue-Deadline, or Kyber? Performance Characterization of Linux Storage Schedulers in the NVMe EraProceedings of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629526.3645053(154-165)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629526.3645053
Zainaddin DHanapi ZOthman MAhmad Zukarnain ZAbdullah M(2024)Recent trends and future directions of congestion management strategies for routing in IoT-based wireless sensor network: a thematic reviewWireless Networks10.1007/s11276-023-03598-w30:3(1939-1983)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11276-023-03598-w
Show More Cited By

Index Terms

Analysis and simulation of a fair queueing algorithm

Recommendations

Analysis and simulation of a fair queueing algorithm

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 ...
Read More
Rainbow fair queueing: theory and applications

Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of end-to-end congestion control mechanisms. Traditional mechanisms to achieve fair sharing (e.g., Weighted Fair Queueing, ...
Read More
Dynamic Fair Queuing (DFQ): A Novel Fair Scheduler Improving Wireless Transmission over Hybrid LANs
ISCC '03: Proceedings of the Eighth IEEE International Symposium on Computers and Communications

Local area network (LAN) will be a hybrid networkthat includes wired and wireless links together.Nonetheless, the wired hosts always take the mostbandwidth and bring about the bandwidth allocationunfairness. This problem is caused by the flow ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '89: Symposium proceedings on Communications architectures & protocols

August 1989

313 pages

ISBN:0897913329

DOI:10.1145/75246

Chairman:
Lawrence H. Landweber

ACM SIGCOMM Computer Communication Review Volume 19, Issue 4
Sep. 1989
311 pages
ISSN:0146-4833
DOI:10.1145/75247
Editor:
Craig Partridge
Bolt Beranek and Newman Inc., Cambridge, MA
Issue’s Table of Contents

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCOMM89

Sponsor:

SIGCOMM

SIGCOMM89: Communications Architectures & Protocols

September 25 - 27, 1989

Texas, Austin, USA

Acceptance Rates

Overall Acceptance Rate 554 of 3,547 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,704
Total Citations
View Citations
15,006
Total Downloads

Downloads (Last 12 months)743
Downloads (Last 6 weeks)69

Other Metrics

View Author Metrics

Citations

Cited By

Ren ZDoekemeijer KTrivedi ABalsamo SKnottenbelt WAbad CShang W(2024)A Systematic Configuration Space Exploration of the Linux Kyber I/O SchedulerCompanion of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629527.3651416(167-173)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629527.3651416
Ren ZDoekemeijer KTehrany NTrivedi ABalsamo SKnottenbelt WAbad CShang W(2024)BFQ, Multiqueue-Deadline, or Kyber? Performance Characterization of Linux Storage Schedulers in the NVMe EraProceedings of the 15th ACM/SPEC International Conference on Performance Engineering10.1145/3629526.3645053(154-165)Online publication date: 7-May-2024
https://dl.acm.org/doi/10.1145/3629526.3645053
Zainaddin DHanapi ZOthman MAhmad Zukarnain ZAbdullah M(2024)Recent trends and future directions of congestion management strategies for routing in IoT-based wireless sensor network: a thematic reviewWireless Networks10.1007/s11276-023-03598-w30:3(1939-1983)Online publication date: 1-Apr-2024
https://dl.acm.org/doi/10.1007/s11276-023-03598-w
Carmel DKeslassy I(2023)Dragonfly: In-Flight CCA Identification2023 IFIP Networking Conference (IFIP Networking)10.23919/IFIPNetworking57963.2023.10186432(1-9)Online publication date: 12-Jun-2023
https://doi.org/10.23919/IFIPNetworking57963.2023.10186432
Brown LKothari YNarayan AKrishnamurthy APanda ASherry JShenker S(2023)How I Learned to Stop Worrying About CCA ContentionProceedings of the 22nd ACM Workshop on Hot Topics in Networks10.1145/3626111.3628204(229-237)Online publication date: 28-Nov-2023
https://dl.acm.org/doi/10.1145/3626111.3628204
Mohan ALiu YFoster NKappé TKozen D(2023)Formal Abstractions for Packet SchedulingProceedings of the ACM on Programming Languages10.1145/36228457:OOPSLA2(1338-1362)Online publication date: 16-Oct-2023
https://dl.acm.org/doi/10.1145/3622845
Katebzadeh MCosta PGrot BFedorova ANarayanan DDi Luna GQuerzoni L(2023)Saba: Rethinking Datacenter Network Allocation from Application's PerspectiveProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3587450(623-638)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3587450
Wen ZYang RQian BXuan YLu LWang ZPeng HXu JZomaya ARanjan R(2023)Janus: Latency-Aware Traffic Scheduling for IoT Data Streaming in Edge EnvironmentsIEEE Transactions on Services Computing10.1109/TSC.2023.331213116:6(4302-4316)Online publication date: Nov-2023
https://doi.org/10.1109/TSC.2023.3312131
You CZhao YFeng GQuek TLi L(2023)Hierarchical Multiresource Fair Queueing for Packet ProcessingIEEE Transactions on Network and Service Management10.1109/TNSM.2022.319774720:1(726-740)Online publication date: Mar-2023
https://doi.org/10.1109/TNSM.2022.3197747
Zheng JWu CLan TTian CChen G(2023)Revisiting Weighted AIMD-based Congestion Control: A Comprehensive Perspective2023 IEEE/ACM 31st International Symposium on Quality of Service (IWQoS)10.1109/IWQoS57198.2023.10188753(1-10)Online publication date: 19-Jun-2023
https://doi.org/10.1109/IWQoS57198.2023.10188753
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents