Minimum Eccentricity Multicast Trees

Abstract : We consider the problem of constructing a multicast tree that connects a group of source nodes to a group of sink nodes (receivers) and minimizes the maximum end-to-end delay between any pair of source/sink nodes. This is known as the \emphminimum eccentricity multicast tree problem, and is directly related to the quality of service requirements of real multipoint applications. We deal directly with the problem in its general form, meaning that the sets of source and sink nodes need not be overlapping nor disjoint. The main contribution of this work is a polynomial algorithm for this problem on general networks which is inspired by an innovative method that uses geometric relationships on the xy-plane.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.157-172
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00958955
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 16:53:02
Dernière modification le : jeudi 11 janvier 2018 - 06:21:31
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:04:24

Fichier

dm040208.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00958955, version 1

Collections

Citation

David Krumme, Paraskevi Fragopoulou. Minimum Eccentricity Multicast Trees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, 4 (2), pp.157-172. 〈hal-00958955〉

Partager

Métriques

Consultations de la notice

239

Téléchargements de fichiers

170