Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Encodings of Multicast Trees

Abstract : In this paper, we present efficient ways of encoding multicast trees. Multicast tree encodings provide a convenient way of performing stateless and explicit multicast routing in networks and overlays. We show the correspondence of multicast trees to theoretical tree data structures and give lower bounds on the number of bits needed to represent multicast trees. Our encodings can be used to represent multicast trees using both node identifiers and link indexes and are based on balanced parentheses representation of tree data structures. These encodings are almost space optimal and can be read and processed efficiently. We evaluate the length of these encodings on multicast trees in generated and real topologies.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 8:53:42 PM
Last modification on : Friday, November 18, 2022 - 9:27:55 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:28:35 PM


  • HAL Id : inria-00070565, version 1



Vijay Arya, Thierry Turletti, Shivkumar Kalyanaraman. Encodings of Multicast Trees. [Research Report] RR-5442, INRIA. 2004, pp.21. ⟨inria-00070565⟩



Record views


Files downloads