Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Multicast routing extensions for OSPF
Communications of the ACM
An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
An efficient delay-constrained multicast routing algorithm
Journal of High Speed Networks
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
On multicast flow control for heterogeneous receivers
IEEE/ACM Transactions on Networking (TON)
The impact of point-to-multipoint traffic concentration on multirate networks design
IEEE/ACM Transactions on Networking (TON)
Delay-constrained, low-cost multicast routing in multimedia networks
Journal of Parallel and Distributed Computing
Algorithms for delay-constrained low-cost multicast tree construction
Computer Communications
An efficient and easily deployable QoS-based routing scheme for online Internet multicasting
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Multicast routing and its QoS extension: problems, algorithms, and protocols
IEEE Network: The Magazine of Global Internetworking
Scalable fair reliable multicast using active services
IEEE Network: The Magazine of Global Internetworking
Deployment issues for the IP multicast service and architecture
IEEE Network: The Magazine of Global Internetworking
Proactive rearrangement in delay constrained dynamic membership multicast
Computer Communications
| Hi-index | 0.00 |
Multimedia applications are usually resource intensive, have stringent quality of service requirements, and in many cases involve large groups of participants. Multicasting is poised to play an important role in future deployment of these applications. This paper focuses on developing delay-bounded, minimum-cost multicast trees, linking a source to a set of multicast destination nodes. The approach taken in this paper is efficient, flexible and unique in the sense that it cleverly limits its computation only to paths that originate at multicast nodes, thereby avoiding computing paths that exclusively link non-multicast nodes. The simulation results show that the multicast trees produced by the proposed heuristic are of lower cost than those produced by other well-known heuristics, including those which use an expensive k-shortest-paths procedure to minimize the cost of the multicast tree. Furthermore, the results show that, in comparison to other heuristics, the proposed scheme results in a significant reduction in the computation time required to build the multicast tree.