 |
 |
|
|
| HAL: inria-00070579, version 1 |
| See detailed view |  BibTeX,EndNote,... |
 |
|
|
| Multicast routing with QoS based on incomplete link state information |
|
|
| Miklós Molnár 1János Levendovszky 2 |
|
|
| (2004) |
|
|
|
| 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: | ARMOR (INRIA - IRISA) |
|
|
|
CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées (INSA) - Rennes – Ecole Nationale Supérieure des Télécommunications de Bretagne – Université de Rennes 1 |
|
|
| 2: | Budapest University of Technology and Economics (BME) |
|
|
|
Budapest University of Technology and Economics |
|
|
| 3: | Institut de Recherche Mathématique de Rennes (IRMAR) |
|
|
|
CNRS : UMR6625 – Université de Rennes 1 – École normale supérieure de Cachan - ENS Cachan – Institut National des Sciences Appliquées (INSA) : - RENNES – Université de Rennes II - Haute Bretagne |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Other |
|
|
| NETWORK / MULTICAST ROUTING / QUALITY OF SERVICE / STEINER PROBLEM |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| inria-00070579, version 1 | |
| http://hal.inria.fr/inria-00070579 | |
| oai:hal.inria.fr:inria-00070579 | |
| From: Rapport De Recherche Inria | |
| Submitted on: Friday, 19 May 2006 20:56:02 | |
| Updated on: Tuesday, 23 March 2010 11:18:26 | |
