Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 4:53:02 PM
Last modification on : Wednesday, October 20, 2021 - 12:24:14 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:04:24 PM


Files produced by the author(s)




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



Record views


Files downloads