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}
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.