The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2011 vol.22)
pp: 571-579
Hyunsoo Yoon , Korea Advanced Institute of Science and Technology, Daejeon
Jong-hwan Kim , Korea Telecom Co., Daejeon
Two major goals of queue management are flow fairness and queue-length stability However, most prior works dealt with these goals independently. In this paper, we show that both goals can be effectively achieved at the same time. We propose a novel scheme that realizes flow fairness and queue-length stability. In the proposed scheme, high-bandwidth flows are identified via a multilevel caching technique. Then, we calculate the base drop probability for resolving congestion with a stable queue, and apply it to individual flows differently depending on their sending rates. Via extensive simulations, we show that the proposed scheme effectively realizes flow fairness between unresponsive and TCP flows, and among heterogeneous TCP flows, while maintaining a stable queue.
Active queue management, flow fairness, bandwidth sharing, queue-length stability.
Hyunsoo Yoon, Jong-hwan Kim, "Active Queue Management for Flow Fairness and Stable Queue Length", IEEE Transactions on Parallel & Distributed Systems, vol.22, no. 4, pp. 571-579, April 2011, doi:10.1109/TPDS.2010.104
[1] V. Jacobson and M. Karels, "Congestion Avoidance and Control," Proc. ACM SIGCOMM, pp. 314-329, Aug. 1988.
[2] B. Braden et al., "Recommendations on Queue Management and Congestion Avoidance in the Internet," RFC 2309, Apr. 1998.
[3] S. Floyd and V. Jacobson, "Random Early Detection Gateways for Congestion Avoidance," IEEE/ACM Trans. Networking, vol. 1, no. 4, pp. 397-413, Aug. 1993.
[4] W. Feng, "The BLUE Active Queue Management Algorithms," IEEE/ACM Trans. Networking, vol. 10, no. 4, pp. 513-528, Aug. 2002.
[5] S. Athuraliya, "REM: Active Queue Management," IEEE Network, vol. 15, no. 3, pp. 48-53, May/June 2001.
[6] C. Hollot, "On Designing Improved Controllers for AQM Routers Supporting TCP Flows," Proc. IEEE INFOCOM, pp. 1726-1734, Apr. 2001.
[7] S.S. Kunniyur and R. Srikant, "An Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Management," IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 286-299, Apr. 2004.
[8] L. Breslau et al., "Advances in Network Simulation," Computer, vol. 33, no. 5, pp. 59-67, May 2000.
[9] T.J. Ott, T.V. Lakshman, and L. Wong, "SRED: Stabilized RED," Proc. IEEE INFOCOM, pp. 1346-1355, Mar. 1999.
[10] J. Padhye et al., "Modeling TCP Throughput: A Simple Model and Its Empricial Validation," Proc. ACM SIGCOMM, Aug. 1998.
[11] J.-H. Kim and I. Yeom, "Reducing Queue Oscillation at a Congested Link," IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 3, pp. 394-407, Mar. 2008.
[12] R. Mahajan, S. Floyd, and D. Wetherall, "Controlling High-Bandwidth Flows at the Congested Router," Proc. Ninth Int'l Conf. Network Protocols (ICNP '01), p. 0192, Nov. 2001.
[13] R. Pan, B. Prabhakar, and K. Psounis, "CHOKe, A Statless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation," Proc. IEEE INFOCOM, pp. 942-951, Mar. 2000.
[14] W. Feng, D.D. Kandlur, D. Saha, and K.G. Shin, "Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness," Proc., IEEE INFOCOM '01, pp. 1520-1529, Apr. 2001.
[15] M. Shreedhar and G. Varghese, "Efficient Fair Queuing Using Deficit Roundrobin," IEEE/ACM Trans. Networking, vol. 4, no. 3, pp. 375-385, June 1996.
[16] A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queuing Algorithm," Proc. ACM SIGCOMM, 1989.
[17] P. McKenney, "Stochastic Fairness Queuing," Proc. IEEE INFOCOM, vol. 2, pp. 733-740, June 1990.
[18] A. Tang, J. Wang, and S.H. Low, "Understanding CHOKe," Proc. IEEE INFOCOM, Apr. 2003.
[19] C. Estan and G. Varghese, "New Directions in Traffic Measurement and Accounting," Proc. ACM SIGCOMM, 2002.
[20] M. Kodialam, T.V. Lakshman, and S. Mohanty, "Runs BAsed Traffic Estimator (RATE): A Simple, Memory Efficient Scheme for Per-Flow Rate Estimation," Proc. IEEE INFOCOM, 2004.
[21] F. Hao, M. Kodialam, and T.V. Lakshman, "ACCEL-RATE: A Faster Mechanism for Memory Efficient Per-Flow Traffic Estimation," Proc. ACM SIGMETRICS, 2004.
[22] F. Hao, M. Kodialam, T.V. Lakshman, and H. Zhang, "Fast, Memory-Efficient Traffic Estimation by Coincidence Counting," Proc. IEEE INFOCOM, 2005.
[23] R. Pan, L. Breslau, B. Prabhakar, and S. Shenker, "Approximate Fairness through Differential Dropping," ACM SIGCOMM Computer Comm. Rev., pp. 23-39, Apr. 2003,
[24] P. Barford and M. Crovella, "Generating Representative Web Workloads for Network and Server Performance Evaluation," Proc. ACM SIGMETRICS, June 1998.
[25] Y. Zhang, L. Breslau, V. Paxson, and S. Shenker, "On the Characteristics and Origins of Internet Flow Rates," Proc. ACM SIGCOMM, pp. 161-174, Aug. 2002.
[26] R. Jain et al, "Throughput Fairness Index: An Explanation," ATM Forum/99-0045, Feb. 1999.
51 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool