A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a steiner topology

Guoliang Xue, Wei Xiao

Research output: Contribution to journalArticle

10 Scopus citations

Abstract

This paper is concerned with a restricted version of minimum cost delay-constrained multicast in a network where each link has a delay and a cost. Given a source vertex s and p destination vertices t1, t 2,.... tp together with p corresponding nonnegative delay constraints d1, d2,... ,dp, many QoS multicast problems seek a minimum cost multicast tree in which the delay along the unique s-ti path is no more than d, for 1 ≤ 1 ≤ p. This problem is NP-hard even when the topology of the multicast tree is fixed. In this paper we show that every multicast tree has an underlying Steiner topology and that every minimum cost delay-constrained multicast tree corresponds to a minimum cost delay-constrained realization of a corresponding Steiner topology. We present a fully polynomial time approximation scheme for computing a minimum cost delay-constrained multicast tree under a Steiner topology. We also present computational results of a preliminary implementation to illustrate the effectiveness of our algorithm and discuss its applications.

Original languageEnglish (US)
Pages (from-to)53-72
Number of pages20
JournalAlgorithmica (New York)
Volume41
Issue number1
DOIs
StatePublished - Oct 1 2004

Keywords

  • Computer communications
  • Fully polynomial time approximation scheme
  • Minimum cost delay-constrained network under a steiner topology
  • Quality of service

ASJC Scopus subject areas

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A polynomial time approximation scheme for minimum cost delay-constrained multicast tree under a steiner topology'. Together they form a unique fingerprint.

  • Cite this