Short communication: Short-term fairness and long-term QoS in the Internet

  • Authors:
  • Bo (Rambo) Tan;Lei Ying;R. Srikant

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 1308 West Main Street, Urbana, IL 61801, USA;Department of Electrical and Computer Engineering, Iowa State University, 3219 Coover Hall, Ames, IA 50011, USA;Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 1308 West Main Street, Urbana, IL 61801, USA

  • Venue:
  • Performance Evaluation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider connection-level models of resource allocation in a simple symmetric three-link network, where files arrive into the network according to a Poisson process and the size of each file is exponentially distributed. For the simple network under consideration, we derive an optimal resource allocation policy which minimizes the steady-state expected number of files in the network. Using this result, we show that, in a heavy traffic regime, the mean file-transfer delay under the proportionally fair policy is at most 1.5 times the delay under the optimal policy. Simulation results indicate that the gap is even smaller.