Using Coalitional Game for Bandwidth-aware Fast Failover in Distributed SDN Environment

Jia-Wei Li, Chun-Chien Teng, Ta-Wei Yang, Cheng-Fu Chou
{"title":"Using Coalitional Game for Bandwidth-aware Fast Failover in Distributed SDN Environment","authors":"Jia-Wei Li, Chun-Chien Teng, Ta-Wei Yang, Cheng-Fu Chou","doi":"10.1109/CCNC46108.2020.9045719","DOIUrl":null,"url":null,"abstract":"With the programmability of software defined networking (SDN), it is convenient to manage network through the master and slave controllers that also provide the failover mechanism. To achieve load balancing among SDN controllers and low response time, we should dynamically assign controllers under the bandwidth constraint, so the bandwidth consumption is important. In this paper, we formulate the bandwidth consumption as mix integer linear programming model and figure out that it is NP-hard. Thus, we propose a two-phase algorithm to handle it. In the first phase, we use k-means clustering algorithm to avoid achieving local minimum and try to maximize isolating failure effect. In the second phase, we use the output of first phase as initial assignment and utilize coalitional game to further improve the result. The simulation result shows that our proposed algorithm can not only get closer to optimal result but also isolate failure effect.","PeriodicalId":443862,"journal":{"name":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC46108.2020.9045719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the programmability of software defined networking (SDN), it is convenient to manage network through the master and slave controllers that also provide the failover mechanism. To achieve load balancing among SDN controllers and low response time, we should dynamically assign controllers under the bandwidth constraint, so the bandwidth consumption is important. In this paper, we formulate the bandwidth consumption as mix integer linear programming model and figure out that it is NP-hard. Thus, we propose a two-phase algorithm to handle it. In the first phase, we use k-means clustering algorithm to avoid achieving local minimum and try to maximize isolating failure effect. In the second phase, we use the output of first phase as initial assignment and utilize coalitional game to further improve the result. The simulation result shows that our proposed algorithm can not only get closer to optimal result but also isolate failure effect.
基于联合博弈的分布式SDN环境下带宽感知快速故障转移
由于软件定义网络(SDN)的可编程性,通过提供故障转移机制的主控制器和从控制器方便地管理网络。为了实现SDN控制器之间的负载均衡和较低的响应时间,我们需要在带宽限制下动态分配控制器,因此带宽消耗很重要。本文将带宽消耗表述为混合整数线性规划模型,并指出它是np困难的。因此,我们提出了一种两阶段算法来处理它。在第一阶段,我们使用k-means聚类算法来避免局部最小,并尽量最大化隔离故障效果。在第二阶段,我们使用第一阶段的输出作为初始分配,并利用联盟博弈进一步改进结果。仿真结果表明,本文提出的算法不仅能更接近最优结果,而且能隔离故障效应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信