Minimizing Flow Rules for Rerouting Multi-Flows in Multi-Failure Recovery over SDN

Meng Sun, K. Shao, Lu Wang
{"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}
引用次数: 2

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.
基于SDN的多故障恢复中多流重路由的最小化流规则
软件定义网络(SDN)是一种支持逻辑集中控制的新型网络范式。对于SDN中的故障恢复,现有的研究大多针对单一故障场景或单流重路由。然而,考虑多故障场景和多流重路由更接近真实的SDN环境。由于SDN架构中控制器与交换机之间存在通信瓶颈,流规则在二者通信中起着重要的作用。因此,在本文中,我们将重点放在最小化网络发生多个链路故障时重路由多流的流规则上,称为RMFWMF。我们首先提出了一个模型来度量流重路由过程中控制器和交换机之间的通信开销。接下来,我们将问题化为0-1非线性规划模型,证明了它可以转化为0-1线性规划,并利用基于拉格朗日松弛的分解来求解模型。最后,在测试网络中进行了实验。结果表明,该算法可以避免恢复后网络中的链路拥塞,并提供与之前算法相比最小的流量规则。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信