Skip to Main content Skip to Navigation

A RTT-based Partitioning Algorithm for a Multi-rate Reliable Multicast Protocol

Moufida Maimour 1, 2 Cong-Duc Pham
1 RESO - Protocols and softwares for very high-performance network
Inria Grenoble - Rhône-Alpes, ENS Lyon - École normale supérieure - Lyon, CNRS - Centre National de la Recherche Scientifique : UMR5668
Abstract : Various Internet applications involve multiple parties and usually adopt a one-to-many communication paradigm (multicast). The presence of multiple receivers in a multicast session rises the problem of inter-receiver fairness. Transmitting with a rate which matches the slowest receiver will limit the throughput of other receivers and thus their satisfaction. A multi-rate mechanism where the receivers are distributed into subgroups with similar capacities, can improve the inter-receiver fairness for multicast sessions. In this report, we deal with the problem of receivers partitioning and propose a simple algorithm based on the receivers RTT variations where an explicit estimation of the receivers capacities is avoided. Our partitionin- g algorithm, although simple, performs an on-the-fly partitioning depending on the receivers' feedback. We show that our partitioning algorithm approximates and in many cases, achieves the optimal solution with a minimum computation effort.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:50:45 PM
Last modification on : Friday, January 15, 2021 - 9:23:44 AM


  • HAL Id : inria-00071807, version 1



Moufida Maimour, Cong-Duc Pham. A RTT-based Partitioning Algorithm for a Multi-rate Reliable Multicast Protocol. [Research Report] RR-4779, LIP RR-2003-16, INRIA, LIP. 2003. ⟨inria-00071807⟩



Record views


Files downloads