{"title":"基于联合博弈的分布式SDN环境下带宽感知快速故障转移","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":"{\"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}","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}
Using Coalitional Game for Bandwidth-aware Fast Failover in Distributed SDN Environment
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.