Understanding CHOKe

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2003, Pages 114-124

  Tang, Ao ^a   Wang, Jiantao ^a   Low, Steven H ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER SIMULATION; FEEDBACK; MATHEMATICAL MODELS; PACKET NETWORKS; QUEUEING NETWORKS; DROPS;

ACTIVE QUEUE MANAGEMENT (AQM);

NETWORK PROTOCOLS; QUEUEING THEORY;

ACTIVE QUEUE MANAGEMENT; BANDWIDTH SHARE; DETAILED MODELS; DROPPING PROBABILITY; FIFO BUFFER; KEY FEATURE; NON-UNIFORM DISTRIBUTION; QUEUEING PROCESS; RATE INCREASE; SPATIAL CHARACTERISTICS; UDP FLOWS;

EID: 0042976122     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Patrick Billingsley. Probability and Measure. John Wiley & Sons, 2 edition, 1986.
2. W. Feng, K G. Shin, D. Kandlur, and D. Saha. Stochastic Fair Blue: A queue management algorithm for enforcing fairness. In Proceedings of INFOCOM, April 2001.
3. S. Floyd and V. Jacobson. Random early detection gateways for congestion avoidance. IEEE/ACM Trans. on Networking, 1(4):397-413, August 1993. ftp://ftp.ee.lbl.gov/papers/early.ps.gz.
4. Dong Lin and Robert Morris. Dynamics of random early detection. In Proceedings of SIGCOMM'97, pages 127-137, September 1997. http://www.acm.org/sigcomm/sigcomm97/papers/p078.ps.
5. Steven H. Low. A duality model of TCP and queue management algorithms. IEEE/ACM Trans. on Networking, to appear, October 2003. http://netlab.caltech.edu.
6. P. McKenny. Stochastic fairness queueing. In Proceedings of Infocom, pages 733-740, 1990.
7. J. A. Nelder and R. Mead. A simplex method for function minimization. Comput. J., pages 308-313, 1965.
8. T. J. Ott, T. V. Lakshman, and L. Wong. SRED: Stabilized RED. In Proceedings of IEEE Infocom'99, March 1999. ftp://ftp.bellcore.com/pub/tjo/SRED.ps.
9. Rong Pan, Chandra Nair, Brian Yang, and Balaji Prabhakar. Packet dropping mechanisms: some examples and analysis. In Proc. of 38th Annual Allerton Conference on Communication, Control, and Computing, October 2001.
10. Rong Pan, Balaji Prabhakar, and Konstantinos Psounis. CHOKe: a stateless AQM scheme for approximating fair bandwidth allocation. In Proceedings of IEEE Infocom, March 2000.
11. Lawrence Perko. Differential equations and dynamical systems. Springer. 3 edition, 2001.
12. H. L. Royden. Real analysis. MacMillan, 1968.
13. I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks. In Proceedings of ACM Sigcomm, 1998.
14. Jiantao Wang, Ao Tang, and Steven H. Low. Maximum and asymptotic UDP throughput under CHOKe. Submitted to ACM Sigmetrics, http://netlab.caltech.edu, November 2002.