• DocumentCode
    2311540
  • Title

    Using MRUL to Improve Network Fairness

  • Author

    Wang, Hui ; Zhou, Kaiyu ; Lin, Xiao-Hui

  • Author_Institution
    Fac. of Inf. Eng., Shenzhen Univ.
  • fYear
    2006
  • fDate
    25-27 Oct. 2006
  • Firstpage
    1
  • Lastpage
    5
  • Abstract
    Internet routers generally see packets from a fast flow more often than a slow flow. This suggests that network fairness may be improved without per-flow information. In this paper, we propose a scheme using most recently used list (MRUL) - a list storing statistics of limited active flows that sorted in most recently seen first mode - to improve the fairness of RED. Based on the list, our proposed scheme jointly considers the identification and punish of the fast and unresponsive fast flows, and the protection of slow flows. Its performance improvements are demonstrated with extensive simulations. Different from the previous proposals, the complexity of our proposed scheme is proportional to the size of the MRUL list but not coupled with the queue buffer size or the number of active flows, so it is scalable and suitable for various routers.
  • Keywords
    Internet; computational complexity; queueing theory; telecommunication network routing; Internet routers; limited active flows; most recently used list; network fairness improvement; performance improvements; queue buffer size; Bandwidth; Data structures; IP networks; Internet; Proposals; Protection; Statistics; Streaming media; Telecommunications; Throughput; Fairness; Random Early Detection; TCP; Unresponsive flows;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Networking in China, 2006. ChinaCom '06. First International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    1-4244-0463-0
  • Electronic_ISBN
    1-4244-0463-0
  • Type

    conf

  • DOI
    10.1109/CHINACOM.2006.344701
  • Filename
    4149704