Mechanisms for broadcast and selective broadcast
Mechanisms for broadcast and selective broadcast
Core selection with end-to-end QoS support
Proceedings of the 2004 ACM symposium on Applied computing
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
On algorithm for the delay- and delay variation-bounded multicast trees based on estimation
HPCC'05 Proceedings of the First international conference on High Performance Computing and Communications
End-to-end QoS routing framework for differentiated services networks
Computer Communications
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.