Revisiting TCP Congestion Control Using Delay Gradients - NETWORKING 2011 - Part II Access content directly
Conference Papers Year : 2011

Revisiting TCP Congestion Control Using Delay Gradients


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).
Fichier principal
Vignette du fichier
978-3-642-20798-3_25_Chapter.pdf (522.02 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01597987 , version 1 (29-09-2017)





David A. Hayes, Grenville Armitage. Revisiting TCP Congestion Control Using Delay Gradients. 10th IFIP Networking Conference (NETWORKING), May 2011, Valencia, Spain. pp.328-341, ⟨10.1007/978-3-642-20798-3_25⟩. ⟨hal-01597987⟩
107 View
541 Download



Gmail Facebook X LinkedIn More