为全新的命名数据网络提出、指定和验证基于控制器的路由协议

J. V. Torres, I. D. Alvarenga, A. Pedroza, O. Duarte
{"title":"为全新的命名数据网络提出、指定和验证基于控制器的路由协议","authors":"J. V. Torres, I. D. Alvarenga, A. Pedroza, O. Duarte","doi":"10.1109/NOF.2016.7810122","DOIUrl":null,"url":null,"abstract":"Named-Data Networking (NDN) is the most prominent proposal for a clean-slate proposal of Future Internet. Nevertheless, NDN routing schemes present scalability concerns due to the required number of stored routes and of control messages. In this work, we present a controller-based routing protocol using a formal method to unambiguously specify, and validate to prove its correctness. Our proposal codes signaling information on content names, avoiding control message overhead, and reduces router memory requirements, storing only the routes for simultaneously consumed prefixes. Additionally, the protocol installs a new route on all routers in a path with a single route request to the controller, avoiding replication of routing information and automating router provisioning. As a result, we provide a protocol proposal description using the Specification and Description Language and we validate the protocol, proving that CRoS behavior is free of dead or live locks. Furthermore, the protocol validation guarantees that the scheme ensures a valid working path from consumer to producer, even if it does not assure the shortest path.","PeriodicalId":208097,"journal":{"name":"2016 7th International Conference on the Network of the Future (NOF)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Proposing, specifying, and validating a controller-based routing protocol for a clean-slate Named-Data Networking\",\"authors\":\"J. V. Torres, I. D. Alvarenga, A. Pedroza, O. Duarte\",\"doi\":\"10.1109/NOF.2016.7810122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Named-Data Networking (NDN) is the most prominent proposal for a clean-slate proposal of Future Internet. Nevertheless, NDN routing schemes present scalability concerns due to the required number of stored routes and of control messages. In this work, we present a controller-based routing protocol using a formal method to unambiguously specify, and validate to prove its correctness. Our proposal codes signaling information on content names, avoiding control message overhead, and reduces router memory requirements, storing only the routes for simultaneously consumed prefixes. Additionally, the protocol installs a new route on all routers in a path with a single route request to the controller, avoiding replication of routing information and automating router provisioning. As a result, we provide a protocol proposal description using the Specification and Description Language and we validate the protocol, proving that CRoS behavior is free of dead or live locks. Furthermore, the protocol validation guarantees that the scheme ensures a valid working path from consumer to producer, even if it does not assure the shortest path.\",\"PeriodicalId\":208097,\"journal\":{\"name\":\"2016 7th International Conference on the Network of the Future (NOF)\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 7th International Conference on the Network of the Future (NOF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NOF.2016.7810122\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 7th International Conference on the Network of the Future (NOF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOF.2016.7810122","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

命名数据网络(NDN)是未来互联网最突出的全新方案。然而,由于需要存储路由和控制消息的数量,NDN路由方案存在可伸缩性问题。在这项工作中,我们提出了一个基于控制器的路由协议,使用形式化的方法来明确地指定,并验证以证明其正确性。我们的建议对内容名称的信令信息进行编码,避免了控制消息开销,并减少了路由器内存需求,仅存储同时使用的前缀的路由。此外,该协议在一条路径中的所有路由器上安装一条新路由,并向控制器发出单个路由请求,从而避免了路由信息的复制并实现了路由器配置的自动化。因此,我们使用规范和描述语言提供了一个协议提案描述,并验证了协议,证明CRoS行为没有死锁或活锁。此外,协议验证保证方案确保从消费者到生产者的有效工作路径,即使它不保证最短路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Proposing, specifying, and validating a controller-based routing protocol for a clean-slate Named-Data Networking
Named-Data Networking (NDN) is the most prominent proposal for a clean-slate proposal of Future Internet. Nevertheless, NDN routing schemes present scalability concerns due to the required number of stored routes and of control messages. In this work, we present a controller-based routing protocol using a formal method to unambiguously specify, and validate to prove its correctness. Our proposal codes signaling information on content names, avoiding control message overhead, and reduces router memory requirements, storing only the routes for simultaneously consumed prefixes. Additionally, the protocol installs a new route on all routers in a path with a single route request to the controller, avoiding replication of routing information and automating router provisioning. As a result, we provide a protocol proposal description using the Specification and Description Language and we validate the protocol, proving that CRoS behavior is free of dead or live locks. Furthermore, the protocol validation guarantees that the scheme ensures a valid working path from consumer to producer, even if it does not assure the shortest path.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信