A Cybertwin-Based Trading Mechanism for Personalized Transmission Services in Cloud Native Networks

IF 5.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Wireless Communications Letters Pub Date : 2025-04-10 DOI:10.1109/LWC.2025.3559560
Zhiyong Zeng;Dandan Liang;Meng Qin;Ruijin Sun;Hui Liang;Wei Zhang
{"title":"A Cybertwin-Based Trading Mechanism for Personalized Transmission Services in Cloud Native Networks","authors":"Zhiyong Zeng;Dandan Liang;Meng Qin;Ruijin Sun;Hui Liang;Wei Zhang","doi":"10.1109/LWC.2025.3559560","DOIUrl":null,"url":null,"abstract":"The Cybertwin-based cloud native network (CCNN) with a cloud-edge-end architecture is to provide personalized user services, which includes both wireless access networks and cloud networks. However, the limited availability of resources and intense user competition present significant challenges. While prior studies have contributed to this issue, they overlook the feasibility of using resources as the trading object in a user-centric approach, particularly in wireless networks. To address this gap, this letter proposes a Cybertwin-based Personalized Transmission Service Trading Mechanism (CPTSTM), employing a one-to-many concurrent bilateral negotiation model for dynamic multi-provider trading. An optimization problem is formulated to minimize user costs by modeling the negotiation as a sequential decision-making process, accounting for individual rationality and system uncertainties. Given restricted and hybrid action spaces, we introduce a Constrained Parameterized Deep Q-learning Network (CPDQN)-based negotiation strategy integrating offer evaluation, acceptance, and bidding strategies. Simulation results confirm the feasibility of the proposed mechanism and demonstrate that the CPDQN-based algorithm outperforms existing methods in terms of trade success rate (nearly 100%) and the number of negotiation rounds (reduced by 75%) while maintaining comparable user utility across various scenarios.","PeriodicalId":13343,"journal":{"name":"IEEE Wireless Communications Letters","volume":"14 7","pages":"1949-1953"},"PeriodicalIF":5.5000,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Wireless Communications Letters","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10962189/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The Cybertwin-based cloud native network (CCNN) with a cloud-edge-end architecture is to provide personalized user services, which includes both wireless access networks and cloud networks. However, the limited availability of resources and intense user competition present significant challenges. While prior studies have contributed to this issue, they overlook the feasibility of using resources as the trading object in a user-centric approach, particularly in wireless networks. To address this gap, this letter proposes a Cybertwin-based Personalized Transmission Service Trading Mechanism (CPTSTM), employing a one-to-many concurrent bilateral negotiation model for dynamic multi-provider trading. An optimization problem is formulated to minimize user costs by modeling the negotiation as a sequential decision-making process, accounting for individual rationality and system uncertainties. Given restricted and hybrid action spaces, we introduce a Constrained Parameterized Deep Q-learning Network (CPDQN)-based negotiation strategy integrating offer evaluation, acceptance, and bidding strategies. Simulation results confirm the feasibility of the proposed mechanism and demonstrate that the CPDQN-based algorithm outperforms existing methods in terms of trade success rate (nearly 100%) and the number of negotiation rounds (reduced by 75%) while maintaining comparable user utility across various scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于赛博孪生的云原生网络个性化传输服务交易机制
CCNN (cloud native network)基于cybertwin,采用云端架构,提供个性化的用户服务,包括无线接入网和云网络。然而,有限的可用资源和激烈的用户竞争构成了重大挑战。虽然先前的研究对这个问题有所贡献,但它们忽略了以用户为中心的方法使用资源作为交易对象的可行性,特别是在无线网络中。为了解决这一差距,本文提出了一种基于赛博孪生的个性化传输服务交易机制(CPTSTM),采用一对多并发双边协商模型进行动态多提供商交易。在考虑个人理性和系统不确定性的情况下,通过将协商建模为一个连续的决策过程,制定了一个优化问题,以最小化用户成本。在有限和混合的动作空间中,我们引入了一种基于约束参数化深度q学习网络(CPDQN)的协商策略,该策略集成了报价评估、接受和投标策略。仿真结果证实了所提出机制的可行性,并证明基于cpdqn的算法在贸易成功率(接近100%)和谈判轮数(减少75%)方面优于现有方法,同时在各种场景中保持相当的用户效用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Wireless Communications Letters
IEEE Wireless Communications Letters Engineering-Electrical and Electronic Engineering
CiteScore
12.30
自引率
6.30%
发文量
481
期刊介绍: IEEE Wireless Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of wireless communications. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of wireless communication systems.
期刊最新文献
LC-OSTAR-IRS: Tunable Liquid Crystal Surfaces for High-Performance UWOC Array Splitting and Radar Beamforming for Uplink ISAC Mode With Massive MIMO On the Throughput of RSMA-ALOHA for Vortex Wave Communications Spatio-Temporal Graph Convolutional Network Based Beam Training and Tracking for XL-MIMO Systems Variational Bayesian Channel Estimation for mmWave Massive MIMO-OFDM Systems
×
引用
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