Algorithms for congestion detection and control

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Liu, W., Duan, H. X., Wu, J. P., Li, X., & Ren, P. (2004). Algorithms for congestion detection and control. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3252, 374–381. https://doi.org/10.1007/978-3-540-30207-0_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free