More Web Proxy on the site http://driver.im/

article

Free access

Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic

Author:

Sally FloydAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 21, Issue 5

Pages 30 - 47

https://doi.org/10.1145/122431.122434

Published: 01 October 1991 Publication History

Abstract

In this paper we explore the bias in TCP/IP networks against connections with multiple congested gateways. We consider the interaction between the bias against connections with multiple congested gateways, the bias of the TCP window modification algorithm against connections with longer roundtrip times, and the bias of Drop Tail and Random Drop gateways against bursty traffic. Using simulations and a heuristic analysis, we show that in a network with the window modification algorithm in 4.3 tahoe BSD TCP and with Random Drop or Drop Tail gateways, a longer connection with multiple congested gateways can receive unacceptably low throughput. We show that in a network with no bias against connections with longer roundtrip times and with no bias against bursty traffic, a connection with multiple congested gateways can receive an acceptable level of throughput.We discuss the application of several current measures of fairness to networks with multiple congested gateways, and show that different measures of fairness have quite different implications. One view is that each connection should receive the same throughput in bytes/second, regardless of roundtrip times or numbers of congested gateways. Another view is that each connection should receive the same share of the network's scarce congested resources. In general, we believe that the fairness criteria for connections with multiple congested gateways requires further consideration.

References

[1]

{BDSY88} Bacon, D., Dupuy, A., Schwartz, J., and Yemimi, Y., "Nest: a Network Simulation and Prototyping Tool", Proceedings of Winter 1988 Usenix Conference, 1988, pp. 17- 78.

[2]

{BJ81} Bharath-Kumar, K., and Jeffrey, J., A New Approach to Performance-Oriented Flow Control, IEEE Transactions on Communications, Vol. COM-29 N.4, April 1981.

[3]

{CDJM91} Cáceres, R., Danzig, P., Jamin, S., and Mitzel, D., "Characteristics of Wide-Area TCP/IP Conversations", to appear in SIGCOMM'91.

Digital Library

[4]

{CJ89} Chiu, D.-M., and Jain, R., "Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks", Computer Networks and ISDN Systems, V. 17, pp. 1-14, 1989.

Digital Library

[5]

{DKS90} Demers, A., Keshav, S., and Shenker, S., "Analysis and Simulation of a Fair Queueing Algorithm", Internetworking: Research and Experience, Vol. 1, 1990, p. 3-26.

[6]

{FJ91a} Floyd, S., and Jacobson, V., Traffic Phase Effects in Packet-Switched Gateways , Computer Communication Review, V.21 N.2, April 1991.

Digital Library

[7]

{FJ91b} Floyd, S., and Jacobson, V., On Traffic Phase Effects in Packer-Switched Gateways , in preparation. (This is a longer version of the paper above.)

[8]

{FJ91c} Floyd, S., and Jacobson, V., Random Early Detection gateways for congestion avoidance , in preparation.

[9]

{H89} Hashem, E., "Analysis of random drop for gateway congestion control", Report LCS TR-465, Laboratory for Computer Science, MIT, Cambridge, MA, 1989.

[10]

{HG86} Hahne, E., and Gallager, R., Round Robin Scheduling for Fair Flow Control in Data Communications Networks, IEEE International Conference on Communications, June, 1986.

[11]

{J88} Jacobson, V., Congestion Avoidance and Control, Proceedings of SIGCOMM '88, August 1988.

Digital Library

[12]

{JB88} Jacobson, V., and Braden, R., "RFC 1072: TCP Extensions for Long-Delay Paths", October 1988.

[13]

{J90} Jacobson, V., Berkeley TCP Evolution from 4.3-tahoe to 4.3-reno, "Proceedings of the Eighteenth Internet Engineering Task Force", Vancouver, British Columbia, August, 1990.

[14]

{JCH84} Jain, R., Chiu, D.M., and Hawe, W., "A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Systems." DEC FR-301, Littleton, MA: Digital Equipment Corporation.

[15]

{K88} Keshay. S., "REAL: a Network Simulator", Report 88/472, Computer Science Department, University of California at Berkeley, Berkeley, California, 1988.

Digital Library

[16]

{M90a} Mankin, A., "A Measurement Study of Random Drop and Gateway Interaction", 1990.

[17]

{M90b} Mankin, A., Random Drop Congestion Control, Proceedings of SIGCOMM 90, Sept. 1990.

Digital Library

[18]

{MS90} Mitra, D. and Seery, J., Dynamic Adaptive Windows for High Speed Data Networks: Theory and Simulations, AT&T Bell Laboratories report, April 1990.

[19]

{RCJ87} Ramakrishnan, K.K., Chiu, D., and Jain, R., "Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part IV: A Selective Binary Feed-back Scheme for General Topologies", DEC-TR-510, November, 1987.

[20]

{RJ90} Ramakrishnan, K.K. and Jain, Raj, "A Binary Feedback Scheme for Congestion Avoidance in Computer Networks", ACM Transactions on Computer Systems, V. 8, N. 2, p. 158-181, 1990.

Digital Library

[21]

{R83} Ross, S., Stochastic Processes, John Wiley & Sons, 1983.

[22]

{WRM91} Wilder, R., Ramakrishnan, K.K., and Mankin, A., "Dynamics of Congestion Control and Avoidance in Two-Way Traffic in an OSI Testbed", Computer Communica - tion Review, V.21 N.2, April 1991, p. 43-58.

Digital Library

[23]

{ZC91} Zhang, L., and Clark, D., "Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic", to appear in SIGCOMM'91.

Digital Library

[24]

{Z89} Zhang, L., "A New Architecture for Packet Switching Network Protocols", MIT LCS TR-455, Laboratory for Computer Science, Massachusetts Institute of Technology, Au - gust 1989.

Cited By

Li Q(2024)TCP FlexiS: A New Approach to Incipient Congestion Detection and ControlIEEE/ACM Transactions on Networking10.1109/TNET.2023.331944132:2(1245-1260)Online publication date: Apr-2024
https://doi.org/10.1109/TNET.2023.3319441
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
Baganal-Krishna NTran TKundel RRizk A(2023)RPM: Reverse Path Congestion Marking on P4 Programmable Switches2023 IEEE 48th Conference on Local Computer Networks (LCN)10.1109/LCN58197.2023.10223327(1-4)Online publication date: 2-Oct-2023
https://doi.org/10.1109/LCN58197.2023.10223327
Show More Cited By

Index Terms

Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic

Recommendations

Traffic phase effects in packet-switched gateways

Much of the traffic in existing packet networks is highly periodic, either because of periodic sources (e.g., real time speech or video, rate control) or because window flow control protocols have a periodic cycle equal to the connection roundtrip time (...
AQM performance in multiple congested link networks
ACMSE '05 vol 2: Proceedings of the 43rd annual ACM Southeast Conference - Volume 2

TCP Reno, the most widely used implementation on the Internet, uses retransmission timeouts and the receipt of three duplicate ACKs to detect packet loss in the network. In case of multiple congested links, it is important to detect packet losses as ...
A study of a high speed packet scheduling method for achieving fairness among TCP connections

In this paper, we first investigate the fairness between TCP Reno and TCP Vegas by focusing on the situation where Reno and vegas connections share the bottleneck link. From the analysis and the simulation results, we find that the performance of TCP ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 21, Issue 5

Oct. 1991

94 pages

ISSN:0146-4833

DOI:10.1145/122431

Editor:
David Oran
Digital Equipment Corp. Littleton, MA

Issue’s Table of Contents

Copyright © 1991 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1991

Published in SIGCOMM-CCR Volume 21, Issue 5

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

281
Total Citations
View Citations
623
Total Downloads

Downloads (Last 12 months)88
Downloads (Last 6 weeks)22

Reflects downloads up to 19 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li Q(2024)TCP FlexiS: A New Approach to Incipient Congestion Detection and ControlIEEE/ACM Transactions on Networking10.1109/TNET.2023.331944132:2(1245-1260)Online publication date: Apr-2024
https://doi.org/10.1109/TNET.2023.3319441
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
Baganal-Krishna NTran TKundel RRizk A(2023)RPM: Reverse Path Congestion Marking on P4 Programmable Switches2023 IEEE 48th Conference on Local Computer Networks (LCN)10.1109/LCN58197.2023.10223327(1-4)Online publication date: 2-Oct-2023
https://doi.org/10.1109/LCN58197.2023.10223327
Kuo JWang CShi YYang DChen W(2022)Scalable Rate Allocation for SDN With Diverse Service RequirementsIEEE Transactions on Services Computing10.1109/TSC.2020.304359515:4(2248-2260)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TSC.2020.3043595
Sun SWang YYang LWang YYu QLiu Y(2022)Mining Urban Sustainability: Vehicle Emission Changes on Traffic Corridor by One-Way Traffic ConversionJournal of Transportation Engineering, Part A: Systems10.1061/JTEPBS.0000662148:5Online publication date: May-2022
https://doi.org/10.1061/JTEPBS.0000662
Tran VTourrilhes JRamakrishnan KSharma P(2021)Accurate Available Bandwidth Measurement with Packet Batching Mitigation for High Speed Networks2021 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)10.1109/LANMAN52105.2021.9478812(1-6)Online publication date: 12-Jul-2021
https://doi.org/10.1109/LANMAN52105.2021.9478812
Bao JShao J(2021)Optimal Markovian Coupling and Exponential Convergence Rate for the TCP ProcessActa Mathematica Sinica, English Series10.1007/s10114-021-9187-1Online publication date: 22-Jan-2021
https://doi.org/10.1007/s10114-021-9187-1
Brown LAnanthanarayanan GKatz-Bassett EKrishnamurthy ARatnasamy SSchapira MShenker SZhao BZheng HMadhyastha HPadmanabhan V(2020)On the Future of Congestion Control for the Public InternetProceedings of the 19th ACM Workshop on Hot Topics in Networks10.1145/3422604.3425939(30-37)Online publication date: 4-Nov-2020
https://dl.acm.org/doi/10.1145/3422604.3425939
Fan JGao KXing YLu J(2019)Evaluating the Effects of One-Way Traffic Management on Different Vehicle Exhaust Emissions Using an Integrated ApproachJournal of Advanced Transportation10.1155/2019/62487962019(1-11)Online publication date: 16-Dec-2019
https://doi.org/10.1155/2019/6248796
Ware RMukerjee MSeshan SSherry J(2019)Beyond Jain's Fairness IndexProceedings of the 18th ACM Workshop on Hot Topics in Networks10.1145/3365609.3365855(17-24)Online publication date: 13-Nov-2019
https://dl.acm.org/doi/10.1145/3365609.3365855
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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 Issue’s Table of Contents