The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Dynamic behavior of slowly-responsive congestion control algorithms
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
On the long-run behavior of equation-based rate control
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
TCP-friendly congestion control to guarantee smoothness by Slack Term
Computer Communications
Extending equation-based congestion control to high-speed and long-distance networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Interval type-2 fuzzy logic congestion control for video streaming across IP networks
IEEE Transactions on Fuzzy Systems
Queue dynamics with window flow control
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We consider unicast equation-based rate control, where, at some points in time, a source adjusts its rate to f(p, r). Here p is an on-line estimate of the loss-event rate, r, of the mean round-trip time, both as observed by this source, and f is a TCP throughput formula. It was generally believed that such a source would be TCP-friendly, that is, under the same operating conditions, its long-run time-average send rate (throughput) would not be larger than that of a TCP source. Our goal is to identify whether, and how far, this is true. First, we identify factors that play a role in TCP friendliness and find that it is important to study them separately. Then we analyze the importance of individual factors. A first factor is conservativeness (= throughput not larger than f(p, r)). We show that conservativeness is influenced by some convexity properties of f(p, r) with respect to p, and the covariance of the loss process. We show that in many real life cases these conditions result in conservativeness and, sometimes, excessive conservativeness. This explains the previously observed phenomena of throughput-drop when losses are high and f is the so-called PFTK formula. The second factor is that the source may experience considerably different loss-event rate than a TCP source. We identify and analyze two limit cases where this may lead to either TCP-friendliness or, in contrast, non-TCP-friendliness. Other factors such as round trip time and obedience of TCP to its own formula are found to be less significant. Our claims are obtained by analysis, and verified by numerical examples, simulations, laboratory and Internet experiments. Our results suggest that TCP-friendliness is difficult to verify in practice, whereas conservativeness is easier.