{"title":"Enhancing Software-Defined Networking With Dynamic Load Balancing and Fault Tolerance Using a Q-Learning Approach","authors":"Ankit Kumar Jain, Pooja Kumari, Rajat Dhull, Krish Jindal, Shahid Raza","doi":"10.1002/cpe.8298","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>The Software-Defined Networking (SDN) paradigm represents a fundamental shift in networking by decoupling the control plane from the data plane in network devices. This architectural change offers numerous advantages, including network programmability and centralized management capabilities, which improve scalability and efficiency compared to conventional network architectures. However, the dynamic nature of network traffic presents overload challenges, both temporally and spatially, especially in multi-controller SDN settings. To address these challenges, this paper presents an approach leveraging network traffic patterns for dynamic load balancing. The proposed framework optimizes migration strategies to reduce costs and enhance in-packet request-response rates. By exploiting load ratio variance across controllers, the architecture identifies optimal migration triplets, encompassing migration-in and migration-out domains by selecting a subset of switches. The architecture utilizes online Q-learning technology to achieve optimal controller load balancing while minimizing associated expenses. The proposed approach ensures stability and scalability by imposing limits to maintain maximum efficiency and reduce migration conflicts. It iteratively converges to an optimal policy through a comprehensive set of simulations performed on switches under a wide range of load distribution situations. These results highlight the effectiveness and adaptability of the proposed methodology in addressing the intricacies present in dynamic network settings, encouraging further progress in the field of SDN technologies and their real-world applications.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2024-10-15","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.8298","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
The Software-Defined Networking (SDN) paradigm represents a fundamental shift in networking by decoupling the control plane from the data plane in network devices. This architectural change offers numerous advantages, including network programmability and centralized management capabilities, which improve scalability and efficiency compared to conventional network architectures. However, the dynamic nature of network traffic presents overload challenges, both temporally and spatially, especially in multi-controller SDN settings. To address these challenges, this paper presents an approach leveraging network traffic patterns for dynamic load balancing. The proposed framework optimizes migration strategies to reduce costs and enhance in-packet request-response rates. By exploiting load ratio variance across controllers, the architecture identifies optimal migration triplets, encompassing migration-in and migration-out domains by selecting a subset of switches. The architecture utilizes online Q-learning technology to achieve optimal controller load balancing while minimizing associated expenses. The proposed approach ensures stability and scalability by imposing limits to maintain maximum efficiency and reduce migration conflicts. It iteratively converges to an optimal policy through a comprehensive set of simulations performed on switches under a wide range of load distribution situations. These results highlight the effectiveness and adaptability of the proposed methodology in addressing the intricacies present in dynamic network settings, encouraging further progress in the field of SDN technologies and their real-world applications.
软件定义网络(Software-Defined Networking,SDN)范式通过将网络设备中的控制平面与数据平面解耦,代表了网络领域的根本性转变。与传统网络架构相比,这种架构变革具有众多优势,包括网络可编程性和集中管理能力,从而提高了可扩展性和效率。然而,网络流量的动态特性带来了时间和空间上的过载挑战,尤其是在多控制器 SDN 设置中。为应对这些挑战,本文提出了一种利用网络流量模式实现动态负载平衡的方法。所提出的框架优化了迁移策略,以降低成本并提高包内请求响应率。该架构利用控制器之间的负载率差异,通过选择交换机子集来确定最佳迁移三元组,包括迁入和迁出域。该架构利用在线 Q-learning 技术实现最佳控制器负载平衡,同时将相关费用降至最低。建议的方法通过施加限制来保持最高效率并减少迁移冲突,从而确保稳定性和可扩展性。它通过在各种负载分布情况下对交换机进行的一系列综合模拟,迭代收敛到最优策略。这些结果凸显了所提方法在解决动态网络设置中存在的错综复杂问题方面的有效性和适应性,鼓励在 SDN 技术及其实际应用领域取得进一步进展。
期刊介绍:
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.