A Heuristic Algorithm for Core Selection in Multicast Routing

• Published in: Journal of computer science and technology 2011-11, Vol.26 (6), p.954-961
• Main Authors: Kabat, Manas Ranjan, Patel, Manoj Kumar, Tripathy, Chita Ranjan
• Format: Article
• Language: English
• Subjects: Algorithms; Artificial Intelligence; Computer networks; Computer Science; Computer simulation; Data Structures and Information Theory; Data transmission; Delay; Heuristic; Heuristic methods; Information Systems Applications (incl.Internet); Mathematical models; Multicast; Multicasting; Multimedia; Multimedia communications; Quality of service; Regular Paper; Routing; Routing (telecommunications); Software Engineering; Studies; Theory of Computation; Trees; 启发式算法; 多媒体应用; 多媒体技术; 多播传输; 多播路由选择; 延迟约束; 时间复杂度; 组播树
• ISSN: 1000-9000; 1860-4749
• DOI: 10.1007/s11390-011-1192-x

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.