{"title":"基于SDN的多故障恢复中多流重路由的最小化流规则","authors":"Meng Sun, K. Shao, Lu Wang","doi":"10.1145/3316615.3316684","DOIUrl":null,"url":null,"abstract":"The software defined networks (SDN) is a new network paradigm that supports logical central control. For the failure recovery in SDN, most existing research mainly addressed single failure scenario or single flow rerouting. However, considering multi-failure scenario and multi-flows rerouting is closer to the real SDN environment. Since SDN architecture has a communication bottleneck between the controller and switches, flow rule plays an importance role in their communication. Thus, in this paper, we concentrate on minimizing flow rules for rerouting multi-flows when network occurs multiple link failures, named RMFWMF. We first propose a model to metric the communication overhead between controller and switch during flow rerouting. Next, we formulate the problem as a 0-1 nonlinear programming model, show it can be transformed into a 0-1 linear programming and solve the model using decomposition based on Lagrange relaxation. At last, we implement an experiment in a test network. The result shows that our solution can avoid link congestion in the post-recovery network and can provide the minimum flow rules compared with the pervious algorithm.","PeriodicalId":268392,"journal":{"name":"Proceedings of the 2019 8th International Conference on Software and Computer Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Minimizing Flow Rules for Rerouting Multi-Flows in Multi-Failure Recovery over SDN\",\"authors\":\"Meng Sun, K. Shao, Lu Wang\",\"doi\":\"10.1145/3316615.3316684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The software defined networks (SDN) is a new network paradigm that supports logical central control. For the failure recovery in SDN, most existing research mainly addressed single failure scenario or single flow rerouting. However, considering multi-failure scenario and multi-flows rerouting is closer to the real SDN environment. Since SDN architecture has a communication bottleneck between the controller and switches, flow rule plays an importance role in their communication. Thus, in this paper, we concentrate on minimizing flow rules for rerouting multi-flows when network occurs multiple link failures, named RMFWMF. We first propose a model to metric the communication overhead between controller and switch during flow rerouting. Next, we formulate the problem as a 0-1 nonlinear programming model, show it can be transformed into a 0-1 linear programming and solve the model using decomposition based on Lagrange relaxation. At last, we implement an experiment in a test network. The result shows that our solution can avoid link congestion in the post-recovery network and can provide the minimum flow rules compared with the pervious algorithm.\",\"PeriodicalId\":268392,\"journal\":{\"name\":\"Proceedings of the 2019 8th International Conference on Software and Computer Applications\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-02-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2019 8th International Conference on Software and Computer Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3316615.3316684\",\"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 2019 8th International Conference on Software and Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3316615.3316684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimizing Flow Rules for Rerouting Multi-Flows in Multi-Failure Recovery over SDN
The software defined networks (SDN) is a new network paradigm that supports logical central control. For the failure recovery in SDN, most existing research mainly addressed single failure scenario or single flow rerouting. However, considering multi-failure scenario and multi-flows rerouting is closer to the real SDN environment. Since SDN architecture has a communication bottleneck between the controller and switches, flow rule plays an importance role in their communication. Thus, in this paper, we concentrate on minimizing flow rules for rerouting multi-flows when network occurs multiple link failures, named RMFWMF. We first propose a model to metric the communication overhead between controller and switch during flow rerouting. Next, we formulate the problem as a 0-1 nonlinear programming model, show it can be transformed into a 0-1 linear programming and solve the model using decomposition based on Lagrange relaxation. At last, we implement an experiment in a test network. The result shows that our solution can avoid link congestion in the post-recovery network and can provide the minimum flow rules compared with the pervious algorithm.