HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Computing multicast trees in dynamic networks using evolving graphs

Sandeep Bhadra 1 Afonso Ferreira 1
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior. This naturally engenders new route-discovery problems under changing conditions over these networks. Unfortunately, the temporal variations in the network topology are hard to be effectively captured in a classical graph model. In this paper, we use and extend a recently proposed graph theoretic model, which helps capture the evolving characteristi- c of such networks, in order to compute multicast trees with minimum overall transmission time for a class of wireless mobile dynamic networks. We first show that computing different types of strongly connected components in this model is NP-Complete, and then propose an algorithm to build all rooted directed minimum spanning trees in already identified strongly connected components.
Document type :
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 : Tuesday, May 23, 2006 - 7:39:58 PM
Last modification on : Friday, February 4, 2022 - 3:20:09 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:51:05 PM


  • HAL Id : inria-00072057, version 1



Sandeep Bhadra, Afonso Ferreira. Computing multicast trees in dynamic networks using evolving graphs. [Research Report] RR-4531, INRIA. 2002. ⟨inria-00072057⟩



Record views


Files downloads