Fast Heuristics for the QoS Multicast Routing Problem

Abstract : The NP-hard QoS Multicast Routing (QoSMR) is one of the most challenging problems in recent networks. In this paper, we investigate the QoSMR as well as its different existing formulations. We analyze the limitations of these formulations and propose a novel one. The main advantage of our formulation is that it considers not only the quality of the multicast subgraph formed by the computed paths, but also takes into account the end-to-end quality of each of these paths. Moreover, we study the state-of-the-art proposal for solving the QoSMR problem and show that the well-known MAMCRA algorithm can be very expensive in computation time. Therefore, we propose two efficient heuristics based on the computation of shortest paths. Extensive simulations are performed, and obtained results prove that these fast heuristics have bounded response time and find satisfying solutions for the QoS requirements.
Type de document :
Communication dans un congrès
Globecom, Dec 2010, Miami, United States. 2010
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00534476
Contributeur : Alia Bellabas <>
Soumis le : mardi 9 novembre 2010 - 17:21:54
Dernière modification le : mardi 24 avril 2018 - 13:38:41
Document(s) archivé(s) le : jeudi 30 juin 2011 - 13:36:19

Fichier

GlobeCom2010.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : inria-00534476, version 1

Citation

Alia Bellabas, Samer Lahoud, Miklós Molnár. Fast Heuristics for the QoS Multicast Routing Problem. Globecom, Dec 2010, Miami, United States. 2010. 〈inria-00534476〉

Partager

Métriques

Consultations de la notice

432

Téléchargements de fichiers

95