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

Bo (Rambo) Tan, Lei Ying, R. Srikant

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)406-414
Number of pages9
JournalPerformance Evaluation
Volume67
Issue number5
DOIs
StatePublished - May 1 2010

Keywords

  • Delay optimality
  • Dynamic programming
  • Internet congestion control
  • Lyapunov functions
  • Proportional fairness

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Short-term fairness and long-term QoS in the Internet'. Together they form a unique fingerprint.

  • Cite this