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.
Type de document :
[Research Report] RR-6874, INRIA. 2009
Liste complète des métadonnées

Contributeur : Romaric Guillier <>
Soumis le : mardi 10 mars 2009 - 15:01:07
Dernière modification le : vendredi 20 avril 2018 - 15:44:26
Document(s) archivé(s) le : vendredi 12 octobre 2012 - 13:21:00


Fichiers produits par l'(les) auteur(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〉



Consultations de la notice


Téléchargements de fichiers