基于OPNET Modeler的EIGRP、OSPF和RIP动态路由协议实现决策

Sheela Ganesh Thorenoor
{"title":"基于OPNET Modeler的EIGRP、OSPF和RIP动态路由协议实现决策","authors":"Sheela Ganesh Thorenoor","doi":"10.1109/ICCNT.2010.66","DOIUrl":null,"url":null,"abstract":"This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"99","resultStr":"{\"title\":\"Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler\",\"authors\":\"Sheela Ganesh Thorenoor\",\"doi\":\"10.1109/ICCNT.2010.66\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.\",\"PeriodicalId\":135847,\"journal\":{\"name\":\"2010 Second International Conference on Computer and Network Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"99\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computer and Network Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNT.2010.66\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer and Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNT.2010.66","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 99

摘要

本文提出了在涉及距离矢量或链路状态或两者组合的协议之间进行选择时要做出的实现决策。本文对不同参数进行了比较,并对采用不同路由协议的网络进行了详细的仿真研究,结果表明,与OSPF和RIP相比,EIGRP具有更好的网络收敛时间、更少的带宽需求以及更好的CPU和内存利用率。EIGRP、OSPF和RIP是实际网络中用于向相邻路由器传播网络拓扑信息的动态路由协议。目前已有大量的静态和动态路由协议可供选择,但选择合适的路由协议取决于许多关键参数,如网络收敛时间、可扩展性、内存和CPU需求、安全性和带宽需求等。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Dynamic Routing Protocol Implementation Decision between EIGRP, OSPF and RIP Based on Technical Background Using OPNET Modeler
This paper presents th implementation decisions to be made when th choice is between protocols that involve distance vector or link state or the combination of both. Here a comparison is made between different parameters and a detailed simulation study is performed on the network with different routing protocols and it has been shown that EIGRP provides a better network convergence time, less bandwidth requirements and better CPU and memory utilization compared to OSPF and RIP. EIGRP, OSPF and RIP are the dynamic routing protocols being used in the practical networks to propagat network topology information to the neighboring routers. There have been a large number of static and dynamic routing protocols available but choice of the right protocol for routing is dependent on many parameters critical being network convergence time, scalability, memory and CPU requirements, security and bandwidth requirement etc.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic Multiple Pattern Detection Algorithm On Energy Decay of Global Solutions for a Petrovsky System with Damping Term and Source Term Development of Semantic Based Information Retrieval Using Word-Net Approach Ontology Description of Jade Computational Agents in OWL-DL Stock Exchange of Thailand Index Prediction Using Back Propagation Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1