• DocumentCode
    2482025
  • Title

    An algorithm of enhancing RED fairness

  • Author

    Yang, Xiaoping ; Chen, Hong ; Xiao, Pingping

  • Author_Institution
    Coll. of Commun. Eng., Jilin Univ., Changchun
  • fYear
    2008
  • fDate
    25-27 June 2008
  • Firstpage
    2149
  • Lastpage
    2152
  • Abstract
    Random Early Detection (RED) can effectively avoid transmitting congestion at routers, but RED can not provide bandwidth fairness. Different packet sizes are one of the reasons that damage fairness. RED routers provide little protection from some bulky data flows that use considerably more bandwidth than other flows in time of congestion. Modifying the formulas of calculating final packet-discard probability and packet count for RED algorithm based on the sending rate formula of TCP flows, a new algorithm named enhanced-fairness RED (EF-RED) is proposed. Simulation results show that the EF-RED algorithm can efficiently avoid the effect of different packet sizes on TCP bandwidth allocation when congestion takes place, and achieve better bandwidth fairness.
  • Keywords
    bandwidth allocation; data communication; probability; queueing theory; telecommunication congestion control; telecommunication network management; telecommunication network routing; transport protocols; RED fairness; RED routers; TCP bandwidth allocation; TCP flows; bandwidth fairness; data flows; enhanced-fairness RED; final packet-discard probability; packet count; packet sizes; random early detection; router congestion; sending rate formula; Automation; Bandwidth; Channel allocation; Computer networks; Educational institutions; Filters; Intelligent control; Internet; Quality of service; Size control; Active queue management; Congestion control; Fairness; Random early detection (RED);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on
  • Conference_Location
    Chongqing
  • Print_ISBN
    978-1-4244-2113-8
  • Electronic_ISBN
    978-1-4244-2114-5
  • Type

    conf

  • DOI
    10.1109/WCICA.2008.4593256
  • Filename
    4593256