Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Multicast routing for multimedia communication
IEEE/ACM Transactions on Networking (TON)
Distributed algorithms for multicast path setup in data networks
IEEE/ACM Transactions on Networking (TON)
Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
QoSMIC: quality of service sensitive multicast Internet protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
An efficient delay-constrained multicast routing algorithm
Journal of High Speed Networks
IEEE/ACM Transactions on Networking (TON)
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Improved fault recovery for core based trees
Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks
IEEE Journal on Selected Areas in Communications
A QoS-aware multicast routing protocol
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree when node failures occur during the tree construction period and recovering from any node failure in a multicast tree during the on-going multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed algorithm performs the failure recovery efficiently, which gives better performance in terms of the number of exchanged messages and the convergence time than the existing distributed SP-based delay constrained multicast routing algorithms in a network where node failures occur.