Efficient resource allocation in bandwidth-sharing networks

  • Authors:
  • Maaike Verloop;Rudesindo Núñez-Queija

  • Affiliations:
  • CWI, The Netherlands;CWI, The Netherlands and TNO Information and Communication Technology, The Netherlands

  • Venue:
  • ACM SIGMETRICS Performance Evaluation Review
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Document transfer in the Internet is regulated by distributed packet-based congestion control mechanisms, usually relying on TCP. By dividing a document into packets, parts of one file reside at different nodes along the transmission path. The "instantaneous transfer rate" of the entire document can be thought of as being equal to the minimum transfer rate along the entire path. Bandwidth-sharing networks as considered by Massoulié & Roberts [2] provide a natural modeling framework for the dynamic flow-level interaction among document transfers. The class α-fair policies for such networks, as introduced by Mo & Walrand [3], captures a wide range of distributed allocation mechanisms such as TCP, the proportional fair allocation and the max-min fair allocation.