Modelling TCP throughput and fairness

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © IFIP International Federation for Information Processing 2004.

Cite

CITATION STYLE

APA

Leith, D. J., & Shorten, R. (2004). Modelling TCP throughput and fairness. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3042, 938–948. https://doi.org/10.1007/978-3-540-24693-0_77

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free