An innovative NSGA-II-based Byzantine Fault Tolerant solution for software defined network environments

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2024-09-23 DOI:10.1016/j.comnet.2024.110819
Waqas Ahmed , Nadir Shah , Gabriel-Miro Muntean
{"title":"An innovative NSGA-II-based Byzantine Fault Tolerant solution for software defined network environments","authors":"Waqas Ahmed ,&nbsp;Nadir Shah ,&nbsp;Gabriel-Miro Muntean","doi":"10.1016/j.comnet.2024.110819","DOIUrl":null,"url":null,"abstract":"<div><div>Byzantine fault tolerance (BFT) of the control plane in Software Defined Networking (SDN) is achieved by mapping each switch to <span><math><mrow><mn>3</mn><mi>f</mi><mo>+</mo><mn>1</mn></mrow></math></span> number of controllers, where <span><math><mi>f</mi></math></span> represents the number of faulty controllers that can be tolerated at a time. A BFT approach protects the data plane from any potential malicious activity at the control plane by detecting the inconsistency among the response messages from multiple controllers. To compute the optimal mapping of switches to the controller, the existing literature does not consider some important parameters. This paper proposes a novel approach, named NBFT-SDN, that extends an artificial intelligence algorithm (<em>i.e.</em> NSGA-II) to solve a new formulated multi-objective optimization problem associated with this mapping. NBFT-SDN considers the very important parameters link reliability and link load along with switch-to-controller minimum delay, switch-to-controllers maximum reliability, controller-to-controller minimum delay, minimum link load, minimum hop count, and controller load balancing when mapping the switches to the controllers in optimum manner. The performance of our proposed approach is evaluated in comparison to a state-of-art approach using real network traces with network topologies of diverse sizes. Our proposed approach NBFT-SDN show improved network performance in terms of reliability, delay, hop count, load balancing and link load.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"254 ","pages":"Article 110819"},"PeriodicalIF":4.6000,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624006510","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Byzantine fault tolerance (BFT) of the control plane in Software Defined Networking (SDN) is achieved by mapping each switch to 3f+1 number of controllers, where f represents the number of faulty controllers that can be tolerated at a time. A BFT approach protects the data plane from any potential malicious activity at the control plane by detecting the inconsistency among the response messages from multiple controllers. To compute the optimal mapping of switches to the controller, the existing literature does not consider some important parameters. This paper proposes a novel approach, named NBFT-SDN, that extends an artificial intelligence algorithm (i.e. NSGA-II) to solve a new formulated multi-objective optimization problem associated with this mapping. NBFT-SDN considers the very important parameters link reliability and link load along with switch-to-controller minimum delay, switch-to-controllers maximum reliability, controller-to-controller minimum delay, minimum link load, minimum hop count, and controller load balancing when mapping the switches to the controllers in optimum manner. The performance of our proposed approach is evaluated in comparison to a state-of-art approach using real network traces with network topologies of diverse sizes. Our proposed approach NBFT-SDN show improved network performance in terms of reliability, delay, hop count, load balancing and link load.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于 NSGA-II 的创新型软件定义网络环境拜占庭容错解决方案
软件定义网络(SDN)中控制平面的拜占庭容错(BFT)是通过将每个交换机映射到 3f+1 个控制器来实现的,其中 f 代表一次可容忍的故障控制器数量。BFT 方法通过检测来自多个控制器的响应信息之间的不一致性,保护数据平面免受控制平面任何潜在恶意活动的影响。为了计算开关到控制器的最佳映射,现有文献没有考虑一些重要参数。本文提出了一种名为 NBFT-SDN 的新方法,它扩展了一种人工智能算法(即 NSGA-II),以解决与该映射相关的新制定的多目标优化问题。NBFT-SDN 在以最佳方式将交换机映射到控制器时,考虑了非常重要的参数:链路可靠性和链路负载,以及交换机到控制器的最小延迟、交换机到控制器的最大可靠性、控制器到控制器的最小延迟、最小链路负载、最小跳数和控制器负载平衡。通过使用具有不同规模网络拓扑结构的真实网络跟踪,将我们提出的方法与最先进的方法进行了性能评估。我们提出的 NBFT-SDN 方法在可靠性、延迟、跳数、负载平衡和链路负载等方面改善了网络性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
Design and evaluation of a robust and explainable intrusion detection framework for 5G/B5G networks OnlineADS: An online active learning approach to intrusion detection for WSNs Dynamic reliable SFC orchestration for SDN-NFV enabled networks Efficient level-3 secure certificateless signature against malicious KGC attacks for IoT An improved dynamic anonymous authentication and key agreement scheme for resource constrained IoT devices
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1