Polynomial algorithm for min-cost delay-constrained multicasting routing problem in networks

We propose a novel polynomial algorithm for constructing a min-cost communication tree to connect the subset of network nodes which forms the multicast group of destinations in such way that the delays along each path from the source vertex to the sinks do not exceed the given delay bounds. From the...

Full description

Saved in:
Bibliographic Details
Published inProceedings of ICICS, 1997 International Conference on Information, Communications and Signal Processing. Theme: Trends in Information Systems Engineering and Wireless Multimedia Communications (Cat Vol. 3; pp. 1805 - 1809 vol.3
Main Authors Erzin, A.I., Sang-Ha Kim
Format Conference Proceeding
LanguageEnglish
Published IEEE 1997
Subjects
Approximation algorithms
Bandwidth
Computer science
Costs
Delay
Intelligent networks
Multicast algorithms
Polynomials
Routing
Tree graphs
Online AccessGet full text

Cover

More Information
Summary:We propose a novel polynomial algorithm for constructing a min-cost communication tree to connect the subset of network nodes which forms the multicast group of destinations in such way that the delays along each path from the source vertex to the sinks do not exceed the given delay bounds. From the mathematical point of view this is a Steiner tree problem with restrictions on the lengths of the paths from the root to destinations.
ISBN:0780336763
9780780336766
DOI:10.1109/ICICS.1997.652307