Provably good approximation to minimum cost delay-constrained multicast trees

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Multicast is an important operation in communication systems. In many real-time system applications, we are interested in finding a low-cost multicast tree satisfying a set of delay-constraints. Finding a minimum cost multicast tree is NP-hard, even in the case where the cost and delay of an edge are identical. In this paper, we present an efficient approximation algorithm for computing a low-cost multicast tree satisfying delay-constraints. Unlike most algorithms proposed in the literature, our algorithm has a provably good performance bound when the cost and delay of an edge are identical. This is achieved using a trade-off between a Steiner minimum tree and a shortest path tree. We also discuss extensions to communication systems where the cost and delay of an edge are different.

Original languageEnglish (US)
Title of host publicationProceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
EditorsArun Somani, EK Park, Sudhir Dixit
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages610-614
Number of pages5
ISBN (Print)0780357949, 9780780357945
DOIs
StatePublished - Jan 1 1999
Externally publishedYes
Event8th International Conference on Computer Communications and Networks, ICCCN 1999 - Boston, United States
Duration: Oct 11 1999Oct 13 1999

Other

Other8th International Conference on Computer Communications and Networks, ICCCN 1999
CountryUnited States
CityBoston
Period10/11/9910/13/99

Keywords

  • Approximation algorithms
  • communication systems
  • minimum cost delay-constrained multicast trees

ASJC Scopus subject areas

  • Information Systems and Management
  • Computer Networks and Communications
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Provably good approximation to minimum cost delay-constrained multicast trees'. Together they form a unique fingerprint.

  • Cite this

    Xue, G. (1999). Provably good approximation to minimum cost delay-constrained multicast trees. In A. Somani, EK. Park, & S. Dixit (Eds.), Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999 (pp. 610-614). [805581] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCN.1999.805581