Skip to Main content Skip to Navigation
Conference papers

Performance Analysis of a Dynamic Compact Multicast Routing Scheme

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/inria-00588106
Contributor : Dimitri Papadimitriou <>
Submitted on : Friday, April 22, 2011 - 11:48:21 AM
Last modification on : Monday, November 16, 2020 - 3:56:03 PM
Long-term archiving on: : Thursday, November 8, 2012 - 5:11:44 PM

File

AlgoTel_2011_-_Performance_Ana...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00588106, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

174

Files downloads

119