Multicast routing with bandwidth requirement in the case of incomplete information as a Steiner tree problem - l'unam - université nantes angers le mans Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

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

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4343.pdf (666.84 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00072245 , version 1

Citer

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⟩
297 Consultations
109 Téléchargements

Partager

Gmail Facebook X LinkedIn More