MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Fair End-to-End Window-based Congestion Control (1995) [251 citations — 0 self]

Abstract:

In this paper, we demonstrate the existence of fair end-to-end window-based congestion control protocols for packetswitched 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 aLyapunov function. The technical challenge is in the construction of the protocols.

Citations

1825 Congestion avoidance and control – Jacobson - 1988
1738 Random Early Detections Gateways for Congestion Avoidance – Floyd, Jacobson - 1993
1325 Data Networks – Bertsekas, Gallagher - 1991
877 Rate control in communication networks: shadow prices, proportional fairness and stability – Kelly, Maulloo, et al. - 1995
402 Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks – Chiu, Jain - 1989
319 TCP Vegas: End to end congestion avoidance on a global internet – BRAKMO, PETERSON
232 Connections with multiple congested gateways in packet-switched networks, Part 1: One-way traffic – Floyd - 1991
181 Bandwidth sharing: Objectives and algorithms – Massoulie, Roberts - 1999
152 Bottleneck flow control – Jaffe - 1981
96 Existence and uniqueness of equilibrium points for concave N-person games – Rosen - 1965
85 Round-Robin Scheduling for Max-Min Fairness in Data Networks – Hahne - 1991
73 An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback – Charny - 1994
56 The LBNL network simulator – McCanne, Floyd - 1997
51 A theoretical analysis of feedback flow control – Shenker
45 Introduction to Dynamic System – Luenberger - 1979
43 Random Drop Congestion Control – Mankin - 1990
42 Improving Fairness of TCP Congestion Avoidance – Henderson, Sahouria, et al. - 1998
34 Myths about congestion management in high-speed networks – Jain - 1992
26 Convergence of Synchronous and Asynchronous Greedy Algorithms in a Multiclass Telecommunications Environment – Zhang, Douligeris - 1992
23 A note on the fairness of additive increase and multiplicative decrease – Hurley, Leboudec, et al. - 1999
23 Asymptotically optimal design of congestion control for high speed data network – Mitra - 1992
17 A Game Theoretic Perspective to Flow Control in Telecommunication Netowk – Douligeris, Mazumdar - 1992
14 Fixed Point Theory – Istratescu - 1981
14 A Weiss. An approach to highperformance, high-speed data networks – Fendick, Mitra, et al. - 1991
14 Congestion Control and Tra c Management inATM Networks: Recent Advances and A Survey – Jain - 1996
13 Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information – Mayer, Ofek, et al. - 1996
9 Nonlinear Programming – Avriel - 1976
8 On tra c phase e ects in packet-switched gateways – Floyd, Jacobson - 1992
5 A theoretical analysis of feedback ow control – Shenker - 1990
4 Venkat Anantharam. Issues in TCP Vegas . available at http://www.path.berkeley.edu/~ hyongla – La, Walrand - 1998
3 traffic phase effects in packet switched gateways,” Internetworking: Res – “On - 1993
3 Le Boudec, “Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times – Vojnovic, Y - 2000
3 Charging and rate control for elastic tra c – Kelly - 1997
3 Fairness in network optimal ow control:optimality of product forms – Mazumdar, Mason, et al. - 1991
2 control power is nondecentralizable – “Flow - 1981
2 Analysis and comparison of Reno and Vegas – Mo, La, et al. - 1999
2 Improving Fairness of TCP Congestion Avoidance . Available at http://www.cs.berkeley.edu/~ tomh/papers/cs268.ps – Henderson, Sahouria, et al. - 1997
1 Data Networks. Prentice-Hall, Englwood Cli s,N.J – Bertsekas, Gallager - 1992
1 cient window ow control for high speed data networks with small bu ers – unknown authors - 1994
1 Round-robin scheduling for maxmin fairness in data network – E, Gallager - 1991
1 Bottleneck ow control – e - 1981
1 Flow Control Power is Nondecentralizable – e - 1981
1 Nonlinear Programming. Prentice-Hall, Englwood Cli s,N.J – Avriel - 1976
1 about Congestion Management in High Speed Networks – Myths - 1992
View or Download | Add to My Collection | Correct Errors