Abstract : This paper is concerned with developing novel algorithms for multicast routing in packet switched communication networks when there is no available exact information about the link states in the network. In these cases probabilistic models can be used and the goal of the route selection procedure is to find an admissible route with maximal probability. The multicast probabilistic routing model with bandwidth and cost requirement in the case of incomplete information is reduced to a deterministic Steiner tree problem. The multicast routing concerning the end-to-end delay requirement can be transformed in some cases to finding shortest paths between the multicast nodes based on equivalent deterministic link measures.
https://hal.inria.fr/inria-00070579 Contributor : Rapport de Recherche InriaConnect in order to contact the contributor Submitted on : Friday, May 19, 2006 - 8:56:02 PM Last modification on : Friday, May 20, 2022 - 9:04:45 AM Long-term archiving on: : Sunday, April 4, 2010 - 9:30:39 PM
Miklos Molnar, János Levendovszky, Patrice Leguesdron, Csaba Végsö. Multicast routing with QoS based on incomplete link state information. [Research Report] RR-5428, INRIA. 2004, pp.21. ⟨inria-00070579⟩