Abstract
TCP Vegas is a famous delay-based congestion control mechanism. Researches have indicated that TCP Vegas outperforms the loss-based TCP Reno in many aspects. However, Reno is still the most widely deployed TCP version in the current Internet. This predicament is primarily due to the incompatibility of Vegas with Reno. The performance of Vegas is generally mediocre in environments where Reno coexists. Hence, there exists no incentive for operating systems to adopt Vegas as default transport layer protocol. In this paper, we propose a new variant of Vegas called COmpetitive DElay-based TCP (CODE TCP) which could be compatible and get the fair share of network resources with Reno. CODE is a sender-sided modification and hence can be implemented solely at the end host. Our simulations confirm that CODE has better fairness characteristic in network environments where Reno coexist without discarding the good features of Vegas.
| Original language | English |
|---|---|
| Title of host publication | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies |
| Pages | 134-140 |
| Number of pages | 7 |
| DOIs | |
| Publication status | Published - 2008 Sep 23 |
| Event | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies - Ho Chi Minh City, Viet Nam Duration: 2008 Jul 13 → 2008 Jul 17 |
Other
| Other | RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies |
|---|---|
| Country | Viet Nam |
| City | Ho Chi Minh City |
| Period | 08-07-13 → 08-07-17 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Artificial Intelligence
- Computer Networks and Communications
- Computer Vision and Pattern Recognition
Cite this
}
A competitive delay-based TCP. / Chan, Yi-Cheng; Lin, Chia Liang; Liu, Fang Chun.
RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies. 2008. p. 134-140 4586345.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - A competitive delay-based TCP
AU - Chan, Yi-Cheng
AU - Lin, Chia Liang
AU - Liu, Fang Chun
PY - 2008/9/23
Y1 - 2008/9/23
N2 - TCP Vegas is a famous delay-based congestion control mechanism. Researches have indicated that TCP Vegas outperforms the loss-based TCP Reno in many aspects. However, Reno is still the most widely deployed TCP version in the current Internet. This predicament is primarily due to the incompatibility of Vegas with Reno. The performance of Vegas is generally mediocre in environments where Reno coexists. Hence, there exists no incentive for operating systems to adopt Vegas as default transport layer protocol. In this paper, we propose a new variant of Vegas called COmpetitive DElay-based TCP (CODE TCP) which could be compatible and get the fair share of network resources with Reno. CODE is a sender-sided modification and hence can be implemented solely at the end host. Our simulations confirm that CODE has better fairness characteristic in network environments where Reno coexist without discarding the good features of Vegas.
AB - TCP Vegas is a famous delay-based congestion control mechanism. Researches have indicated that TCP Vegas outperforms the loss-based TCP Reno in many aspects. However, Reno is still the most widely deployed TCP version in the current Internet. This predicament is primarily due to the incompatibility of Vegas with Reno. The performance of Vegas is generally mediocre in environments where Reno coexists. Hence, there exists no incentive for operating systems to adopt Vegas as default transport layer protocol. In this paper, we propose a new variant of Vegas called COmpetitive DElay-based TCP (CODE TCP) which could be compatible and get the fair share of network resources with Reno. CODE is a sender-sided modification and hence can be implemented solely at the end host. Our simulations confirm that CODE has better fairness characteristic in network environments where Reno coexist without discarding the good features of Vegas.
UR - http://www.scopus.com/inward/record.url?scp=51949096679&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51949096679&partnerID=8YFLogxK
U2 - 10.1109/RIVF.2008.4586345
DO - 10.1109/RIVF.2008.4586345
M3 - Conference contribution
AN - SCOPUS:51949096679
SN - 9781424423798
SP - 134
EP - 140
BT - RIVF 2008 - 2008 IEEE International Conference on Research, Innovation and Vision for the Future in Computing and Communication Technologies
ER -