GAMR: Revolutionizing Multi-Objective Routing in SDN Networks With Dynamic Genetic Algorithms

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Hai-Anh Tran;Cong-Son Duong;Trong-Duc Bui;Van Tong;Huynh Thi Thanh Binh
{"title":"GAMR: Revolutionizing Multi-Objective Routing in SDN Networks With Dynamic Genetic Algorithms","authors":"Hai-Anh Tran;Cong-Son Duong;Trong-Duc Bui;Van Tong;Huynh Thi Thanh Binh","doi":"10.1109/TETCI.2025.3543836","DOIUrl":null,"url":null,"abstract":"The growing complexity of modern network systems has increased the need for efficient multi-objective routing (MOR) algorithms. However, existing MOR methods face significant challenges, particularly in terms of computation time, which becomes problematic in networks with short-lived tasks where rapid decision-making is essential. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) offers a promising approach to addressing these challenges. Nevertheless, directly applying NSGA-II in dynamic network environments, where states frequently change, is impractical. This paper presents GAMR, an enhanced non-dominated sorting Genetic Algorithm II-based dynamic multi-objective QoS routing algorithm, which leverages QoS metrics for its multi-objective function. Introducing novel initialization and crossover strategies, our approach efficiently identifies optimal solutions within a brief runtime. Implemented within a Software-defined Network controller for routing, GAMR outperforms existing multi-objective algorithms, exhibiting notable improvements in performance indicators. Specifically, enhancements range from 3.4% to 22.8% on the Hypervolume metric and from 33% to 86% on the Inverted Generational Distance metric. In terms of network metrics, experimental results demonstrate significant reductions in forwarding delay and packet loss rate to 41.25 ms and 3.9%, respectively, even under challenging network configurations with only 2 servers and up to 100 requests.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"9 4","pages":"3147-3161"},"PeriodicalIF":5.3000,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10919154/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The growing complexity of modern network systems has increased the need for efficient multi-objective routing (MOR) algorithms. However, existing MOR methods face significant challenges, particularly in terms of computation time, which becomes problematic in networks with short-lived tasks where rapid decision-making is essential. The Non-dominated Sorting Genetic Algorithm II (NSGA-II) offers a promising approach to addressing these challenges. Nevertheless, directly applying NSGA-II in dynamic network environments, where states frequently change, is impractical. This paper presents GAMR, an enhanced non-dominated sorting Genetic Algorithm II-based dynamic multi-objective QoS routing algorithm, which leverages QoS metrics for its multi-objective function. Introducing novel initialization and crossover strategies, our approach efficiently identifies optimal solutions within a brief runtime. Implemented within a Software-defined Network controller for routing, GAMR outperforms existing multi-objective algorithms, exhibiting notable improvements in performance indicators. Specifically, enhancements range from 3.4% to 22.8% on the Hypervolume metric and from 33% to 86% on the Inverted Generational Distance metric. In terms of network metrics, experimental results demonstrate significant reductions in forwarding delay and packet loss rate to 41.25 ms and 3.9%, respectively, even under challenging network configurations with only 2 servers and up to 100 requests.
用动态遗传算法革新SDN网络中的多目标路由
现代网络系统日益复杂,对高效的多目标路由(MOR)算法的需求日益增加。然而,现有的MOR方法面临着巨大的挑战,特别是在计算时间方面,在具有短期任务的网络中,快速决策是必不可少的。非支配排序遗传算法II (NSGA-II)为解决这些挑战提供了一个有希望的方法。然而,在状态频繁变化的动态网络环境中,直接应用NSGA-II是不现实的。本文提出了一种基于增强非支配排序遗传算法ii的动态多目标QoS路由算法GAMR,该算法利用QoS度量实现其多目标功能。引入新的初始化和交叉策略,我们的方法在短时间内有效地识别出最优解。GAMR在用于路由的软件定义网络控制器中实现,优于现有的多目标算法,在性能指标上表现出显着的改进。具体来说,Hypervolume指标的增强幅度从3.4%到22.8%不等,而倒代距离指标的增强幅度从33%到86%不等。在网络指标方面,实验结果表明,即使在只有2台服务器和多达100个请求的挑战性网络配置下,转发延迟和丢包率也显著降低,分别为41.25 ms和3.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信