Data Plane Throughput vs Control Plane Delay: Experimental Study of BitTorrent Performance

Abstract :

In this paper, we address the trade-off between the data plane efficiency and the control plane timeliness for the BitTorrent performance. We argue that loss-based congestion control protocols can fill large buffers, leading to a higher end-to-end delay, unlike low-priority or delay-based congestion control protocols.

We perform experiments for both the uTorrent and mainline BitTorrent clients, and we study the impact of uTP (a novel transport protocol proposed by BitTorrent) and several TCP congestion control algorithms (Cubic, New Reno, LP, Vegas and Nice) on the download completion time.

Briefly, in case peers in the swarm all use the same congestion control algorithm, we observe that the specific algorithm has only a limited impact on the swarm performance. Conversely, when a mix of TCP congestion control algorithms coexists, peers employing a delay-based low-priority algorithm exhibit shorter completion time.

Type de document :
Communication dans un congrès
IEEE P2P'XIII, Sep 2013, Trento, Italy. 2013
Liste complète des métadonnées

https://hal-imt.archives-ouvertes.fr/hal-00858196
Contributeur : Admin Télécom Paristech <>
Soumis le : mercredi 4 septembre 2013 - 18:15:29
Dernière modification le : jeudi 11 janvier 2018 - 16:25:00

Identifiants

  • HAL Id : hal-00858196, version 1

Citation

Claudio Testa, D. Rossi, Ashwin Rao, Arnaud Legout. Data Plane Throughput vs Control Plane Delay: Experimental Study of BitTorrent Performance. IEEE P2P'XIII, Sep 2013, Trento, Italy. 2013. 〈hal-00858196〉

Partager

Métriques

Consultations de la notice

468