Multicast routing with bandwidth requirement in the case of incomplete information as a Steiner tree problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2001

Multicast routing with bandwidth requirement in the case of incomplete information as a Steiner tree problem

Abstract

This paper is concerned with developing novel algorithms for multicast routing in packet switched communication networks. First, multicast routing with bandwidth requirement in the case of incomplete information is reduced to a deterministic Steiner tree problem. Then taboo search algorithms are used to provide high quality, sub-optimal solutions for multicast routing in polynomial time.
Fichier principal
Vignette du fichier
RR-4343.pdf (666.84 Ko) Télécharger le fichier

Dates and versions

inria-00072245 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00072245 , version 1

Cite

Patrice Leguesdron, János Levendovszky, Miklos Molnar, Csaba Végsö. Multicast routing with bandwidth requirement in the case of incomplete information as a Steiner tree problem. [Research Report] RR-4343, INRIA. 2001. ⟨inria-00072245⟩
292 View
98 Download

Share

Gmail Facebook Twitter LinkedIn More