Minimum Eccentricity Multicast Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2001

Minimum Eccentricity Multicast Trees


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.
Fichier principal
Vignette du fichier
dm040208.pdf (98.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00958955 , version 1 (13-03-2014)



David Krumme, Paraskevi Fragopoulou. Minimum Eccentricity Multicast Trees. Discrete Mathematics and Theoretical Computer Science, 2001, Vol. 4 no. 2 (2), pp.157-172. ⟨10.46298/dmtcs.278⟩. ⟨hal-00958955⟩


170 View
731 Download



Gmail Facebook Twitter LinkedIn More