下一代多域物联网网络中基于GAI的资源和QoE感知服务布局

IF 7 1区 计算机科学 Q1 TELECOMMUNICATIONS
Chuangchuang Zhang;Qiang He;Fuliang Li;Xingwei Wang;Sahil Garg;M. Shamim Hossain;Zhu Han;Wei Yuan
{"title":"下一代多域物联网网络中基于GAI的资源和QoE感知服务布局","authors":"Chuangchuang Zhang;Qiang He;Fuliang Li;Xingwei Wang;Sahil Garg;M. Shamim Hossain;Zhu Han;Wei Yuan","doi":"10.1109/TCCN.2025.3540256","DOIUrl":null,"url":null,"abstract":"Network Function Virtualization (NFV) has recently emerged as a highly cost-effective paradigm for flexibly provisioning services in next-generation Internet of Things (IoT) networks, by introducing Service Function Chain (SFC) technology. However, the rapid expansion of network scales and increasing diversification of service requirements in recent years pose significant challenges to ensuring the Quality of Experience (QoE) of users in Next-generation Multi-domain IoT (NMIoT) networks. The effective deployment of SFCs in NMIoT networks to satisfy diversified resource demands while enhancing QoE of users is crucial. The recent breakthroughs in Generative Artificial Intelligence (GAI) technologies bring a new opportunity to deliver customized services and guarantee enhanced service quality in NMIoT networks. To tackle the challenges, in this paper, we investigate the problem of Resource and QoE aware SFC Placement (RQSP) in NMIoT networks. Firstly, we formulate the RQSP problem as a mixed integer linear programming model, taking into account resource demands and Quality of Service (QoS) constraints, aiming to minimize the service cost, which is composed of resource consumption cost, cross-domain operational cost and penalty cost for unsuccessful placement. Then, we prove that the RQSP problem is NP-hard. To solve it, we incorporate GAI technology to devise a novel Generative genetic Algorithm based heuristic SFC Placement (GAP) method. Furthermore, we devise a greedy strategy based population initialization mechanism as well as an elitist and roulette wheel joint selection strategy, to speed up algorithm convergence and reduce runtime overhead. Finally, simulation results demonstrate that compared to benchmark algorithms, the proposed GAP algorithm can achieve better performances on service acceptance ratio, service cost, server utilization and average service delay.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"11 2","pages":"873-885"},"PeriodicalIF":7.0000,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GAI-Based Resource and QoE Aware Service Placement in Next-Generation Multi-Domain IoT Networks\",\"authors\":\"Chuangchuang Zhang;Qiang He;Fuliang Li;Xingwei Wang;Sahil Garg;M. Shamim Hossain;Zhu Han;Wei Yuan\",\"doi\":\"10.1109/TCCN.2025.3540256\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network Function Virtualization (NFV) has recently emerged as a highly cost-effective paradigm for flexibly provisioning services in next-generation Internet of Things (IoT) networks, by introducing Service Function Chain (SFC) technology. However, the rapid expansion of network scales and increasing diversification of service requirements in recent years pose significant challenges to ensuring the Quality of Experience (QoE) of users in Next-generation Multi-domain IoT (NMIoT) networks. The effective deployment of SFCs in NMIoT networks to satisfy diversified resource demands while enhancing QoE of users is crucial. The recent breakthroughs in Generative Artificial Intelligence (GAI) technologies bring a new opportunity to deliver customized services and guarantee enhanced service quality in NMIoT networks. To tackle the challenges, in this paper, we investigate the problem of Resource and QoE aware SFC Placement (RQSP) in NMIoT networks. Firstly, we formulate the RQSP problem as a mixed integer linear programming model, taking into account resource demands and Quality of Service (QoS) constraints, aiming to minimize the service cost, which is composed of resource consumption cost, cross-domain operational cost and penalty cost for unsuccessful placement. Then, we prove that the RQSP problem is NP-hard. To solve it, we incorporate GAI technology to devise a novel Generative genetic Algorithm based heuristic SFC Placement (GAP) method. Furthermore, we devise a greedy strategy based population initialization mechanism as well as an elitist and roulette wheel joint selection strategy, to speed up algorithm convergence and reduce runtime overhead. Finally, simulation results demonstrate that compared to benchmark algorithms, the proposed GAP algorithm can achieve better performances on service acceptance ratio, service cost, server utilization and average service delay.\",\"PeriodicalId\":13069,\"journal\":{\"name\":\"IEEE Transactions on Cognitive Communications and Networking\",\"volume\":\"11 2\",\"pages\":\"873-885\"},\"PeriodicalIF\":7.0000,\"publicationDate\":\"2025-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Cognitive Communications and Networking\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10879400/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"TELECOMMUNICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cognitive Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10879400/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

网络功能虚拟化(NFV)最近通过引入业务功能链(SFC)技术,成为在下一代物联网(IoT)网络中灵活提供服务的高成本效益范例。然而,近年来网络规模的快速扩张和业务需求的日益多样化,对下一代多域物联网(NMIoT)网络中用户的体验质量(QoE)提出了重大挑战。在NMIoT网络中有效部署SFCs以满足多样化的资源需求,同时提高用户的QoE至关重要。生成式人工智能(GAI)技术的最新突破为NMIoT网络提供定制服务和保证提高服务质量带来了新的机遇。为了应对这些挑战,本文研究了NMIoT网络中资源和QoE感知的SFC放置(RQSP)问题。首先,考虑资源需求和服务质量(QoS)约束,将RQSP问题表述为一个混合整数线性规划模型,以最小化服务成本为目标,该服务成本由资源消耗成本、跨域运行成本和不成功放置的惩罚成本组成。然后,我们证明了RQSP问题是np困难的。为了解决这个问题,我们结合GAI技术设计了一种新的基于生成遗传算法的启发式SFC定位方法。此外,我们设计了一种基于贪婪策略的种群初始化机制以及精英和轮盘赌轮盘的联合选择策略,以加快算法的收敛速度和减少运行时开销。最后,仿真结果表明,与基准算法相比,本文提出的GAP算法在服务接受率、服务成本、服务器利用率和平均服务延迟方面具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GAI-Based Resource and QoE Aware Service Placement in Next-Generation Multi-Domain IoT Networks
Network Function Virtualization (NFV) has recently emerged as a highly cost-effective paradigm for flexibly provisioning services in next-generation Internet of Things (IoT) networks, by introducing Service Function Chain (SFC) technology. However, the rapid expansion of network scales and increasing diversification of service requirements in recent years pose significant challenges to ensuring the Quality of Experience (QoE) of users in Next-generation Multi-domain IoT (NMIoT) networks. The effective deployment of SFCs in NMIoT networks to satisfy diversified resource demands while enhancing QoE of users is crucial. The recent breakthroughs in Generative Artificial Intelligence (GAI) technologies bring a new opportunity to deliver customized services and guarantee enhanced service quality in NMIoT networks. To tackle the challenges, in this paper, we investigate the problem of Resource and QoE aware SFC Placement (RQSP) in NMIoT networks. Firstly, we formulate the RQSP problem as a mixed integer linear programming model, taking into account resource demands and Quality of Service (QoS) constraints, aiming to minimize the service cost, which is composed of resource consumption cost, cross-domain operational cost and penalty cost for unsuccessful placement. Then, we prove that the RQSP problem is NP-hard. To solve it, we incorporate GAI technology to devise a novel Generative genetic Algorithm based heuristic SFC Placement (GAP) method. Furthermore, we devise a greedy strategy based population initialization mechanism as well as an elitist and roulette wheel joint selection strategy, to speed up algorithm convergence and reduce runtime overhead. Finally, simulation results demonstrate that compared to benchmark algorithms, the proposed GAP algorithm can achieve better performances on service acceptance ratio, service cost, server utilization and average service delay.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Cognitive Communications and Networking
IEEE Transactions on Cognitive Communications and Networking Computer Science-Artificial Intelligence
CiteScore
15.50
自引率
7.00%
发文量
108
期刊介绍: The IEEE Transactions on Cognitive Communications and Networking (TCCN) aims to publish high-quality manuscripts that push the boundaries of cognitive communications and networking research. Cognitive, in this context, refers to the application of perception, learning, reasoning, memory, and adaptive approaches in communication system design. The transactions welcome submissions that explore various aspects of cognitive communications and networks, focusing on innovative and holistic approaches to complex system design. Key topics covered include architecture, protocols, cross-layer design, and cognition cycle design for cognitive networks. Additionally, research on machine learning, artificial intelligence, end-to-end and distributed intelligence, software-defined networking, cognitive radios, spectrum sharing, and security and privacy issues in cognitive networks are of interest. The publication also encourages papers addressing novel services and applications enabled by these cognitive concepts.
×
引用
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学术官方微信