Skip to Main content Skip to Navigation
Reports

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

Patrice Leguesdron 1 János Levendovszky 2 Miklos Molnar 3 Csaba Végsö 2
3 ARMOR - Architectures and network models
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes, Ecole Nationale Supérieure des Télécommunications de Bretagne
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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072245
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 8:12:47 PM
Last modification on : Thursday, February 11, 2021 - 2:48:03 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:00:19 PM

Identifiers

  • HAL Id : inria-00072245, version 1

Citation

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⟩

Share

Metrics

Record views

673

Files downloads

190