Browse > Article

Double Queue CBOKe Mechanism for Congestion Control  

최기현 (성균관대학교 네트워크 연구실)
신호진 (성균관대학교 네트워크 연구실)
신동렬 (성균관대학교 네트워크 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.28, no.11A, 2003 , pp. 867-875 More about this Journal
Abstract
Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization in which TCP congestion window size is fluctuated during congestion period. Furthermore, if RTT(Round Trip Time) is increased, three duplicate ACK packets are not correct congestion signals because congestion might already disappear and the host may send more packets until it receives three duplicate ACK packets. Recently there are increasing interests in solving end-to-end congestion control using AQM(Active Queue Management) to improve the performance of TCP protocols. AQM is a variation of RED-based congestion control. In this paper, we first evaluate the effectiveness of the current AQM schemes such as RED, CHOKe, ARED, FRED and SRED, over traffic with different rates and over traffic with mixed responsive and non-responsive flows, respectively. In particular, CHOKe mechanism shows greater unfairness, especially when more unresponsive flows exist in a shared link. We then propose a new AQM scheme using CHOKe mechanism, called DQC(Double Queue CHOKe), which uses two FIFO queues before applying CHOKe mechanism to adaptive congestion control. Simulation shows that it works well in protecting congestion-sensitive flows from congestion-causing flows and exhibits better performances than other AQM schemes. Also we use partial state information, proposed in LRURED, to improve our mechanism.
Keywords
RED; Congestion Control; AQM; CHOKe; LRURED;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. McCanne, S. Floyd, K. Fall, UCB/LBL Network Simulator NS, 1996
2 M. Parris, K. Jeffay, ED. Smith, 'Responsive vs. Unresponsive Traffic:Active Queue Management for a Better-Than-Best-Effort Service', Technical Report, September 2000. http://www. cs.unc.edu/~jeffay/papers/IEEENetworks-Ol.pdf
3 TJ Ott, TV Lakshman, and LH Wong, 'SRED: stabilized RED', Proc. IEEE INFOCOM Conf, pp. 1346-1355, Mar. 1999
4 R. Pan, B. Prabhakar, and K. Psounis, 'CHOKe- A stateless active queue management scheme for approximation fair bandwidth allocation', IEEE Infocom '2000, March 2000
5 S. Floyd and V. Jacobson, 'Random Early Detection gateways for Congestion Avoidance', IEEE/ACM Trans. and Networking, vol.1, no. 4, Aug. 1993
6 Stevens, W., 'TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms', RFC 2001, January 1997
7 Lin, D. and Morris, R, 'Dynamics of Random early Detection' Proceedings of SIGCOMM'97
8 W. Feng, D. Kandlur, D. Saha, K. Shin, 'Blue: A New Class of Active Queue Management Algorithms', U Michigan CSE-TR-387-99, April 1999
9 W. C. Feng, D. Kandlur, D. Saha, and K. Shin., 'A Self-configuring RED Gateway', Infocom '99, 1999
10 Smitha, A. L. Narasimha Reddy, 'LRU-RED: An active queue management scheme to contain high bandwidth flows at congested routers', in Proc. ofGlobecornrn, Nov. 2001
11 Stoica, I., Shenker, S. and Zhang, H., 'Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High speed Networks', Proceedings of ACMSIGCOMM '98