为软件定义网络配置生成一致的更新

Yifei Yuan, Franjo Ivancic, C. Lumezanu, Shuyuan Zhang, Aarti Gupta
{"title":"为软件定义网络配置生成一致的更新","authors":"Yifei Yuan, Franjo Ivancic, C. Lumezanu, Shuyuan Zhang, Aarti Gupta","doi":"10.1145/2620728.2620774","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of consistently updating network configurations in a software-defined network. We are interested in generating an update sequence ordering that guarantees per-packet consistency. We present a procedure that computes a safe update sequence by generating an add-before rule dependency graph. Nodes in the graph correspond to rules to be installed and edges capture dependency relations among them.","PeriodicalId":309136,"journal":{"name":"Proceedings of the third workshop on Hot topics in software defined networking","volume":"38 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Generating consistent updates for software-defined network configurations\",\"authors\":\"Yifei Yuan, Franjo Ivancic, C. Lumezanu, Shuyuan Zhang, Aarti Gupta\",\"doi\":\"10.1145/2620728.2620774\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of consistently updating network configurations in a software-defined network. We are interested in generating an update sequence ordering that guarantees per-packet consistency. We present a procedure that computes a safe update sequence by generating an add-before rule dependency graph. Nodes in the graph correspond to rules to be installed and edges capture dependency relations among them.\",\"PeriodicalId\":309136,\"journal\":{\"name\":\"Proceedings of the third workshop on Hot topics in software defined networking\",\"volume\":\"38 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the third workshop on Hot topics in software defined networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2620728.2620774\",\"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 the third workshop on Hot topics in software defined networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2620728.2620774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文研究了软件定义网络中网络配置的持续更新问题。我们感兴趣的是生成保证每个包一致性的更新序列排序。我们提出了一个通过生成一个add-before规则依赖图来计算安全更新序列的过程。图中的节点对应于要安装的规则,边捕获它们之间的依赖关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generating consistent updates for software-defined network configurations
This paper addresses the problem of consistently updating network configurations in a software-defined network. We are interested in generating an update sequence ordering that guarantees per-packet consistency. We present a procedure that computes a safe update sequence by generating an add-before rule dependency graph. Nodes in the graph correspond to rules to be installed and edges capture dependency relations among them.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信