Fair end-to-end window-based congestion control

被引：4

作者：

Mo, J ^{[1
]}

Walrand, J ^{[1
]}

机构：

[1] Univ Calif Berkeley, Dept Ind Engn & Operat Res, Berkeley, CA 94720 USA

来源：

PERFORMANCE AND CONTROL OF NETWORK SYSTEMS II | 1998年 / 3530卷

关键词：

congestion control; end to end; fairness; window; max-min fair; proportionally fair;

D O I：

10.1117/12.325891

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

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.

引用

页码：55 / 63

页数：9