Abstract
Purchase PDF (3201 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (270 K)
doi:10.1016/j.peva.2007.12.007 
Copyright © 2008 Published by Elsevier B.V.
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Received 31 October 2007;
Abstract
We introduce a new congestion control algorithm for high-speed networks, called TCP-Illinois. TCP-Illinois uses packet loss information to determine whether the window size should be increased or decreased, and uses queueing delay information to determine the amount of increment or decrement. TCP-Illinois achieves high throughput, allocates the network resource fairly, and is incentive compatible with standard TCP. We also build a new stochastic matrix model, capturing standard TCP and TCP-Illinois as special cases, and use this model to analyze their fairness properties for both synchronized and unsynchronized backoff behaviors. We finally perform simulations to demonstrate the performance of TCP-Illinois.
Keywords: Congestion control; TCP; Fairness; Stability; Synchronization
Article Outline
- 1. Introduction
- 2. Background and motivation
- 3. The TCP-Illinois protocol
- 4. Fairness and stability
- 4.1. Stochastic matrix model for general AIMD algorithms
- 4.2. Markov chain for identical αi(t) and constant βi[k]
- 4.3. Stability and fairness: General case
- 4.4. Models for ρs(
) and qi() - 4.5. Synchronization and fairness
- 4.6. Compatibility with the standard TCP
- 5. TCP-Illinois properties
- 6. Simulation results
- 6.1. Single user: Efficiency property
- 6.2. Multiple users: Fairness property
- 6.3. Performance in lossy/wireless networks
- 6.4. Performance with noisy RTT measurement
- 7. Conclusion
- Acknowledgements
- References
- Vitae
[1,N/2]
