Kang Xingyuan, Keichi Takahashi, Chawanat Nakasan, Kohei Ichikawa, Hajimu Iida
{"title":"Load-Aware Multi-Objective Optimization of Controller and Datastore Placement in Distributed Sdns","authors":"Kang Xingyuan, Keichi Takahashi, Chawanat Nakasan, Kohei Ichikawa, Hajimu Iida","doi":"10.1002/cpe.70007","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In distributed Software Defined Networking (SDN), multiple controllers need to maintain a consistent view of the network state among themselves using consensus algorithms, introducing additional communication overhead and network delay, especially in large-scale networks. Therefore, optimizing controller placement presents significant challenges, as it must account not only for the delay between switches and controllers but also for the delay introduced by consensus algorithms. Additionally, SDN controllers have limited capacity in terms of the number of switches they can manage and the network events they can process. Improper placement of controllers can lead to longer message processing times, increased queuing delays, or even controller failures. Thus, achieving balanced workloads among controllers is essential. This study introduces and validates a practical Flow Setup Time (FST) model to measure controller response times. We proposed an advanced multi-objective optimization approach that incorporates the Variance of Load Balancing (VOLB), to determine the optimal placements of controllers and datastore nodes involved in processing consensus algorithms. Furthermore, we applied this optimization method to different types of real networks from the Internet Topology Zoo dataset. Based on experimental findings, we identified key factors to consider when selecting optimal placement strategies, including the trade-offs between the number of controllers, the number of datastore nodes, FST, and VOLB.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 4-5","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.70007","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
In distributed Software Defined Networking (SDN), multiple controllers need to maintain a consistent view of the network state among themselves using consensus algorithms, introducing additional communication overhead and network delay, especially in large-scale networks. Therefore, optimizing controller placement presents significant challenges, as it must account not only for the delay between switches and controllers but also for the delay introduced by consensus algorithms. Additionally, SDN controllers have limited capacity in terms of the number of switches they can manage and the network events they can process. Improper placement of controllers can lead to longer message processing times, increased queuing delays, or even controller failures. Thus, achieving balanced workloads among controllers is essential. This study introduces and validates a practical Flow Setup Time (FST) model to measure controller response times. We proposed an advanced multi-objective optimization approach that incorporates the Variance of Load Balancing (VOLB), to determine the optimal placements of controllers and datastore nodes involved in processing consensus algorithms. Furthermore, we applied this optimization method to different types of real networks from the Internet Topology Zoo dataset. Based on experimental findings, we identified key factors to consider when selecting optimal placement strategies, including the trade-offs between the number of controllers, the number of datastore nodes, FST, and VOLB.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.