Since TCP traffic is elastic, a fundamental issue is the behaviour of multiple TCP flows competing for bandwidth on a shared link. Motivated by the ubiquity of drop-tail queueing in current networks, our focus in this paper is on developing analytic models suited to characterising the throughput and fairness of competing TCP flows in drop-tail environments. Building on recent ideas from the theory of positive linear systems, we obtain simple, insightful closed-form expressions for throughput and fairness. The accuracy of these expressions is confirmed in extensive simulations across a range of network conditions. In particular, they are found to provide accurate estimate of mean fairness and throughput even when flows are not synchronised.
- Congestion Control
- Queue Size
- Congestion Window
- Bottleneck Link
- 20ms Step
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
E. Altman, C. Barakat, E. Laborde, P. Brown, and D. Collange, “Fairness analysis of tcp/ip,” in Proceedings IEEE Conference on Decision and Control, Sydney, 2000.
S. Low, F. Paganini, and J. Doyle, “Internet congestion control,” IEEE Control Systems Magazine, vol. 32, no. 1, pp. 28–43, 2002.
J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, “Modeling tcp throughput: A simple model and its empirical validation,” in Proceedings SIGCOMM’98, 1998.
R. Yang, M. Kim, and S. Lam, “Transient behaviors of tcp-friendly congestion control protocols,” in Proceedings INFOCOM 2001, 2001.
S. Floyd, M. Handley, and J. Padhye, “A comparison of equation-based and aimd congestion control,” in Int. Computer Science Institute Technical Report, 2000.
D. Chiu and R. Jain, “Analysis of the increase/decrease algorithms for congestion avoidance in computer networks,” Journal of Computer Networks, vol. 17, no. 1, pp. 1–14, 1989.
P. Brown, “Resource sharing of tcp connections with different round trip times,” in Proceedings INFOCOMM 2000, 2000.
R. Shorten, D. Leith, J. Foy, and R. Kilduff, “Towards an analysis and design framework for congestion control in communication networks,” in Proceedings of the 12th Yale Workshop on Adaptive and Learning Systems, 2003.
“Network simulator, http://www.isi.edu/nsnam/ns/,” tech. rep., University of California, Berkeley.
S. Floyd and V. Jacobson, “Traffic phase effects in packet-switched gateways,” ACM SIGCOMM Computer Communication Review, vol. 21, no. 2, pp. 26–42, 1991.
Editors and Affiliations
Rights and permissions
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leith, D.J., Shorten, R. (2004). Modelling TCP Throughput and Fairness. In: Mitrou, N., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds) Networking 2004. NETWORKING 2004. Lecture Notes in Computer Science, vol 3042. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24693-0_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21959-0
Online ISBN: 978-3-540-24693-0
eBook Packages: Springer Book Archive