QoSMIC: quality of service sensitive multicast Internet protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
A comparison of reliable multicast protocols
Multimedia Systems
Mitigating server-side congestion in the Internet through pseudoserving
IEEE/ACM Transactions on Networking (TON)
Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks
Mobile Networks and Applications
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
A Routing Protocol for Anycast Messages
IEEE Transactions on Parallel and Distributed Systems
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
Survey of multicast routing algorithms and protocols
ICCC '02 Proceedings of the 15th international conference on Computer communication
Short communication: Routing and wavelength assignment for core-based tree in WDM networks
Computer Communications
A case for tree evolution in QoS multicasting
Computer Communications
A performance evaluation on Qos-supporting multicast protocol over conventional multicast protocol
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A case for tree migration and integrated tree maintenance in QoS multicasting
Computer Communications
| Hi-index | 0.07 |
In network multimedia applications such as multiparty teleconferencing, users often need to send the same information to several (but not necessarily all) other users. To manage such one-to-many or many-to-many communication efficiently in wide-area internetworks, it is imperative to support and perform multicast routing. Multicast routing sends a single copy of a message from a source to multiple receivers over a communication link that is shared by the paths to the receivers. Loop-freedom is an especially important consideration in multicasting because applications using multicasting tend to be multimedia and bandwidth intensive, and loops in multicast routing duplicate looping packets. We present and verify a new multicast routing protocol, called multicast Internet protocol (MIP), which offers a simple and flexible approach to constructing both group-shared and shortest-paths multicast trees. MIP can be sender-initiated or receiver-initiated or both; therefore, it can be tailored to the particular nature of an application's group dynamics and size. MIP is independent of the underlying unicast routing algorithms used. MIP is robust and adapts under dynamic network conditions (topology or link cost changes) to maintain loop-free multicast routing. Under stable network conditions, MIP has no maintenance or control message overhead. We prove that MIP is loop-free at every instant, and that it is deadlock-free and obtains multicast routing trees within a finite time after the occurrence of an arbitrary sequence of topology or unicast changes