Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/316188.316220acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

An integrated congestion management architecture for Internet hosts

Published: 30 August 1999 Publication History

Abstract

This paper presents a novel framework for managing network congestion from an end-to-end perspective. Our work is motivated by trends in traffic patterns that threaten the long-term stability of the Internet. These trends include the use of multiple independent concurrent flows by Web applications and the increasing use of transport protocols and applications that do not adapt to congestion. We present an end-system architecture centered around a Congestion Manager (CM) that ensures proper congestion behavior and allows applications to easily adapt to network congestion. Our framework integrates congestion management across all applications and transport protocols. The CM maintains congestion parameters and exposes an API to enable applications to learn about network characteristics, pass information to the CM, and schedule data transmissions. Internally, it uses a window-based control algorithm, a scheduler to regulate transmissions, and a lightweight protocol to elicit feedback from receivers.We describe how TCP and an adaptive real-time streaming audio application can be implemented using the CM. Our simulation results show that an ensemble of concurrent TCP connections can effectively share bandwidth and obtain consistent performance, without adversely affecting other network flows. Our results also show that the CM enables audio applications to adapt to congestion conditions without having to perform congestion control or bandwidth probing on their own. We conclude that the CM provides a useful and pragmatic framework for building adaptive Internet applications.

References

[1]
BALAKRISHNAN, H., PADMANABHAN, V. N., SESHAN, S., STEMM, M., AND KATZ, R. TCP Behavior of a Busy Web Server: Analysis and Improvements. In Proc. IEEE INFO- tOM (Mar. 1998).]]
[2]
BENNETT, J., AND ZSANC, H. Hierarchical Packet Fair Queueing Algorithms. In Proc. A CM SIGCOMM (Aug. 1996).]]
[3]
BoLoT, J., TWLETTZ, T., AND WAKEMAN, I. Scalable Feedback for Multicast Video Distribution in the Internet. In Proc. A CA/{ SIGCOMM (London, England, Aug 1994).]]
[4]
Cutu, D.-M., AND JAIN, R. Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Compurer Networks. Computer Networks and ISDN Systems 17 (1989), 1-14.]]
[5]
CLARK, D., SHENKER, S., AND ZHANO, L. Supporting Real- Time Applications in an Integrated Services Packet Network: Architecture and Mechanisms. In Proc. A CM $IGCOMM (August 1992).]]
[6]
CL^RK, D., ANO TENNENHOUSP., D. Architectural Consideration for a New Generation of Protocols. In Proc. A CM SIGCOMM (September 1990).]]
[7]
DEMERS, A., Kr_~HAV, S., AND SI~ENKER, S. Analysis and Simulations of a Fair-Queueing Algorithm. lnternetworking: Research and Experience V, 17 (1990), 3-26.]]
[8]
FsaaAal, D., AND VERMA, D. A scheme for real-time communication services in wide-area networks. IEEE Journal on Selected Areas in Communications 8, 3 (Apr. 1990), 368- 379.]]
[9]
FLOYD, S. Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: One-way Traffic. Compurer Communications Review ~1, 5 (Oct. 1991).]]
[10]
FLOYD, S. TCP and Explicit Congestion Notification. Computer Communications Review ~j, 5 (Oct. 1994).]]
[11]
GETTYS, J. Mux protocol specification, wd-mux-961023. http://www.w3.org/pub/WWW/Protocols/MUX/WD- mux-961023.html, 1996.]]
[12]
HASnEM, E. Analysis of Random Drop for Gateway Congestion Control. Tech. Rep. LCS TR-465, Laboratory for Computer Science, MIT, 1989.]]
[13]
HOE, J. C. Improving the Start-up Behavior of a Congestion Control Scheme for TCP. In Proc. A CM SIGCOMM '96 (Aug. 1996).]]
[14]
HOLTMAN, K. ~ansparent Content Negotiation in HTTP. RFC, March 1998. RFC-2295.]]
[15]
JACOnSON, V. Congestion Avoidance and Control. In Proc. ACM $IGCOMM 88 (August 1988).]]
[16]
JAtN, R. The Art of Computer Systems Performance Analysis. John Wiley and Sons, 1991.]]
[17]
KALMANEK, C. R,., KANAKIA, H., AND KESHAV, S. Rate Controlled Servers for Very High-Speed Networks. In Proceedings of the IEEE Conference on Global Communications (Dec 1990).]]
[18]
MCCANN~, S., JACOBSON, V., AND V~TT~.rtL~, M. Receiverdriven Layered Multicast. In Proc A CM $IGCOMM (Aug. 1996).]]
[19]
MOGUL, J., ANO DEERINO, S. Path MTU Discovery, Nov 1990. RFC-1191.]]
[20]
ns-2 Network Simulator. http://www-mash .cs.berkeley. edu/ns/, 1998.]]
[21]
PADMANABHAN, V. Addressing the Challenges of Web Data Transport. PhD thesis, Univ. of California, Berkeley, September 1998.]]
[22]
PAREgH, A. K., AND GALLAGF. R, I~. G. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM 7kansactions on Networking 1, 3 (June 1993), 344-357.]]
[23]
RAMAKRISaNAN, K., AND FLOYD, S. A Proposal to Add Explicit Congestion Notification (ECN) to IPv6 and to TCP. Internet Draft draft-kksjf-ecn-00.txt, Nov. 1997. Work in progress.]]
[24]
REJAIE, R., HANDLEY, M., AND ESTRIN, D. R. AP: An Endto-end Rate-based Congestion Control Mechanism for Realtime Streams in the Internet. To appear in Proc. Infocom 99.]]
[25]
Reliable Multicast Research Group. http://www.east.isi.edu/RMRG/, 1997.]]
[26]
SAL?ZER, J., REED, D., AND CLARE, D. End-to-end Arguments in System Design. A CA// Ikansactions on Computer Systems ~ (Nov 1984), 277-288.]]
[27]
SC~tULZRINNE, H., CASN~.t~, S., FREOERICK, lq., AND JACOB- SON, V. RTP: A Transport Protocol for Real-Time Applications. RFC, Jan 1996. RFC-1889.]]
[28]
SPERO, S. Session Control Protocol (SCP). http:// www.w3.org/pub/WW / Protocols/HTTP-NG/http-ngscp.html, 1996.]]
[29]
STEVENS, W. R,. UNIX Network Programming. Addison- Wesley, Reading, MA, 1992.]]
[30]
STEVENS, W. I:L. TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms, Jan 1997. RFC-2001.]]
[31]
S'rOrCA, I., AND ZEANG, H. A Hierarchical Fair Service Curve Algorithm for Link-Sharing, Real-Time and Priority Services. In Proc. A CM SIGCOMM '97 (1997).]]
[32]
TOUCH, J. TCP Control Block Interdependence. YtFC, April 1997. RFC-2140.]]
[33]
VINT Project. http://netweb.usc.edu/vint, 1998.]]
[34]
WebTP Home Page. http://webtp.eecs.berkeley, edu/, 1999.]]
[35]
ZaAN~, L. A New Architecture for Packet Switching Network Protocols. Tech. Rep. LCS TR-455, Laboratory for Computer Science, MIT, Aug. 1989.]]
[36]
ZSANG, L., DgEa~N~, S., ESTrUN, D., SHENKER, S., AND ZAPPALA, D. RSVP: A new resource ReSerVation Protocol. IEEE Network Magazine (Sept. 1993), 8-18.]]

Cited By

View all
  • (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
  • (2023)On Augmenting TCP/IP Stack via eBPFProceedings of the 1st Workshop on eBPF and Kernel Extensions10.1145/3609021.3609300(15-20)Online publication date: 10-Sep-2023
  • (2022)Reproducing Key Results from "Restructuring Endpoint Congestion Control"2022 Workshop on Benchmarking Cyber-Physical Systems and Internet of Things (CPS-IoTBench)10.1109/CPS-IoTBench56135.2022.00010(17-21)Online publication date: May-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '99: Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
August 1999
320 pages
ISBN:1581131356
DOI:10.1145/316188
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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 August 1999

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGCOMM99
Sponsor:

Acceptance Rates

SIGCOMM '99 Paper Acceptance Rate 24 of 190 submissions, 13%;
Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)191
  • Downloads (Last 6 weeks)24
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (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
  • (2023)On Augmenting TCP/IP Stack via eBPFProceedings of the 1st Workshop on eBPF and Kernel Extensions10.1145/3609021.3609300(15-20)Online publication date: 10-Sep-2023
  • (2022)Reproducing Key Results from "Restructuring Endpoint Congestion Control"2022 Workshop on Benchmarking Cyber-Physical Systems and Internet of Things (CPS-IoTBench)10.1109/CPS-IoTBench56135.2022.00010(17-21)Online publication date: May-2022
  • (2021)HierCC: Hierarchical RDMA Congestion ControlProceedings of the 5th Asia-Pacific Workshop on Networking10.1145/3469393.3469396(29-36)Online publication date: 24-Jun-2021
  • (2021)Site-to-site internet traffic controlProceedings of the Sixteenth European Conference on Computer Systems10.1145/3447786.3456260(574-589)Online publication date: 21-Apr-2021
  • (2020)Perfect is the Enemy of Good: Lloyd-Max Quantization for Rate Allocation in Congestion Control PlaneNOMS 2020 - 2020 IEEE/IFIP Network Operations and Management Symposium10.1109/NOMS47738.2020.9110387(1-9)Online publication date: Apr-2020
  • (2019)Perfect is the Enemy of Good: Lloyd-Max Quantization for Rate Allocation in Congestion Control Plane2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)10.1109/ANCS.2019.8901887(1-4)Online publication date: Sep-2019
  • (2018)Multipath IP Routing on End Devices: Motivation, Design, and Performance2018 IFIP Networking Conference (IFIP Networking) and Workshops10.23919/IFIPNetworking.2018.8696893(1-9)Online publication date: May-2018
  • (2018)Rethinking Networking for "Five Computers"Proceedings of the 17th ACM Workshop on Hot Topics in Networks10.1145/3286062.3286076(92-98)Online publication date: 15-Nov-2018
  • (2018)Restructuring endpoint congestion controlProceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication10.1145/3230543.3230553(30-43)Online publication date: 7-Aug-2018
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media