Fair end-to-end window-based congestion control

Jeonghoon Mo; Jean Walrand

doi:10.1109/90.879343

Fair end-to-end window-based congestion control

Jeonghoon Mo, Jean Walrand

Department of Industrial Engineering

Research output: Contribution to journal › Article › peer-review

1527 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 first come-first served 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 practical implementation of the protocols.

Original language	English
Pages (from-to)	556-567
Number of pages	12
Journal	IEEE/ACM Transactions on Networking
Volume	8
Issue number	5
DOIs	https://doi.org/10.1109/90.879343
Publication status	Published - 2000 Oct

Bibliographical note

Funding Information:
Manuscript received November 10, 1998; revised January 19, 1999 and October 4, 1999; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Floyd. This work was supported in part by a grant from the National Science Foundation. J. Mo is with AT&T Labs, Middletown, NJ 07748 USA (e-mail: jhmo@ att.com). J. Walrand is with the University of California, Berkeley, CA 94704 USA. Publisher Item Identifier S 1063-6692(00)09125-1.

All Science Journal Classification (ASJC) codes

Software
Computer Science Applications
Computer Networks and Communications
Electrical and Electronic Engineering

Access to Document

10.1109/90.879343

Cite this

@article{06a1084c855f4013ae762acf29fce156,

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 first come-first served 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 practical implementation of the protocols.",

author = "Jeonghoon Mo and Jean Walrand",

note = "Funding Information: Manuscript received November 10, 1998; revised January 19, 1999 and October 4, 1999; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Floyd. This work was supported in part by a grant from the National Science Foundation. J. Mo is with AT&T Labs, Middletown, NJ 07748 USA (e-mail: jhmo@ att.com). J. Walrand is with the University of California, Berkeley, CA 94704 USA. Publisher Item Identifier S 1063-6692(00)09125-1.",

year = "2000",

month = oct,

doi = "10.1109/90.879343",

language = "English",

volume = "8",

pages = "556--567",

journal = "IEEE/ACM Transactions on Networking",

issn = "1063-6692",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

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

AU - Mo, Jeonghoon

AU - Walrand, Jean

N1 - Funding Information: Manuscript received November 10, 1998; revised January 19, 1999 and October 4, 1999; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor S. Floyd. This work was supported in part by a grant from the National Science Foundation. J. Mo is with AT&T Labs, Middletown, NJ 07748 USA (e-mail: jhmo@ att.com). J. Walrand is with the University of California, Berkeley, CA 94704 USA. Publisher Item Identifier S 1063-6692(00)09125-1.

PY - 2000/10

Y1 - 2000/10

N2 - In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served 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 practical implementation 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 first come-first served 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 practical implementation of the protocols.

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

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

U2 - 10.1109/90.879343

DO - 10.1109/90.879343

M3 - Article

AN - SCOPUS:0034297878

SN - 1063-6692

VL - 8

SP - 556

EP - 567

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

IS - 5

ER -

Fair end-to-end window-based congestion control

Abstract

Bibliographical note

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this