A new congestion control scheme

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A new congestion control scheme: slow start and search (Tri-S)

Full text

Pdf (685 KB)

Source

ACM SIGCOMM Computer Communication Review archive
Volume 21 , Issue 1 (January 1991) table of contents

Pages: 32 - 43

Year of Publication: 1991

ISSN:0146-4833

Authors

Zheng Wang
Jon Crowcroft

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 47, Citation Count: 11

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/116030.116033 What is a DOI?

ABSTRACT

Recently there have been many measures proposed to tackle the problem of congestion in computer networks. In this paper, we first analyze some of the measures and then present a new scheme in which the optimal operating point is obtained by evaluation of throughput gradient and resource sharing is adjusted only at the beginning and the end of a connection. Simulation results show that the scheme converges to an optimal operating point quickly and fairly.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	[1] R. Jain, "A Timeout-Based Congestion Control Scheme for Window Flow-Controlled Networks," IEEE Jour. on Selected Areas of Communications, Vol. SAC-4, No. 7, pp. 1162-1167, Oct. 1986.
	2	R. Jain, A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks, ACM SIGCOMM Computer Communication Review, v.19 n.5, p.56-71, Oct. 1989 [doi>10.1145/74681.74686]
	3	K. K. Ramakrishnan , R. Jain, A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer, Symposium proceedings on Communications architectures and protocols, p.303-313, August 16-18, 1988, Stanford, California, United States
	4	V. Jacobson, Congestion avoidance and control, Symposium proceedings on Communications architectures and protocols, p.314-329, August 16-18, 1988, Stanford, California, United States
	5	W. Prue , J. Postel, Something a host could do with source quench: The Source Quench Introduced Delay (SQuID), RFC Editor, 1987
	6	A. Demers , S. Keshav , S. Shenker, Analysis and simulation of a fair queueing algorithm, Symposium proceedings on Communications architectures & protocols, p.1-12, September 25-27, 1989, Austin, Texas, United States
	7	[7] L. Zhang, "A New Architecture for Packet Switching Network Protocols," PhD Thesis, MIT, 1989.
	8	D.-M. Chiu , R. Jain, Analysis of the increase and decrease algorithms for congestion avoidance in computer networks, Computer Networks and ISDN Systems, v.17 n.1, p.1-14, June 10, 1989 [doi>10.1016/0169-7552(89)90019-6]
	9	[9] K. K. Ramakrishnan, R. Jain and D. M. Chiu, "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, 1987.

CITED BY 11

	Lawrence S. Brakmo , Sean W. O'Malley , Larry L. Peterson, TCP Vegas: new techniques for congestion detection and avoidance, ACM SIGCOMM Computer Communication Review, v.24 n.4, p.24-35, Oct. 1994
	Lotfi Benmohamed , Semyon M. Meerkov, Feedback control of congestion in packet switching networks: the case of a single congested node, IEEE/ACM Transactions on Networking (TON), v.1 n.6, p.693-708, Dec. 1993
	Jong Suk Ahn , Peter B. Danzig , Zhen Liu , Limin Yan, Evaluation of TCP Vegas: emulation and experiment, ACM SIGCOMM Computer Communication Review, v.25 n.4, p.185-195, Oct. 1995
	Sally Floyd , Van Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking (TON), v.1 n.4, p.397-413, Aug. 1993
	Saad Biaz , Nitin H. Vaidya, Is the round-trip time correlated with the number of packets in flight?, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, October 27-29, 2003, Miami Beach, FL, USA
	Saâd Biaz , Nitin H. Vaidya, "De-randomizing" congestion losses to improve TCP performance over wired-wireless networks, IEEE/ACM Transactions on Networking (TON), v.13 n.3, p.596-608, June 2005
	Rick Wilder , K. K. Ramakrishnan , Allison Mankin, Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed, ACM SIGCOMM Computer Communication Review, v.21 n.2, p.43-58, April 1991
	Sakib A. Mondal , Faisal B. Luqman, Improving TCP performance over wired-wireless networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.51 n.13, p.3799-3811, September, 2007
	Zheng Wang , Jon Crowcroft, Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm, ACM SIGCOMM Computer Communication Review, v.22 n.2, p.9-16, April 1992
	Sally Floyd, TCP and explicit congestion notification, ACM SIGCOMM Computer Communication Review, v.24 n.5, p.8-23, Oct. 1994
	Sumitha Bhandarkar , A. L. Narasimha Reddy , Yueping Zhang , Dimitri Loguinov, Emulating AQM from end hosts, ACM SIGCOMM Computer Communication Review, v.37 n.4, October 2007