• DocumentCode
    3086777
  • Title

    Charge Allocation Concept for Fairer Resource Sharing in Best-Effort Network

  • Author

    Miaji, Yaser ; Hassan, Suhaidi

  • Author_Institution
    Internetworks Res. Group, Univ. Utara Malaysia, Sintok, Malaysia
  • fYear
    2010
  • fDate
    22-23 Sept. 2010
  • Firstpage
    135
  • Lastpage
    140
  • Abstract
    The potential increase in the popularity of greedy software such as download accelerator software and greedy application such as P2P leads to a significant demands for reconstruction of the old fashion max-min fairness definition. Furthermore, these applications and software monopolize network bandwidth and hence result in magnificent degradation in the performance of real-time application such as VOIP, video conferencing and IPTV. This paper intends to introduce new fairness concept based on charge allocation in oppose of bandwidth allocation. This idea is discussed and analyzed conceptually and analytically with comparison to the famous Weighted Fair Queueing. The result shows impressive increases in fairness and protection of resource sharing. This research stimulates and redirects researcher attention to another dimension.
  • Keywords
    bandwidth allocation; greedy algorithms; minimax techniques; peer-to-peer computing; queueing theory; P2P computing; bandwidth allocation; best-effort network; charge allocation; fairer resource sharing; greedy software; maxmin fairness principle; network bandwidth; weighted fair queueing; Bandwidth; IP networks; Internet telephony; Quality of service; Real time systems; Resource management; Software; QoS; max-min fairness; scheduling mechanism;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Applications Protocols and Services (NETAPPS), 2010 Second International Conference on
  • Conference_Location
    Kedah
  • Print_ISBN
    978-1-4244-8048-7
  • Electronic_ISBN
    978-0-7695-4177-8
  • Type

    conf

  • DOI
    10.1109/NETAPPS.2010.32
  • Filename
    5635818