26535 articles – 20363 Notices  [english version]
Voir la fiche détaillée Rapports
Liste des fichiers attachés à ce document :
PS
RR-5428.ps(8.6 MB)
PDF
RR-5428.pdf(666.4 KB)
Multicast routing with QoS based on incomplete link state information
Miklós Molnár1, János Levendovszky2, Patrice Leguesdron3, Csaba Végsö2

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.
1 :  INRIA - IRISA - ARMOR
2 :  BME - Budapest University of Technology and Economics
3 :  IRMAR - Institut de Recherche Mathématique de Rennes
NETWORK / MULTICAST ROUTING / QUALITY OF SERVICE / STEINER PROBLEM