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
Hidden Markov modeling for network communication channels
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
A survey on TCP-friendly congestion control
IEEE Network: The Magazine of Global Internetworking
TCP/IP modeling and validation
IEEE Network: The Magazine of Global Internetworking
Modeling the throughput of TCP Vegas
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Limitations of Equation-Based Congestion Control in Mobile Ad Hoc Networks
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
End-to-end congestion control for TCP-friendly flows with variable packet size
ACM SIGCOMM Computer Communication Review
Media-friendliness of a slowly-responsive congestion control protocol
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
A stochastic model of TCP/IP with stationary random losses
IEEE/ACM Transactions on Networking (TON)
On the long-run behavior of equation-based rate control
IEEE/ACM Transactions on Networking (TON)
Limitations of equation-based congestion control
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of AIMD protocols over paths with variable delay
Computer Networks: The International Journal of Computer and Telecommunications Networking
A simple and efficient hop-by-hop congestion control protocol for wireless mesh networks
WICON '06 Proceedings of the 2nd annual international workshop on Wireless internet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Media streaming via TFRC: An analytical study of the impact of TFRC on user-perceived media quality
Computer Networks: The International Journal of Computer and Telecommunications Networking
Limitations of equation-based congestion control
IEEE/ACM Transactions on Networking (TON)
Study on nominee selection for multicast congestion control
Computer Communications
Analysis of AIMD protocols over paths with variable delay
Computer Networks: The International Journal of Computer and Telecommunications Networking
Throughput-smoothness tradeoff in preventing competing TCP from starvation
Computer Communications
Robust and fair Multicast Congestion Control (M2C)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We consider unicast equation-based rate control, where a source estimates the loss event ratio $p$, and, primarily at loss events, adjusts its send rate to $f(p)$. Function $f$ is assumed to represent the loss-throughput relation that TCP would experience. When no loss occurs, the rate may also be increased according to some additional mechanism. We assume that the loss event interval estimator is non-biased. If the loss process is deterministic, the control is TCP-friendly in the long-run, i.e, the average throughput does not exceed that of TCP. If, in contrast, losses are random, it is a priori not clear whether this holds, due to the non-linearity of $f$, and a phenomenon similar to Feller's paradox. Our goal is to identify the key factors that drive whether, and how far, the control is TCP friendly (in the long run). As TCP and our source may experience different loss event intervals, we distinguish between TCP-friendliness and conservativeness (throughput does not exceed $f(p)$). We give a representation of the long term throughput, and derive that conservativeness is primarily influenced by various convexity properties of $f$, the variability of loss events, and the correlation structure of the loss process. In many cases, these factors lead to conservativeness, but we show reasonable experiments where the control is clearly non-conservative. However, our analysis also suggests that our source should experience a higher loss event ratio than TCP, which would make non-TCP friendliness less likely. Our findings provide guidelines that help understand when an equation base control is indeed TCP-friendly in the long-run, and in some cases, excessively so. The effects of round trip time and its variations are not included in this study.