Published December 2005
| public
Journal Article
Equilibrium and Fairness of Networks Shared by TCP Reno and Vegas/FAST
- Creators
-
Tang, Ao
- Wang, Jiantao
- Hegde, Sanjay
-
Low, Steven H.
Abstract
It has been proved theoretically that a network with heterogeneous congestion control algorithms that react to different congestion signals can have multiple equilibrium points. In this paper, we demonstrate this experimentally using TCP Reno and Vegas/FAST. We also show that any desired inter-protocol fairness is in principle achievable by an appropriate choice of Vegas/FAST parameter, and that intra-protocol fairness among flows within each protocol is unaffected by the presence of the other protocol except for a reduction in effective link capacities. Dummynet experiments and ns-2 simulations are presented to verify these results.
Additional Information
© 2005 Springer Science + Business Media, Inc. We thank Cheng Jin for useful discussions, and Raj Jayaraman and George Lee for help on network setup. This is part of the Caltech FAST Project supported by NSF, Lee Center for Advanced Networking, ARO, AFOSR, Cisco, and a SISL Fellowship.Additional details
- Eprint ID
- 99194
- Resolver ID
- CaltechAUTHORS:20191009-132246224
- NSF
- Caltech Lee Center for Advanced Networking
- Army Research Office (ARO)
- Air Force Office of Scientific Research (AFOSR)
- Cisco
- Caltech Social and Information Sciences Laboratory
- Created
-
2019-10-09Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field