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

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

Research output: Contribution to journalArticle

2 Citations (Scopus)

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 2010
Externally publishedYes

Fingerprint

Fairness
Resource allocation
Quality of service
Internet
Resource Allocation
Heavy Traffic
Optimal Allocation
Optimal Policy
Poisson process
Minimise
Simulation
Policy
Model

Keywords

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

ASJC Scopus subject areas

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

Cite this

Short-term fairness and long-term QoS in the Internet. / Tan, Bo (Rambo); Ying, Lei; Srikant, R.

In: Performance Evaluation, Vol. 67, No. 5, 05.2010, p. 406-414.

Research output: Contribution to journalArticle

Tan, Bo (Rambo) ; Ying, Lei ; Srikant, R. / Short-term fairness and long-term QoS in the Internet. In: Performance Evaluation. 2010 ; Vol. 67, No. 5. pp. 406-414.
@article{27ae1d0dd1a84cc3a43fd9ddd31706c5,
title = "Short-term fairness and long-term QoS in the Internet",
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.",
keywords = "Delay optimality, Dynamic programming, Internet congestion control, Lyapunov functions, Proportional fairness",
author = "Tan, {Bo (Rambo)} and Lei Ying and R. Srikant",
year = "2010",
month = "5",
doi = "10.1016/j.peva.2009.12.002",
language = "English (US)",
volume = "67",
pages = "406--414",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

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

AU - Tan, Bo (Rambo)

AU - Ying, Lei

AU - Srikant, R.

PY - 2010/5

Y1 - 2010/5

N2 - 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.

AB - 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.

KW - Delay optimality

KW - Dynamic programming

KW - Internet congestion control

KW - Lyapunov functions

KW - Proportional fairness

UR - http://www.scopus.com/inward/record.url?scp=77949566890&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77949566890&partnerID=8YFLogxK

U2 - 10.1016/j.peva.2009.12.002

DO - 10.1016/j.peva.2009.12.002

M3 - Article

AN - SCOPUS:77949566890

VL - 67

SP - 406

EP - 414

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 5

ER -