Abstract
This paper proposes Early Congestion Detection and Control (ECDC) gateways for congestion avoidance which detects early congestion by computing the average queue size and can notify connections of congestion either by dropping packets or by setting a bit in packet headers. When the average queue size exceeds a preset threshold, the gateway drops or marks each arriving packet with a certain probability which is a function of the average queue size. ECDC gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection’s share of the bandwidth through the gateway.
This work is supported by grants from the National Natural Science Foundation of China (Grant No. #90104002 & #2003AA142080) an by Computer Software Lab. of Sichuan Normal University.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Clark, D.D., Shenker, S., Zhang, L.: Supporting Real-Time Applications in an Integrated Services Packet Network: Architecture and Mechanism. In: SIGCOMM 2002, August 2002, pp. 14–26 (2002)
Hashem, E.: Analysis of random drop for gateway congestion control, Report LCS TR- 465, Laboratory for Computer Science, MIT, Cambridge, MA (2002)
Jacobson, V.: Congestion Avoidance and Control. In: Proceedings of SIGCOMM 1998, August 1998, pp. 314–329 (1998)
Jain, R.: A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks. Computer Communication Review 19(5), 56–71 (2002)
Keshav, S.: A Control-Theoretic Approach to Flow Control. In: Proceedings of SIGCOMM 1991, September 2002, pp. 3–16 (2002)
Mankin, A., Ramakrishnan, K.K.: editors for the IETF Performance and Congestion Control Working Group, Gateway congestion control survey, RFC 1254 (August 1991)
Mishra, P., Kanakia, H.: A Hop by Hop Rate-based Congestion Control Scheme. In: Proceedings of SIGCOMM 1992, August 1992, pp. 112–123 (1992)
Mitra, D., Seery, J.: Dynamic Adaptive Windows for High Speed Data Networks: Theory and Simulations. In: Proceedings of SIGCOMM 2000, September 2000, pp. 30–40 (2000)
Young, P.: Recursive Estimation and Time-Series Analysis, pp. 60–65. Springer, Heidelberg (1984)
Zhang, L.: A New Architecture for Packet Switching Network Protocols. MIT/LCS/TR-455, Laboratory for Computer Science, Massachusetts Institute of Technology (August 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, W., Duan, HX., Wu, JP., Li, X., Ren, P. (2004). Algorithms for Congestion Detection and Control. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004 Workshops. GCC 2004. Lecture Notes in Computer Science, vol 3252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30207-0_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-30207-0_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23578-1
Online ISBN: 978-3-540-30207-0
eBook Packages: Springer Book Archive