Browse > Article

History-Aware RED for Relieving the Bandwidth Monopoly of a Station Employing Multiple Parallel TCP flows  

Jun, Kyung-Koo (인천대학교 멀티미디어시스템공학과)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.34, no.11B, 2009 , pp. 1254-1260 More about this Journal
Abstract
This paper proposes history-aware random early detection (HRED), a modified version of RED, to lessen bandwidth monopoly by a few of stations employing multiple parallel TCP flows. Stations running peer-to-peer file sharing applications such as BitTorrent use multiple TCP flows. If those stations share a link with other stations with only a small number of TCP flows, the stations occupy most of link bandwidth leading to undesirable bandwidth monopoly. HRED like RED determines whether to drop incoming packets according to probability which changes based on queue length. However it adjusts the drop probability based on bandwidth occupying ratio of stations, thus able to impose harder drop penalty on monopoly stations. The results of simulations assuming various scenarios show that HRED is at least 60% more effective than RED in supporting the bandwidth fairness among stations and at least 4% in utilization.
Keywords
TCP fairness; Random Early Detection; History-Aware; Drop Probability;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Leith, P. Clifford, D. Malone, A. Ng, 'TCP Fairness in 802.11e WLANs,' IEEE Communications Letters, Vol. 9, No. 12, December 2005   DOI   ScienceOn
2 J. Ha, C. Choi, 'TCP Fairness for Uplink and Downlink Flows in WLANs,' in Proc. IEEE Globecom 2006   DOI
3 Qualnet. Network simulator. Available at http://www. scalable-networks.com
4 M. Shin, S. Chong, and I. Rhee, 'Dual-Resource TCP/AQM for Processing-Constrained Networks,' IEEE/ ACM Transactions on Networking. April 2008   DOI   ScienceOn
5 Van Jacobson, 'Congestion Avoidance and Control,' In Proc. of ACM SIGCOMM '88, Aug. 1988   DOI
6 S. Pilosof, R. Ramjee, Y. Shavitt, P.Sinha, 'Understanding TCP fairness over wireless LAN,' in Proc. IEEE INFOCOM 2003   DOI
7 Cisco Systems Document, 'Class-based Weighted Fair Queueing'
8 S. Floyd and V. Jacobson, 'Random early detection gateways for contestion avoidance,' IEEE/ACM Transactions on Networking. 1(40, Aug. 1993   DOI   ScienceOn
9 A. Demers, S. Keshav, and S. Shenker, 'Analysis and simulation of a fair queueing algorithm,' ACM SIGCOMM Computer Communications Review, vol. 19, no. 4, pp. 1-12, 1989   DOI
10 N. Blefar-Melazzi, A. Detti, I. Habib, A. Ordine, S. Salsano, 'TCP Fairness Issues in IEEE 802.11 Networks: Problem Analysis and Solutions Based on Rate Control,' IEEE Transactions on Wireless Communications, Vol. 6, No. 4, April 2007   DOI   ScienceOn
11 B. Briscoe, 'A Fairer, Faster Internet,' IEEE Spectrum, Dec. 2008   DOI   ScienceOn
12 S. Athuraliya, S. Low, V. Li and Q. Yin, 'REM: Active queue management,' IEEE Network, vol. 15, 2001   DOI   ScienceOn
13 X. Lin, K. Zhou, H. Wang, and G. Su, 'Scalable Fair Random Early Detection,' in Proc. of WiCOM 2006   DOI
14 M Shreedhar and G. Varghese,'Efficient fair queueing using deficit round robin,' in Proc. of ACM SIGCOMM, 1995   DOI   ScienceOn
15 T. Henderson, E. Sahouria, S. McCanne, and R. Katz, 'On Improving the Fairness of TCP Congestion Avoidance,' In Proc. of Globecom 1998   DOI
16 B. Cohen, 'BitTorrent - a new P2P app'. Yahoo eGroups
17 C. Hollot, V. Misra, D. Towsley, and W. Gong, 'On designing improved controllers for AQM routers supporting TCP flows,' in Proc. of IEEE INFOCOM, 2001   DOI