Modelling TCP Throughput and Fairness

@inproceedings{Leith2004ModellingTT,
  title={Modelling TCP Throughput and Fairness},
  author={Douglas J. Leith and R. Shorten},
  booktitle={NETWORKING},
  year={2004}
}
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… Expand
1 Citations
A positive systems model of TCP-like congestion control: asymptotic results
TLDR
It is shown that the theory of nonnegative matrices may be employed to model communication networks that employ drop-tail queueing and Additive-Increase Multiplicative-Decrease (AIMD) congestion control algorithms and these results can be used to develop tools for analyzing the behavior of AIMD communication networks. Expand

References

SHOWING 1-10 OF 10 REFERENCES
Fairness analysis of TCP/IP
TLDR
A mathematical model is developed to study how the bottleneck bandwidth will be shared if TCP windows are not synchronized and indicates how much a synchronization-based study underestimates the performance of TCP in a nonsynchronized environment. Expand
Transient behaviors of TCP-friendly congestion control protocols
  • Y. Yang, M. Kim, S. Lam
  • Computer Science
  • Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
TLDR
The fairness, smoothness, responsiveness, and aggressiveness of TCP and three representative TCP-friendly congestion control protocols: GAIMD, TFRC, and TEAR are investigated and it is observed that smoothness and fairness are positively correlated. Expand
Modeling TCP throughput: a simple model and its empirical validation
TLDR
A simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send is developed. Expand
Internet congestion control
TLDR
An optimization-based framework is described that provides an interpretation of various flow control mechanisms, in particular, the utility being optimized by the protocol's equilibrium structure, and presents a new protocol that overcomes limitations and provides stability in a way that is scalable to arbitrary networks, link capacities, and delays. Expand
Resource sharing of TCP connections with different round trip times
  • P. Brown
  • Computer Science
  • Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
TLDR
It is shown that a bias in favor of connections with short round trip delays persists even for large buffer sizes, and that for small buffers small round trip times predominate in global performance while the opposite is true for large buffers. Expand
Traffic phase effects in packet-switched gateways
TLDR
This paper defines the notion of traffic phase in a packet-switched network and describesHow phase differences between competing traffic streams can be the dominant factor in relative throughput and suggests that simply coding a gateway to drop a random packet from its queue on overflow is often sufficient. Expand
Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks
TLDR
It is shown that a simple additive increase and multiplicative decrease algorithm satisfies the sufficient conditions for con- vergence to an efficient and fair state regardless of the starting state of the network. Expand
A Comparison of Equation-Based and AIMD Congestion Control
TLDR
This paper considers AIMD-based congestion control mechanisms that are TCP-compatible, but that reduce their sending rate less sharply than does TCP in response to a single packet drop, and compares them with TFRC (TCP-Friendly Rate Control), which makes use of equation- based congestion control. Expand
Towards an analysis and design framework for congestion control in communication networks
  • Proceedings of the 12th Yale Workshop on Adaptive and Learning Systems
  • 2003
Network simulator, http://www.isi.edu/nsnam/ns
  • tech. rep