1. You are Here：

Full metadata record
DC FieldValueLanguage
dc.contributor.authorLai, YCen_US
dc.contributor.authorLin, YDen_US
dc.contributor.authorYu, WCen_US
dc.contributor.authorLin, YTen_US
dc.date.accessioned2014-12-08T15:27:29Z-
dc.date.available2014-12-08T15:27:29Z-
dc.date.issued1997en_US
dc.identifier.isbn0-8186-8186-1en_US
dc.identifier.urihttp://hdl.handle.net/11536/19746-
dc.description.abstractIn 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.en_US
dc.language.isoen_USen_US
dc.titleGMNF-DVMRP: A modified version of Distance Vector Multicast Routing Protocolen_US
dc.typeProceedings Paperen_US
dc.identifier.journalSIXTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGSen_US
dc.citation.spage65en_US
dc.citation.epage68en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1997BJ71K00009-
Appears in Collections:Conferences Paper


Related Contents
Loading...