Why TCP timers don't work well
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Improving round-trip time estimates in reliable transport protocols
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
On estimating end-to-end network path properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Packet reordering is not pathological network behavior
IEEE/ACM Transactions on Networking (TON)
The Eifel algorithm: making TCP robust against spurious retransmissions
ACM SIGCOMM Computer Communication Review
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
Measurement and classification of out-of-sequence packets in a tier-1 IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Congestion Control in Linux TCP
Proceedings of the FREENIX Track: 2002 USENIX Annual Technical Conference
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
F-RTO: an enhanced recovery algorithm for TCP retransmission timeouts
ACM SIGCOMM Computer Communication Review
A measurement study of correlations of internet flow characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
On randomizing the sending times in TCP and other window based algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
On the properties of an adaptive TCP Minimum RTO
Computer Communications
On the properties of an additive increase rate accelerator
Computer Networks: The International Journal of Computer and Telecommunications Networking
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
AIRA: additive increase rate accelerator
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Evaluating TCP-friendliness in light of Concurrent Multipath Transfer
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We argue that the design principles of the TCP timeout algorithm are based solely on RTT estimations and may lead to flow synchronization, unnecessary retransmission effort and unfair resource allocation. We present a new Window-Based Retransmission Timeout algorithm (WB-RTO) for TCP, which exhibits two major properties: (i) it cancels retransmission synchronization, which dominates when resource demand exceeds resource supply and (ii) it reschedules flows on the basis of their contribution to congestion. WB-RTO achieves better fairness and slightly better goodput with significant less retransmission effort.