Skip to Main content Skip to Navigation

UDT and TCP without Congestion Control for Profile Pursuit

Abstract : Instead of relying on the congestion control algorithm and its objective of statistical fair sharing when transfers are assorted with strict deadlines, it might be beneficial to share the links in a different manner. The goal of this research report is to confront two solutions to send data according to a pre-established profile of bandwidth: one based on UDT, one on TCP and PSPacer. In this research report, we have shown how they can be used to implement transfers on such profiles. Based on real experiments a model to predict completion time using RTT and profiles is proposed. For TCP, it is shown to be accurate as soon as the margin is more than 2.5~\% of the capacity. Furthermore, the cost of transition is shown to be independent of RTT and height of the steps.
Complete list of metadata
Contributor : Romaric Guillier <>
Submitted on : Tuesday, March 10, 2009 - 3:01:07 PM
Last modification on : Saturday, September 11, 2021 - 3:17:27 AM
Long-term archiving on: : Friday, October 12, 2012 - 1:21:00 PM


Files produced by the author(s)


  • HAL Id : inria-00367160, version 1


Romaric Guillier, Sébastien Soudan, Pascale Primet. UDT and TCP without Congestion Control for Profile Pursuit. [Research Report] RR-6874, INRIA. 2009. ⟨inria-00367160⟩



Record views


Files downloads