Computing multicast trees in dynamic networks using evolving graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

Computing multicast trees in dynamic networks using evolving graphs

Résumé

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.
Fichier principal
Vignette du fichier
RR-4531.pdf (269.81 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00072057 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00072057 , version 1

Citer

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

Partager

Gmail Facebook X LinkedIn More