A n experiment based on distance vector multicast routing protocol (DVMRP) is described with the procedure of multicasting a network using distance vector. This paper describes an efficient data communication within a network using multicasting technique. Multicast distance vector routing protocol combines some of the features of RIP (Routing Information Protocol) with the Truncated Reverse Path Broadcasting (TRPB) algorithm. The purpose of DVMRP is to keep track of the return paths to the source of multicast datagram. A router that routes both multicast and unicast datagram’s must run two separate routing processes. DVMRP deals with sending multicast datagram’s to the multicast group. Multicasting is done through DV (Distance Vector) routing table. Usually Multicast distance vector routing does not share its routing table with its neighbors. It can be built from the scratch or delay information that can be shared from the neighbors. Multicast datagram packets are forwarded to the multicast group through a minimum cost path. After completing its task, the old routing table can be neglected and destroyed whereas the delay information is shared periodically. This is a source based routing protocol based on RIP. For efficient transmission of the data through Multicast distance vector routing, four strategies can be used namely Flooding, Reverse Path Forwarding, Reverse Path Broadcasting, Reverse Path Multicasting. Here routers are enabled with routing tables to monitor the data transmissions in the network. DVMRP results in reliable and fast transferring of data between the source and destination in a network.
分享
引用
