命名数据链路状态路由协议中按需路由更新获取

Mengze Yuan, Yu Zhang, Yuanchen Hao
{"title":"命名数据链路状态路由协议中按需路由更新获取","authors":"Mengze Yuan, Yu Zhang, Yuanchen Hao","doi":"10.1109/IMCEC51613.2021.9482056","DOIUrl":null,"url":null,"abstract":"Advantages in multi-path forwarding, in-network caching, as well as information centric architecture, have made Named Data Networking (NDN) a great supporter for mobile scenarios, where rapid link changes need to be propagated timely to other nodes to maintain a consistent view of the topology. How to reduce routing overhead and keep convergence time within an acceptable range have become an urgent issue. In this paper, we propose routing update acquisition delay based on the location of topology change. Node centrality is used to set different timers for fetching Link State Advertisement (LSA), so as to reduce large overhead caused by simultaneously broadcasting LSA Interest. Simulation shows that routing overhead reduction is more obvious when link changes rapidly. At the same time, since the delayed LSA Interest can return data directly from in-network cache, convergence time is also kept within a small range.","PeriodicalId":240400,"journal":{"name":"2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An On-demand Routing Update Acquisition in Named-data Link State Routing Protocol\",\"authors\":\"Mengze Yuan, Yu Zhang, Yuanchen Hao\",\"doi\":\"10.1109/IMCEC51613.2021.9482056\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Advantages in multi-path forwarding, in-network caching, as well as information centric architecture, have made Named Data Networking (NDN) a great supporter for mobile scenarios, where rapid link changes need to be propagated timely to other nodes to maintain a consistent view of the topology. How to reduce routing overhead and keep convergence time within an acceptable range have become an urgent issue. In this paper, we propose routing update acquisition delay based on the location of topology change. Node centrality is used to set different timers for fetching Link State Advertisement (LSA), so as to reduce large overhead caused by simultaneously broadcasting LSA Interest. Simulation shows that routing overhead reduction is more obvious when link changes rapidly. At the same time, since the delayed LSA Interest can return data directly from in-network cache, convergence time is also kept within a small range.\",\"PeriodicalId\":240400,\"journal\":{\"name\":\"2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IMCEC51613.2021.9482056\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IMCEC51613.2021.9482056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在多路径转发、网络内缓存以及以信息为中心的架构方面的优势,使命名数据网络(NDN)成为移动场景的重要支持者,在移动场景中,快速的链路更改需要及时传播到其他节点,以保持拓扑视图的一致性。如何减少路由开销并使收敛时间保持在可接受的范围内已成为一个迫切需要解决的问题。本文提出了基于拓扑变化位置的路由更新获取延迟。节点中心性是为获取LSA设置不同的定时器,以减少同时广播LSA兴趣带来的巨大开销。仿真结果表明,当链路变化较快时,路由开销的降低更为明显。同时,由于延迟的LSA利息可以直接从网络内缓存返回数据,因此收敛时间也保持在较小的范围内。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An On-demand Routing Update Acquisition in Named-data Link State Routing Protocol
Advantages in multi-path forwarding, in-network caching, as well as information centric architecture, have made Named Data Networking (NDN) a great supporter for mobile scenarios, where rapid link changes need to be propagated timely to other nodes to maintain a consistent view of the topology. How to reduce routing overhead and keep convergence time within an acceptable range have become an urgent issue. In this paper, we propose routing update acquisition delay based on the location of topology change. Node centrality is used to set different timers for fetching Link State Advertisement (LSA), so as to reduce large overhead caused by simultaneously broadcasting LSA Interest. Simulation shows that routing overhead reduction is more obvious when link changes rapidly. At the same time, since the delayed LSA Interest can return data directly from in-network cache, convergence time is also kept within a small range.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The HT-TBD Algorithm for Large Maneuvering Targets with Fewer Beats and More Groups Key Technologies of Heterogeneous System General Data Service based on Virtual Table Research on Plant Disease Detection Technology Based on Wireless Sensor Network Leaf Segmentation Algorithm Based on Improved U-shaped Network under Complex Background Research on Anti-jamming Simulation based on Circular Array Antenna
×
引用
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