Recovery from link failures in a Smart Grid communication network using OpenFlow

Daniel Gyllstrom, N. Braga, J. Kurose
{"title":"Recovery from link failures in a Smart Grid communication network using OpenFlow","authors":"Daniel Gyllstrom, N. Braga, J. Kurose","doi":"10.1109/SmartGridComm.2014.7007655","DOIUrl":null,"url":null,"abstract":"In this paper, we design and evaluate algorithms for fast recovery from link failures in a smart grid communication network, addressing all three aspects of link failure recovery: (a) link failure detection, (b) algorithms for computing backup multicast trees, and (c) fast backup tree installation. To address (a), we design link-failure detection and reporting mechanisms that use OpenFlow to detect link failures when and where they occur inside the network. OpenFlow is an open source framework that cleanly separates the control and data planes for use in network management and control. For part (b), we formulate a new problem, Multicast Recycling, that computes backup multicast trees that aim to minimize control plane signaling overhead. We prove Multicast Recycling is at least NP-hard and present a corresponding approximation algorithm. Lastly, two control plane algorithms are proposed that signal data plane switches to install pre-computed backup trees. An optimized version of each installation algorithm is designed that finds a near minimum set of forwarding rules by sharing rules across multicast groups, thereby reducing backup tree install time and associated control state. We implement these algorithms in the POX OpenFlow controller and evaluate them using the Mininet emulator, quantifying control plane signaling and installation time.","PeriodicalId":6499,"journal":{"name":"2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)","volume":"119 1","pages":"254-259"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Smart Grid Communications (SmartGridComm)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SmartGridComm.2014.7007655","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

Abstract

In this paper, we design and evaluate algorithms for fast recovery from link failures in a smart grid communication network, addressing all three aspects of link failure recovery: (a) link failure detection, (b) algorithms for computing backup multicast trees, and (c) fast backup tree installation. To address (a), we design link-failure detection and reporting mechanisms that use OpenFlow to detect link failures when and where they occur inside the network. OpenFlow is an open source framework that cleanly separates the control and data planes for use in network management and control. For part (b), we formulate a new problem, Multicast Recycling, that computes backup multicast trees that aim to minimize control plane signaling overhead. We prove Multicast Recycling is at least NP-hard and present a corresponding approximation algorithm. Lastly, two control plane algorithms are proposed that signal data plane switches to install pre-computed backup trees. An optimized version of each installation algorithm is designed that finds a near minimum set of forwarding rules by sharing rules across multicast groups, thereby reducing backup tree install time and associated control state. We implement these algorithms in the POX OpenFlow controller and evaluate them using the Mininet emulator, quantifying control plane signaling and installation time.
使用OpenFlow从智能电网通信网络中的链路故障中恢复
在本文中,我们设计和评估了智能电网通信网络中链路故障快速恢复的算法,解决了链路故障恢复的所有三个方面:(a)链路故障检测,(b)计算备份组播树的算法,以及(c)快速备份树安装。为了解决(a),我们设计了链路故障检测和报告机制,使用OpenFlow来检测网络中何时何地发生的链路故障。OpenFlow是一个开源框架,它清晰地分离了用于网络管理和控制的控制平面和数据平面。对于(b)部分,我们提出了一个新问题,组播回收,计算旨在最小化控制平面信令开销的备份组播树。我们证明了组播回收至少是np困难的,并给出了相应的近似算法。最后,提出了两种控制平面算法,通过信号数据平面切换来安装预计算的备份树。设计了每一种安装算法的优化版本,通过在多播组间共享规则,找到一个接近最小的转发规则集,从而减少了备份树的安装时间和相关的控制状态。我们在POX OpenFlow控制器中实现了这些算法,并使用Mininet仿真器对它们进行了评估,量化了控制平面信令和安装时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信