Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
ACM SIGCOMM Computer Communication Review
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Understanding TCP vegas: a duality model
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Internet research needs better models
ACM SIGCOMM Computer Communication Review
Networking over next-generation satellite systems
Networking over next-generation satellite systems
Variability in TCP round-trip times
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
ACM SIGCOMM Computer Communication Review
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
TCP libra: exploring RTT-fairness for TCP
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Transport protocols for Internet-compatible satellite networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The Transmission Control Protocol (TCP), the most widely used transport protocol over the Internet, has been advertised to implement fairness between flows competing for the same narrow link. However, when session round-trip-times (RTTs) radically differ, the share may be anything but fair. This RTT-unfairness represents a problem that severely affects the performance of long-RTT flows and whose solution requires a revision of TCP's congestion control scheme. To this aim, we discuss TCP Libra, a new transport protocol able to ensure fairness and scalability regardless of the RTT, while remaining friendly towards legacy TCP. As main contributions of this paper: (i) we focus on the model derivation and show how it leads to the design of TCP Libra; (ii) we analyze the role of its parameters and suggest how they may be adjusted to lead to asymptotic stability and fast convergence; (iii) we perform model-based, simulative, and real testbed comparisons with other TCP versions that have been reported as RTT-fair in the literature. Results demonstrate the ability of TCP Libra in ensuring RTT-fairness while remaining throughput efficient and friendly towards legacy TCP.