Performance Analysis of a Dynamic Compact Multicast Routing Scheme - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Performance Analysis of a Dynamic Compact Multicast Routing Scheme


Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing paths they produce. This paper introduces a dynamic compact routing scheme that allows the distribution of traffic from any source to any set of leaf nodes along a point-to-multipoint routing path referred to as multicast (traffic) distribution tree. By means of the proposed scheme, a multicast distribution tree can dynamically evolve according to the arrival of leaf-initiated join/leave requests. We evaluate by means of simulation the performance of the proposed scheme and analyze the tradeoffs between the stretch of the produced routing paths, the size and the number of routing table entries, and the communication cost.
Fichier principal
Vignette du fichier
AlgoTel_2011_-_Performance_Analysis_of_a_Dynamic_Compact_Multicast_Routing_Scheme.pdf (106.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00588106 , version 1 (22-04-2011)


  • HAL Id : inria-00588106 , version 1


Dimitri Papadimitriou, Pedro Pedroso, Piet Demeester. Performance Analysis of a Dynamic Compact Multicast Routing Scheme. 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), May 2011, Cap Estérel, France. ⟨inria-00588106⟩


85 View
52 Download


Gmail Facebook X LinkedIn More