Download:
|
by Jeonghoon Mo, Jean Walr
http://www.path.berkeley.edu/~jhmo/confpap.ps
Add To MetaCart
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. 1
Citations
|
1790
|
Congestion avoidance and control
– Jacobson
- 1988
|
|
1681
|
Random Early Detection Gateways for Congestion Avoidance
– Floyd, Jacobson
- 1993
|
|
788
|
Rate control in communication networks: shadow prices, proportional fairness and stability
– Kelly, Maulloo, et al.
- 1998
|
|
390
|
Charging and rate control for elastic traffic
– Kelly
- 1997
|
|
384
|
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
– CHIU, JAIN
- 1989
|
|
318
|
TCP Vegas: end to end congestion avoidance on a global internet
– Brakmo, Peterson
- 1995
|
|
241
|
Connections with multiple congested gateways in packetswitched networks part 1: one-way traffic
– Floyd
- 1991
|
|
211
|
On Traffic Phase Effects in Packet-Switched Gateways
– Floyd, Jacobson
- 1992
|
|
159
|
Bottleneck flow control
– Jaffe
- 1981
|
|
151
|
Congestion Control and Traffic Management in ATM Networks: Recent Advances and A Survey
– Jain
|
|
84
|
An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback
– Charny
|
|
53
|
Random drop congestion control
– Mankin
- 1990
|
|
53
|
A theoretical analysis of feedback flow control
– Shenker
- 1990
|
|
40
|
On improving fairness of TCP congestion avoidance
– Henderson, Sahouria, et al.
|
|
33
|
Fairness in network optimal flow control: Optimality of product forms
– Mazumdar, Mason, et al.
- 1991
|
|
33
|
Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment
– Zhang, Douligeris
- 1992
|
|
28
|
Asymptotically optimal design of congestion control for high speed data networks
– Mitra
- 1992
|
|
19
|
A game theoretic perspective to flow control in telecommunication networks
– Douligeris, Mazumdar
- 1992
|
|
16
|
An Approach to High-Performance, High-Speed Data Networks
– FENDICK, MITRA, et al.
- 1991
|
|
15
|
Flow Control Power is Nondecentralizable
– Jaffe
- 1981
|
|
15
|
Approximating Max-Min Fair Rates via Distributed Local Scheduling with Partial Information
– Mayer, Ofek, et al.
- 1996
|
|
5
|
Fair end to end window-based congestion control
– Mo, Walrand
- 1998
|
|
2
|
Round-robin scheduling for maxmin fairness in data network
– E, Gallager
- 1991
|
|
1
|
Efficient window flow control for high speed data networks with small buffers
– Mitra, Mitrani
- 1994
|
