Provably good approximation to minimum cost delay-constrained multicast trees

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

5 Citations (Scopus)

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

Fingerprint

Costs
Communication systems
Trees (mathematics)
Approximation algorithms
Real time systems
Approximation
Trade-offs
Shortest path
NP-hard

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

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

Provably good approximation to minimum cost delay-constrained multicast trees. / Xue, Guoliang.

Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. ed. / Arun Somani; EK Park; Sudhir Dixit. Institute of Electrical and Electronics Engineers Inc., 1999. p. 610-614 805581.

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

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., 805581, Institute of Electrical and Electronics Engineers Inc., pp. 610-614, 8th International Conference on Computer Communications and Networks, ICCCN 1999, Boston, United States, 10/11/99. https://doi.org/10.1109/ICCCN.1999.805581
Xue G. Provably good approximation to minimum cost delay-constrained multicast trees. In Somani A, Park EK, Dixit S, editors, Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. Institute of Electrical and Electronics Engineers Inc. 1999. p. 610-614. 805581 https://doi.org/10.1109/ICCCN.1999.805581
Xue, Guoliang. / Provably good approximation to minimum cost delay-constrained multicast trees. Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. editor / Arun Somani ; EK Park ; Sudhir Dixit. Institute of Electrical and Electronics Engineers Inc., 1999. pp. 610-614
@inproceedings{a9d5666e89b44310a6f3bccd4505662e,
title = "Provably good approximation to minimum cost delay-constrained multicast trees",
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.",
keywords = "Approximation algorithms, communication systems, minimum cost delay-constrained multicast trees",
author = "Guoliang Xue",
year = "1999",
month = "1",
day = "1",
doi = "10.1109/ICCCN.1999.805581",
language = "English (US)",
isbn = "0780357949",
pages = "610--614",
editor = "Arun Somani and EK Park and Sudhir Dixit",
booktitle = "Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Provably good approximation to minimum cost delay-constrained multicast trees

AU - Xue, Guoliang

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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.

AB - 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.

KW - Approximation algorithms

KW - communication systems

KW - minimum cost delay-constrained multicast trees

UR - http://www.scopus.com/inward/record.url?scp=84940693780&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940693780&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.1999.805581

DO - 10.1109/ICCCN.1999.805581

M3 - Conference contribution

AN - SCOPUS:84940693780

SN - 0780357949

SN - 9780780357945

SP - 610

EP - 614

BT - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

A2 - Somani, Arun

A2 - Park, EK

A2 - Dixit, Sudhir

PB - Institute of Electrical and Electronics Engineers Inc.

ER -