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

https://hal.inria.fr/hal-00958955
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 4:53:02 PM
Last modification on : Friday, January 10, 2020 - 3:42:21 PM
Long-term archiving on: : Friday, June 13, 2014 - 12:04:24 PM

File

dm040208.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

362

Files downloads

835