GMNF-DVMRP:距离矢量组播路由协议的修改版本

Y. Lai, Ying-Dar Lin, Wei-Che Yu, Yuh-Tay Lin
{"title":"GMNF-DVMRP:距离矢量组播路由协议的修改版本","authors":"Y. Lai, Ying-Dar Lin, Wei-Che Yu, Yuh-Tay Lin","doi":"10.1109/ICCCN.1997.623292","DOIUrl":null,"url":null,"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.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"GMNF-DVMRP: a modified version of distance vector multicast routing protocol\",\"authors\":\"Y. Lai, Ying-Dar Lin, Wei-Che Yu, Yuh-Tay Lin\",\"doi\":\"10.1109/ICCCN.1997.623292\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":305733,\"journal\":{\"name\":\"Proceedings of Sixth International Conference on Computer Communications and Networks\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Sixth International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.1997.623292\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Sixth International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.1997.623292","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文对距离矢量组播路由协议(DVMRP)进行了研究,发现它在网络开销方面并不是最优的。因此,我们提出了一种改进版本的DVMRP,称为“近首DVMRP组成员”(GMNF-DVMRP),以减少DVMRP形成的组播树的NC。通过仿真比较了改进后的DVMRP和原始的DVMRP。我们发现我们的方法节省了DVMRP形成的组播树的5- 7%的NC。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GMNF-DVMRP: a modified version of distance vector multicast routing protocol
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信