A Comparison of Name-Based Content Routing Protocols

E. Hemmati, J. Garcia-Luna-Aceves
{"title":"A Comparison of Name-Based Content Routing Protocols","authors":"E. Hemmati, J. Garcia-Luna-Aceves","doi":"10.1109/MASS.2015.52","DOIUrl":null,"url":null,"abstract":"The first comparison of the performance of name-based content routing protocols based on distance vectors and link-states is presented. The protocols used for this comparison are the Named-data Link State Routing (NLSR) protocol, which is the main representative of name-based content routing based on link states, and the Distance-based Content Routing (DCR) protocol, which is the first name-based content routing protocol based on distance vectors. In the simulation of NLSR, the signaling of NLSR is simplified to minimize the overhead it incurs sending link state advertisements (LSAs), such that a single transmission is need to send an LSA, rather than multiple transmission as is the case with NLSR. The results of simulations show that the ideal version of NLSR requires fewer control messages to react to changes of name prefixes when the number of replicas is very small, and DCR incurs less signaling overhead to react to topology changes or changes in name prefixes when the number of replicas is large.","PeriodicalId":436496,"journal":{"name":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS.2015.52","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

The first comparison of the performance of name-based content routing protocols based on distance vectors and link-states is presented. The protocols used for this comparison are the Named-data Link State Routing (NLSR) protocol, which is the main representative of name-based content routing based on link states, and the Distance-based Content Routing (DCR) protocol, which is the first name-based content routing protocol based on distance vectors. In the simulation of NLSR, the signaling of NLSR is simplified to minimize the overhead it incurs sending link state advertisements (LSAs), such that a single transmission is need to send an LSA, rather than multiple transmission as is the case with NLSR. The results of simulations show that the ideal version of NLSR requires fewer control messages to react to changes of name prefixes when the number of replicas is very small, and DCR incurs less signaling overhead to react to topology changes or changes in name prefixes when the number of replicas is large.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于名称的内容路由协议的比较
首先比较了基于距离矢量和链路状态的基于名称的内容路由协议的性能。用于这种比较的协议是命名数据链路状态路由(NLSR)协议和基于距离的内容路由(DCR)协议,前者是基于链路状态的基于名称的内容路由的主要代表,后者是第一个基于距离向量的基于名称的内容路由协议。在NLSR的仿真中,为了减少发送LSA的开销,对NLSR的信令进行了简化,只需要一次发送一条LSA,而不需要像NLSR那样多次发送。仿真结果表明,当副本数量很少时,理想版本的NLSR需要较少的控制消息来响应名称前缀的变化,而当副本数量很大时,DCR需要较少的信令开销来响应拓扑变化或名称前缀的变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic Provisioning for High Energy Efficiency and Resource Utilization in Cloud RANs An Energy Efficient and Restricted Tour Construction for Mobile Sink in Wireless Sensor Networks MQCC: Maximum Queue Congestion Control for Multipath Networks with Blockage Context-Aware Crowd-Sensing in Opportunistic Mobile Social Networks Study of Hadoop-MapReduce on Google N-Gram Datasets
×
引用
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