Abstract
In this paper, we make a survey of Distance Vector Multicast Routing Protocol (DVMRP) and find that it is not optimal in the aspect of network cost (NC). Therefore, we propose a modified version of DVMRP, called `Group Membership Near First-DVMRP' (GMNF-DVMRP), to decrease the NC of the multicast tree formed by DVMRP. A simulation is implemented to compare our modified version and the original DVMRP. We find that our method save about 5-7 percent of NC of the multicast tree formed by DVMRP.
Original language | English |
---|---|
Pages | 65-68 |
Number of pages | 4 |
DOIs | |
State | Published - 22 Sep 1997 |
Event | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA Duration: 22 Sep 1997 → 25 Sep 1997 |
Conference
Conference | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 |
---|---|
City | Las Vegas, NV, USA |
Period | 22/09/97 → 25/09/97 |