Enabling Multicasting Supports for O-RAN Virtual Function Deployment in Multi-Cloud Environment

IF 5.3 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
IEEE Transactions on Cloud Computing Pub Date : 2026-07-01 Epub Date: 2026-06-05 DOI:10.1109/TCC.2026.3700889
Minh Hai Dao;Kim Khoa Nguyen
{"title":"Enabling Multicasting Supports for O-RAN Virtual Function Deployment in Multi-Cloud Environment","authors":"Minh Hai Dao;Kim Khoa Nguyen","doi":"10.1109/TCC.2026.3700889","DOIUrl":null,"url":null,"abstract":"The proliferation of multi-user applications in next-generation cellular networks sparks the need to simultaneously deploy multicast trees and provisioning services to provide efficient communication. Such a feature allows taking full advantage of the high flexibility of the Open Radio Access Networks (O-RAN) architecture and its open standards, virtualization, and multi-cloud deployment. Enabling multicasting supports in O-RAN, such as 3GPP’s 5G Multicast Broadcast Service capabilities, will unlock and improve a multitude of new O-RAN use cases. Unfortunately, such integration has not yet been clearly defined in O-RAN specifications or fully investigated in prior studies. In this paper, we jointly formulate the Multicast Service Function Chain Embedding (MSE) and O-RAN functional split optimization problems in a multi-cloud environment as an Integer Linear Programming (ILP) model. We address both single and multiple flow request scenarios and propose a Pseudo Knapsack-based heuristic algorithm with polynomial-time complexity, combining feasible search optimization and dynamic programming techniques. Experimental results show that our approach outperforms state-of-the-art baselines, approximating the optimal solution while significantly reducing computational time.","PeriodicalId":13202,"journal":{"name":"IEEE Transactions on Cloud Computing","volume":"14 3","pages":"1785-1801"},"PeriodicalIF":5.3000,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cloud Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11551990/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/6/5 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The proliferation of multi-user applications in next-generation cellular networks sparks the need to simultaneously deploy multicast trees and provisioning services to provide efficient communication. Such a feature allows taking full advantage of the high flexibility of the Open Radio Access Networks (O-RAN) architecture and its open standards, virtualization, and multi-cloud deployment. Enabling multicasting supports in O-RAN, such as 3GPP’s 5G Multicast Broadcast Service capabilities, will unlock and improve a multitude of new O-RAN use cases. Unfortunately, such integration has not yet been clearly defined in O-RAN specifications or fully investigated in prior studies. In this paper, we jointly formulate the Multicast Service Function Chain Embedding (MSE) and O-RAN functional split optimization problems in a multi-cloud environment as an Integer Linear Programming (ILP) model. We address both single and multiple flow request scenarios and propose a Pseudo Knapsack-based heuristic algorithm with polynomial-time complexity, combining feasible search optimization and dynamic programming techniques. Experimental results show that our approach outperforms state-of-the-art baselines, approximating the optimal solution while significantly reducing computational time.
为多云环境下O-RAN虚拟功能部署开启多播支持
下一代蜂窝网络中多用户应用的激增激发了同时部署多播树和预置服务以提供高效通信的需求。这种特性可以充分利用开放无线接入网络(O-RAN)架构及其开放标准、虚拟化和多云部署的高度灵活性。在O-RAN中启用多播支持,例如3GPP的5G多播广播服务功能,将解锁和改进大量新的O-RAN用例。不幸的是,这种集成尚未在O-RAN规范中明确定义或在先前的研究中充分调查。本文将多云环境下多播业务功能链嵌入(MSE)和O-RAN功能分割优化问题以整数线性规划(ILP)模型的形式表述出来。我们针对单个和多个流请求场景,提出了一种基于伪背包的多项式时间复杂度启发式算法,结合可行搜索优化和动态规划技术。实验结果表明,我们的方法优于最先进的基线,接近最优解决方案,同时显着减少计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Cloud Computing
IEEE Transactions on Cloud Computing Computer Science-Software
CiteScore
9.40
自引率
6.20%
发文量
167
期刊介绍: The IEEE Transactions on Cloud Computing (TCC) is dedicated to the multidisciplinary field of cloud computing. It is committed to the publication of articles that present innovative research ideas, application results, and case studies in cloud computing, focusing on key technical issues related to theory, algorithms, systems, applications, and performance.
×
引用
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学术官方微信
小红书