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


Vol. 34,  No. 11, pp. 1254-1260, Nov.  2009


PDF Full-Text
  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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Jun, "History-Aware RED for Relieving the Bandwidth Monopoly of a Station Employing Multiple Parallel TCP flows," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 11, pp. 1254-1260, 2009. DOI: .

[ACM Style]

Kyungkoo Jun. 2009. History-Aware RED for Relieving the Bandwidth Monopoly of a Station Employing Multiple Parallel TCP flows. The Journal of Korean Institute of Communications and Information Sciences, 34, 11, (2009), 1254-1260. DOI: .

[KICS Style]

Kyungkoo Jun, "History-Aware RED for Relieving the Bandwidth Monopoly of a Station Employing Multiple Parallel TCP flows," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 11, pp. 1254-1260, 11. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880