%0 Conference Proceedings
%T Revisiting TCP Congestion Control Using Delay Gradients
%+ Swinburne University of Technology [Melbourne]
%A Hayes, David, A.
%A Armitage, Grenville
%Z Part 7: TCP
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th IFIP Networking Conference (NETWORKING)
%C Valencia, Spain
%Y Jordi Domingo-Pascual
%Y Pietro Manzoni
%Y Sergio Palazzo
%Y Ana Pont
%Y Caterina Scoglio
%I Springer
%3 NETWORKING 2011
%V LNCS-6641
%N Part II
%P 328-341
%8 2011-05-09
%D 2011
%R 10.1007/978-3-642-20798-3_25
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X Traditional loss-based TCP congestion control (CC) tends to induce high queuing delays and perform badly across paths containing links that exhibit packet losses unrelated to congestion. Delay-based TCP CC algorithms infer congestion from delay measurements and tend to keep queue lengths low. To date most delay-based CC algorithms do not coexist well with loss-based TCP, and require knowledge of a network path’s RTT characteristics to establish delay thresholds indicative of congestion. We propose and implement a delay-gradient CC algorithm (CDG) that no longer requires knowledge of path-specific minimum RTT or delay thresholds. Our FreeBSD implementation is shown to coexist reasonably with loss-based TCP (NewReno) in lightly multiplexed environments, share capacity fairly between instances of itself and NewReno, and exhibits improved tolerance of non-congestion related losses (86% better goodput than NewReno in the presence of 1% packet losses).
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01597987/document
%2 https://inria.hal.science/hal-01597987/file/978-3-642-20798-3_25_Chapter.pdf
%L hal-01597987
%U https://inria.hal.science/hal-01597987
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-NETWORKING
%~ IFIP-LNCS-6641