Jeonghoon Mo, Jean Walrand  Home/Search
Context Related
| berkeley.edu/Papers/spiepap.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/Pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
Pareto Set, Fairness, and Nash Equilibrium: A Case Study.. - Inoie, Kameda, Touati (Correct)
Randomized Algorithms for Stability and Robustness.. - Alpcan, Basar, Tempo (2005) (Correct)
A Utility-Based Congestion Control Scheme for Internet-Style.. - Alpcan, Basar (2003) (Correct)
Similar documents (at the sentence level):
34.6%: Fair End-to-End Window-based Congestion Control - Mo, Walrand (1998) (Correct)
Active bibliography (related documents): More All
0.5: On Rate Allocation Policies and Explicit.. - Hou, Tzeng, Panwar.. (Correct)
0.5: Fairness for ABR multipoint-to-point connections - Fahmy, Jain, Goyal, Vandalore (1998) (Correct)
0.2: Analysis and Comparison of TCP Reno and Vegas - Jeonghoon Mo Richard (1999) (Correct)
Similar documents based on text: More All
0.2: OSPF and BGP-4 - June Att Labs (Correct)
0.2: Game Theoretic Modeling of WiFi Pricing - Musacchio, Walrand (2003) (Correct)
0.1: A Theory Of Maxmin Bottleneck Ordering - Ros, Tsai (2000) (Correct)
Related documents from co-citation: More All
83: Rate control in communication networks: shadow prices - Kelly, Maulloo et al. - 1998
32: Charging and rate control for elastic traffic - Kelly - 1997
28: Random early detection gateways for congestion avoidance - Floyd, Jacobson - 1993
BibTeX entry: (Update)
J. Mo and J. Walrand, "Fair end-to-end window-based congestion control," available as http://walrandpc.eecs.berkeley.edu/Mo1.pub.ps. http://citeseer.ist.psu.edu/mo95fair.html More
@article{ mo00fair,
author = "Jeonghoon Mo and Jean Walrand",
title = "Fair end-to-end window-based congestion control",
journal = "IEEE\slash ACM Transactions on Networking",
volume = "8",
number = "5",
pages = "556--567",
year = "2000",
url = "citeseer.ist.psu.edu/mo95fair.html" }
Citations (may not include all citations):1159 Random Early Detection Gateways for Congestion Avoidance - Floyd, Jacobson - 1993
463 Rate control for communication networks: shadow price propor.. - Kelly, Maulloo et al. - 1998
263 Tcp vegas: end to end congestion avoidance on a global inter.. - Brakmo, Peterson - 1995
246 Analysis of the Increase and Decrease Algorithms for Congest.. (context) - Chiu, Jain - 1989
206 Connection with multiple Congested Gateways in packet-Switch.. - Floyd, Jacobson - 1991
101 Fair end to end window-based congestion control - Mo, Walrand - 1998
74 An algorithm for rate allocation in a packet-switching netwo.. - Charny - 1994
63 Round-robin scheduling for maxmin fairness in data network - Hahne - 1991
55 Computer Communication Review (context) - Jacobson, avoidance - 1988
50 Myths about Congestion Management in High Speed Networks - Jain - 1992
46 Improving Fairness of TCP Congestion Avoidance - Henderson, Sahouria et al. - 1998
45 Random Drop Congestion Control (context) - Mankin - 1990
32 Convergence of Synchronous and Asynchronous Greedy Algorithm.. (context) - Zhang, Douligeris - 1992
23 Asymptotically optimal design of congestion control for high.. (context) - Mitra - 1992
17 InternetworkingResearch and Experience (context) - Jacobson, Phase et al. - 1993
15 A Game Theoretic Perspective to Flow Control in Telecommunic.. (context) - Douligeris, Mazumdar - 1992
12 Approximating Max-Min Fair Rates via Distributed Local Sched.. - Mayer, Ofek et al. - 1996
10 Nonlinear Programming (context) - Avriel - 1976
8 An approach to high-performance (context) - Fendick, Mitra et al. - 1991
7 Issues in TCP Vegas - La, Walrand et al. - 1998
5 Charging and rate control for elastic tra#c (context) - Kelly - 1997
2 IEEE Transaction on Communications COM (context) - Ja, Bottleneck et al. - 1981
2 Congestion Control and Tra#c ManagementinATM Networks: Recen.. (context) - Jain - 1996
1 Englwood Cli#s (context) - Bertsekas, Gallager et al. - 1992
1 A theoretical analysis of feedback#ow control (context) - Shenker - 1990
1 Flow Control Power is Nondecentralizable (context) - Ja - 1981
1 ow control for high speed data networks with small bu#ers (context) - Mitra, Mitrani et al. - 1994
1 Fairnes network optimal #ow controloptimality product form (context) - Mason, in et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://walrandpc.eecs.berkeley.edu/Pubs.html): More
WebTP: A Receiver-Driven Web Transport Protocol - Gupta, Chen, McCanne, Walrand (1998) (Correct)
Effective Bandwidths for Multiclass Markov Fluids and.. - Kesidis, Walrand, Chang (1993) (Correct)
Relative Entropy Between Markov Transition Rate Matrices - Kesidis, Walrand (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC