Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Traffic phase effects in packet-switched gateways
ACM SIGCOMM Computer Communication Review
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
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)
CapProbe: a simple and accurate capacity estimation technique
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Transport protocols for Internet-compatible satellite networks
IEEE Journal on Selected Areas in Communications
Ensuring fair coexistence of multimedia applications in a wireless home
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
TCP Libra: Derivation, analysis, and comparison with other RTT-fair TCPs
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the validity of flow-level tcp network models for grid and cloud simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Hi-index | 0.01 |
The majority of Internet users rely on the Transmission Control Protocol (TCP1) to download large multimedia files from remote servers (e.g. P2P file sharing). TCP has been advertised as a fair-share protocol. However, when session round-trip-times (RTTs) radically differ from each other, the share (of the bottleneck link) may be anything but fair. This motivates us to explore a new TCP, TCP Libra2, that guarantees fair sharing regardless of RTT. The key element of TCP Libra is the unique window adjustment algorithm that provably leads to RTT-independent throughput, yet converging to the fair share. We position TCP Libra in a non-linear optimization framework, proving that it provides fairness (in the sense of minimum potential delay fairness) among TCP flows that share the same bottleneck link. Equally important are the friendliness of Libra towards legacy TCP and the throughput efficiency. TCP Libra is source only based and thus easy to deploy. Via analytic modeling and simulations we show that TCP Libra achieves fairness while maintaining efficiency and friendliness to TCP New Reno. A comparison with other TCP versions that have been reported as RTT-fair in the literature is also carried out.