## 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 t_{1}, t _{2},.... t_{p} together with p corresponding nonnegative delay constraints d_{1}, d_{2},... ,d_{p}, many QoS multicast problems seek a minimum cost multicast tree in which the delay along the unique s-t_{i} 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 language | English (US) |
---|---|

Pages (from-to) | 53-72 |

Number of pages | 20 |

Journal | Algorithmica (New York) |

Volume | 41 |

Issue number | 1 |

DOIs | |

State | Published - 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