Fair end-to-end window-based congestion control

Jeonghoon Mo, Jean Walrand

Research output: Contribution to journalConference article

29 Citations (Scopus)

Abstract

In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the construction of the protocols.

Original languageEnglish
Pages (from-to)55-63
Number of pages9
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume3530
DOIs
Publication statusPublished - 1998 Dec 1
EventPerformance and Control of Network Systems II - Boston, MA, United States
Duration: 1998 Nov 21998 Nov 4

Fingerprint

Congestion control (communication)
congestion
Packet networks
Congestion Control
Lyapunov functions
Routers
Fluids
Max-min Fairness
Proportional Fairness
Liapunov functions
Fluid Model
Multi-class
Router
Fairness
Lyapunov Function
Converge
Generalise
fluids
Approximation
approximation

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{bfc7c74865fd4449969eadae8b6ce58d,
title = "Fair end-to-end window-based congestion control",
abstract = "In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the construction of the protocols.",
author = "Jeonghoon Mo and Jean Walrand",
year = "1998",
month = "12",
day = "1",
doi = "10.1117/12.325891",
language = "English",
volume = "3530",
pages = "55--63",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

Fair end-to-end window-based congestion control. / Mo, Jeonghoon; Walrand, Jean.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 3530, 01.12.1998, p. 55-63.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Fair end-to-end window-based congestion control

AU - Mo, Jeonghoon

AU - Walrand, Jean

PY - 1998/12/1

Y1 - 1998/12/1

N2 - In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the construction of the protocols.

AB - In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with FCFS routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of max-min fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the construction of the protocols.

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

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

U2 - 10.1117/12.325891

DO - 10.1117/12.325891

M3 - Conference article

VL - 3530

SP - 55

EP - 63

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -