Multicast routing with QoS based on incomplete link state information - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Multicast routing with QoS based on incomplete link state information

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5428.pdf (666.41 Ko) Télécharger le fichier

Dates and versions

inria-00070579 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070579 , version 1

Cite

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⟩
316 View
99 Download

Share

Gmail Facebook Twitter LinkedIn More