• DocumentCode
    3145043
  • Title

    Max-min Utility Fairness in Link Aggregated Systems

  • Author

    Mohanty, Satya R. ; Liu, Changbin ; Liu, Bin ; Bhuyan, Laxmi N.

  • Author_Institution
    Univ. of California at Riverside, Riverside
  • fYear
    2007
  • fDate
    May 30 2007-June 1 2007
  • Firstpage
    1
  • Lastpage
    7
  • Abstract
    We consider utility max-min fairness of application traffic of a next generation Internet (NGI) service model contending for network bandwidth. The physical infrastructure that offers the bandwidth is a link-aggregated system where the links can be homogeneous or heterogeneous. Traffic can broadly be categorized into a few distinct classes and the containing flows in each class utilize the available bandwidth in the same way. The basis of this categorization is the realization that different applications derive different utility even when alloted the same bandwidth. The goal is to allocate bandwidth so as to equalize the utilities to each class is in a maximal and fair way. Once the required rates are computed these are utilized by the scheduler for scheduling packets over the links.
  • Keywords
    Internet; bandwidth allocation; optimisation; scheduling; telecommunication links; telecommunication traffic; application traffic; link aggregated system; max-min utility fairness; network bandwidth; next generation Internet service model; packet scheduling; Application software; Bandwidth; Computer science; DSL; Internet telephony; Jitter; Processor scheduling; Telecommunication traffic; Traffic control; Web and internet services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High Performance Switching and Routing, 2007. HPSR '07. Workshop on
  • Conference_Location
    Brooklyn, NY
  • Print_ISBN
    1-4244-1206-4
  • Electronic_ISBN
    1-4244-1206-4
  • Type

    conf

  • DOI
    10.1109/HPSR.2007.4281267
  • Filename
    4281267