Browse > Article

(A New Queue Management Algorithm Improving Fairness of the Internet Congestion Control)  

구자헌 (광운대학교 전자통신공학과)
최웅철 (광운대학교 컴퓨터공학부)
정광수 (광운대학교 전자공학부)
Publication Information
Journal of KIISE:Information Networking / v.30, no.3, 2003 , pp. 437-447 More about this Journal
Abstract
In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.
Keywords
congestion control; RED; active queue management; fairness;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., Peterson, L., Ramakrishman, K., Shenker, S., Wroclawski, J., Zhang, L., 'Recommendations on Queue Management and Congestion Avoidance in the Internet,' IETF RFC (Informational) 2309, April 1998
2 Jacobson, V., 'Congestion Avoidance and Control,' Proceeding of SIGCOMM 88, August 1988   DOI
3 Stevens, W., 'TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery,' IETF RFC 2001, January 1997
4 Floyd, S., and Fall, K., 'Router Mechanisms to Support End-to-Eng Congestion Control,' LBL Techinical report, Frbruary 1997
5 Stocia, I., Shemker, S., and Zhang, H., 'Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks,' Proceedings of ACM SIGCOMM 98, August 1998   DOI
6 Mckenny, P., 'Stochastic Faimess Queueing,' Proceedings of INFOCOM 90, pp733-740, June 1990
7 Legout, A. and Biersack, E. W., 'Revisiting the Fair Queueing Paradigm for End-to-End Congestion Control,' IEEE Network Magazine, 2002, September   DOI   ScienceOn
8 Floyd, S. and Jacobson, V., 'Random Early Detection Gateways for Congestion Avoidance,' IEEE/ACM Transaction on Networking, August 1993   DOI
9 Mahajan, R. and Floyd, S. 'Controlling High-Bandwidth Flows at the Congested Router,' ACIRI, Berkeley, California, November 2000
10 Lin, D. and Morris, R., 'Dynamics of random early detection,' ACM SIGCOMM 97, pp127-137, October 1997   DOI
11 Padhy, J., Firoiu, V., Towsley, D. and Kurose, J., 'A Stchastic Model of TCP Reno Congestion Avoidance and Control,' Technical Report CMPSCI TR 99-02, Univ. of Massachusetts, Amberst, 1999
12 UCB/LBNL/VINT, 'Network Simulator-ns (version2.1b9a),' http://www-mash.cs.berkeley.edu/ns/
13 Demers, A., Keshav, S., and Shenker, S., 'Analysis and Simulation of a Fair Queueing Algorithm,' Journal fo Internetworking Research and Experience, Also in Proceedings of ACM SIGCOMM 89   DOI
14 Pan, R., Prabhakar, B., and Psounis. K., 'CHOKe, A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation,' Proceedings of INFOCOM 2000, February 2000