A Heuristic Algorithm for Core Selection in Multicast Routing |
| |
Authors: | Manas Ranjan Kabat Manoj Kumar Patel Chita Ranjan Tripathy |
| |
Affiliation: | 1. Department of Computer Science and Engineering, Veer Surendra Sai University of Technology, Burla, 768018, India
|
| |
Abstract: | With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|