Fair end-to-end window-based congestion control

Jeonghoon Mo, Jean Walrand

Research output: Contribution to journalArticlepeer-review

1527 Citations (Scopus)


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 languageEnglish
Pages (from-to)556-567
Number of pages12
JournalIEEE/ACM Transactions on Networking
Issue number5
Publication statusPublished - 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


Dive into the research topics of 'Fair end-to-end window-based congestion control'. Together they form a unique fingerprint.

Cite this