Efficient Algorithms for Delay Bounded Multicast Tree Generation for Multimedia Applications
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.
KeywordsDestination Node Multimedia Application Multicast Tree Multicast Group Delay Constraint
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 2.Salaama, H.F.: Multicast Routing for Real-time Communication on High-Speed Networks. Ph.D. Thesis. North Carolina State University, Raleigh, USA (1996)Google Scholar
- 3.Salaama, H.F., et al.: Delay-constrained Shared Multicast Trees. Tech. Report, Department of Electrical and Comp. Engg., North Carolina State Univ., USA (1997)Google Scholar
- 4.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)Google Scholar