Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Improving the start-up behavior of a congestion control scheme for TCP
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
Extending equation-based congestion control to multicast applications
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
The BLUE active queue management algorithms
IEEE/ACM Transactions on Networking (TON)
On the long-run behavior of equation-based rate control
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
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
IEEE Network: The Magazine of Global Internetworking
Transport-independent fairness
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
TCP-friendly congestion control for the fair streaming of scalable video
Computer Communications
Wireless Transport Layer Congestion Control Evaluation
International Journal of Wireless Networks and Broadband Technologies
Robust and fair Multicast Congestion Control (M2C)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We study limitations of an equation-based congestion control protocol, called TCP-Friendly Rate Control (TFRC). It examines how the three main factors that determine TFRC throughput, namely, the TCP-friendly equation, loss event rate estimation, and delay estimation, can influence the long-term throughput imbalance between TFRC and TCP. Especially, we show that different sending rates of competing flows cause these flows to experience different loss event rates. There are several fundamental reasons why TFRC and TCP flows have different average sending rates, from the first place. Earlier work shows that the convexity of the TCP-friendly equation used in TFRC causes the sending rate difference. We report two additional reasons in this paper: 1) the convexity of 1/x where x is a loss event period and 2) different retransmission timeout period (RTO) estimations of TCP and TFRC. These factors can be the reasons for TCP and TFRC to experience initially different sending rates. But we find that the loss event rate difference due to the differing sending rates greatly amplifies the initial throughput difference; in some extreme cases, TFRC uses around 20 times more, or sometimes 10 times less, bandwidth than TCP. Despite these factors influencing the throughput difference, we also find that simple heuristics can greatly mitigate the problem.