Abstract
Given a network topology and costs associated with the links, the problem of generating a minimum cost multicast tree can be modelled as a Steiner tree problem. However, many real time applications such as video-conferencing require that data be sent within prespecified delay limits in order to avoid problems such as anachronism and lack of synchronization. This paper deals with the delay-bounded cost-optimal multicast tree (DBCMT) generation problem. A closely related problem is to find a delay-bounded cost-optimal path (DBCP) between a specified source and destination node. Such a path can be used be used as a starting point to solve the DBCMT. We present here two heuristics for building delay constrained multicast trees which have near optimal cost. A comparison of our heuristics with other proposed heuristics is also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bajaj, R., Ravikumar, C.P., Chandra, S.: Distributed delay-constrained multicast path setup algorithm for high-speed networks. In: Proceedings of International Conference on High Performance Computing, pp. 438–442 (1997)
Salaama, H.F.: Multicast Routing for Real-time Communication on High-Speed Networks. Ph.D. Thesis. North Carolina State University, Raleigh, USA (1996)
Salaama, H.F., et al.: Delay-constrained Shared Multicast Trees. Tech. Report, Department of Electrical and Comp. Engg., North Carolina State Univ., USA (1997)
Kumar, G., Narang, N., Ravikumar, C.P.: Efficient Algorithms for Delay-bounded Minimum Cost Path Problem in Communication Networks. In: Proceedings of the Fifth International Conference on High Performance computing (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Narang, N., Kumar, G., Ravikumar, C.P. (1999). Efficient Algorithms for Delay Bounded Multicast Tree Generation for Multimedia Applications. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive