The macroscopic behavior of the TCP congestion avoidance algorithm

@article{Mathis1997TheMB,
  title={The macroscopic behavior of the TCP congestion avoidance algorithm},
  author={Matthew Mathis and Jeffrey Semke and Jamshid Mahdavi and Teunis J. Ott},
  journal={Comput. Commun. Rev.},
  year={1997},
  volume={27},
  pages={67-82}
}
In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. [...] Key Result Finally, we present several important implications about the behavior of the Internet in the presence of high load from diverse user communities.Expand
TCP congestion avoidance model with congestive loss
  • Jiang Wu, H. El-Ocla
  • Computer Science
  • Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)
  • 2004
TLDR
A model for the TCP congestion avoidance algorithm in networks with only congestive loss is presented, which predicts the congestion window evolution, throughput and packet loss rate of sustained TCP flows. Expand
Analytical Model of TCP with Enhanced Recovery Mechanism for Wireless Environments
TLDR
Simulations with the OPNET tool demonstrate that the model is able to predict TCP performance accurately over a wide range of packet loss rates, and results show the performance of the modified TCP scheme is markedly superior to that of standard TCP Reno over a UMTS network. Expand
An accurate model for analyzing wireless TCP performance with the coexistence of Non-TCP traffic
TLDR
The hybrid method approximates the throughput performance of an arbitrary-sized TCP connection with wireless losses much better than other proposed models, and makes some suggestions for TCP performance enhancement for overcoming the serious effect from wireless losses. Expand
Modeling Scalable TCP friendliness to NewReno TCP
Summary Scalable TCP is a simple change to the traditional TCP congestion control algorithm which dramatically improves TCP performance in high speed wide area networks. The focus of thisExpand
Stochastic Modeling and Simulation of the TCP protocol
TLDR
This thesis investigates and proposes stochastic models for TCP and proposes models that estimate packet loss rate and link utilization for a network with multiple TCP-Vegas, TCP-SACK and TCP-Reno on/off sources. Expand
Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
The transmission control protocol (TCP) is a transport protocol used in the Internet. In Ott (2005), a more general class of candidate transport protocols called ‘protocols in the TCP paradigm’ wasExpand
Steady state and transient behavior analyses of TCP connections considering interactions between TCP connections and network
TLDR
This work first derives the throughput and packet loss probability of TCP, and the number of packets queued in the bottleneck router, and then analyzes the transient behavior of TCP using a control theoretic approach, showing the influence of theNumber of TCP connections and propagation delay on its transient behavior. Expand
A Model for Steady State Throughput of TCP CUBIC
TLDR
A Markovian model is proposed to determine the steady state throughput of TCP CUBIC in wireless environment and it is proposed that random packet loss reduces the normalized average throughput more for end-to-end flow with large bandwidth-delay product. Expand
Robust TCP congestion recovery
  • Haining Wang, K. Shin
  • Computer Science
  • Proceedings 21st International Conference on Distributed Computing Systems
  • 2001
TLDR
A new robust TCP congestion recovery scheme to handle bursty packet losses while preserving the self-clocking capability and make the TCP behavior during congestion recovery very close to that during congestion avoidance, thus "extending" the performance model for congestion avoidance to that for TCP loss recovery. Expand
Performance evaluation of TCP connections in ideal and non-ideal network environments
TLDR
A simple analytical model for the throughput and transfer time of TCP as a function of the file size and TCP parameters is developed and can accurately predict the throughput for ideal TCP connections characterized by no packet loss due to congestion or bit errors. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 87 REFERENCES
Start-up dynamics of TCP's congestion control and avoidance schemes
Over the years, Transmission Control Protocol (TCP) in the Internet protocol (IP) suite has become the most widely used form of networking between computers. With the recent developments inExpand
Simulation-based comparisons of Tahoe, Reno and SACK TCP
TLDR
The congestion control algorithms in the simulated implementation of SACK TCP are described and it is shown that while selective acknowledgments are not required to solve Reno TCP's performance problems when multiple packets are dropped, the absence of selective acknowledgements does impose limits to TCP's ultimate performance. Expand
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
TLDR
Modifications that may be required both at the transport and network layers to provide good end-to-end performance over high-speed WANs are indicated. 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
Random early detection gateways for congestion avoidance
TLDR
Red gateways are designed to accompany a transport-layer congestion control protocol such as TCP and have no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. 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
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
TLDR
It is shown that in a network with no bias against connections with longer roundtrip times and with no biases against bursty traffic, a connection with multiple congested gateways can receive an acceptable level of throughput. Expand
Random Early Detection Gateways for Congestion Avoidance
This paper presents a scheme to implement congestion control at the gateway nodes. The superiority of such a scheme (congestion control at gateways) over end-to-end congestion control comes from theExpand
Measurements and analysis of end-to-end Internet dynamics
TLDR
This work describes the resulting characterizations of Internet packet loss and delay, including general assessments of queueing time scales and available bandwidth, using a distributed framework developed for conducting end-to-end measurements. Expand
TCP and Successive Fast Retransmits
TLDR
A long-standing problem for cur-rent Tahoe and Reno TCP implementations that results from invoking Fast Retransmit more than once in one roundtriptime is pointed out. Expand
...
1
2
3
4
5
...