Loading...
Please wait, while we are loading the content...
Similar Documents
Computing multicast trees in dynamic networks using evolving graphs
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Bhadra, Sandeep Ferreira, Afonso |
| 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. |
| File Format | |
| Language | English |
| Publisher Date | 2002-08-01 |
| Publisher Institution | INRIA |
| Access Restriction | Open |
| Subject Keyword | GRAPH THEORETIC MODELS NP-COMPLETE MINIMUM SPANNING TREES STRONGLY CONNECTED COMPONENTS EVOLVING GRAPHS LEO SATELLITES MULTICAST WIRELESS NETWORKS MOBILE NETWORKS info Computer Science [cs] Other [cs.OH] |
| Content Type | Text |
| Resource Type | Article |
