Dynamic control for failure recovery and flow reconfiguration in SDN

Stefano Paris, G. Paschos, Jérémie Leguay
{"title":"Dynamic control for failure recovery and flow reconfiguration in SDN","authors":"Stefano Paris, G. Paschos, Jérémie Leguay","doi":"10.1109/DRCN.2016.7470850","DOIUrl":null,"url":null,"abstract":"By separating control and data planes, Software-Defined Networks (SDN) pave the way to a plethora of online routing mechanisms that react instantaneously to sudden traffic variation and network failures. In this paper, we introduce a dynamic routing system where these online mechanisms strive to solve an optimization instance that constantly evolves due to new arrivals and departures as well as network failures and repairs. We model the optimality gap, which is characteristic to the surcharge cost paid by network operators, of such a system as an auto-regressive stochastic process and we show that its evolving average does not diverge. We further propose a control policy that operates on top of the online routing solver to dynamically decide when to reconfigure the network. The policy minimizes the average surcharge cost and guarantees that the network reconfiguration rate does not exceed a threshold set by the operator. Numerical results show that our policy outperforms periodic schemes and approaches that reconfigure constantly the network after any system changes occur.","PeriodicalId":137650,"journal":{"name":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","volume":"13 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on the Design of Reliable Communication Networks (DRCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2016.7470850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

By separating control and data planes, Software-Defined Networks (SDN) pave the way to a plethora of online routing mechanisms that react instantaneously to sudden traffic variation and network failures. In this paper, we introduce a dynamic routing system where these online mechanisms strive to solve an optimization instance that constantly evolves due to new arrivals and departures as well as network failures and repairs. We model the optimality gap, which is characteristic to the surcharge cost paid by network operators, of such a system as an auto-regressive stochastic process and we show that its evolving average does not diverge. We further propose a control policy that operates on top of the online routing solver to dynamically decide when to reconfigure the network. The policy minimizes the average surcharge cost and guarantees that the network reconfiguration rate does not exceed a threshold set by the operator. Numerical results show that our policy outperforms periodic schemes and approaches that reconfigure constantly the network after any system changes occur.
SDN中故障恢复和流量重构的动态控制
通过分离控制平面和数据平面,软件定义网络(SDN)为大量在线路由机制铺平了道路,这些机制可以对突然的流量变化和网络故障做出即时反应。在本文中,我们引入了一个动态路由系统,其中这些在线机制努力解决一个优化实例,该实例由于新到达和离开以及网络故障和修复而不断发展。我们将网络运营商所支付的附加费用的最优性差距建模为一个自回归的随机过程,并证明其演化平均值不发散。我们进一步提出了一种控制策略,该策略在在线路由求解器之上运行,以动态地决定何时重新配置网络。该策略使平均附加费成本最小化,并保证网络重构率不超过运营商设定的阈值。数值结果表明,该策略优于在系统发生任何变化后不断重新配置网络的周期性方案和方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信