A Protocol for Scalable Loop-Free Multicast Routing
CALIFORNIA UNIV SANTA CRUZ DEPT OF COMPUTER ENGINEERING
Pagination or Media Count:
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 communications 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 a specially 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 applications group dynamics and size. MIP is independent of the underlying unicast routing algorithms used.
- Command, Control and Communications Systems