| Active queue management with flow proportional buffering |
| Full text |
Pdf
(333 KB)
|
| Source
|
International Journal of Network Management
archive
Volume 13 , Issue 3 (May 2003)
table of contents
Pages: 211 - 229
Year of Publication: 2003
ISSN:1099-1190
|
|
Authors
|
|
James Aweya
|
Nortel Networks, P.O. Box 3511, Station C, Ottawa, Canada K1Y 4H7
|
|
Michel Ouellette
|
Nortel Networks, P.O. Box 3511, Station C, Ottawa, Canada K1Y 4H7
|
|
Delfin Y. Montuno
|
Nortel Networks, P.O. Box 3511, Station C, Ottawa, Canada K1Y 4H7
|
|
| Publisher |
John Wiley & Sons, Inc.
New York, NY, USA
|
| Bibliometrics |
Downloads (6 Weeks): 0, Downloads (12 Months): 5, Citation Count: 0
|
|
|
ABSTRACT
Most active queue management schemes maintain an average of the queue length which they use together with a number of queue thresholds to detect congestion. However, the setting of the queue thresholds is problematic because the required buffer size for good sharing among TCP connections is dependent on the number of TCP connections using the buffer. This paper describes an improved active queue management scheme which dynamically changes its threshold settings as the number of connections and system load changes. This technique allows network devices to effectively control packet losses and TCP timeouts while maintaining high link utilization.
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. Morris R. Scalable TCP congestion control. Proc. IEEE INFOCOM 2000; 1176-1183.
|
 |
2
|
|
| |
3
|
|
| |
4
|
4. Stevens W. TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms. IETF RFC 2001; Jan. 1997.
|
| |
5
|
|
| |
6
|
|
| |
7
|
7. Braden B, Clark D, Crowcroft J, Davie B, Estrin D, Floyd S, Jacobson V, Minshall G, Partridge C, Peterson L, Ramakrishnan KK, Shenker S, Wroclawski J, Zhang L, Recommendation on queue management and congestion avoidance in the internet. IETF RFC 2309; April 1998.
|
 |
8
|
Larry Carter , Robert Floyd , John Gill , George Markowsky , Mark Wegman, Exact and approximate membership testers, Proceedings of the tenth annual ACM symposium on Theory of computing, p.59-65, May 01-03, 1978, San Diego, California, United States
[doi> 10.1145/800133.804332]
|
| |
9
|
9. McKenney PE. High-speed event counting and classification using a dictionary hash technique. International Conference on Parallel Processing; 1989, III-71-75.
|
| |
10
|
|
| |
11
|
11. Aweya J, Ouellette M, Montuno DY. An optimization-oriented view of random early detection. Computer Communications 2001; 24, Issue 12, July.
|
| |
12
|
|
| |
13
|
|
|