

浏览全部资源
扫码关注微信
1.之江实验室,浙江杭州 310000
2.浙江工商大学,浙江杭州 310000
Received:03 January 2025,
Revised:2025-04-23,
Published:25 May 2025
移动端阅览
凃化清, 廖君虎, 朱俊, 等. 多模态网络环境下网络模态共存与优化部署方法[J]. 电子学报, 2025, 53(05): 1650-1660.
TU Hua-qing, LIAO Jun-hu, ZHU Jun, et al. Network Modal Coexistence and Optimal Deployment Method in Polymorphic Network Environment[J]. Acta Electronica Sinica, 2025, 53(05): 1650-1660.
凃化清, 廖君虎, 朱俊, 等. 多模态网络环境下网络模态共存与优化部署方法[J]. 电子学报, 2025, 53(05): 1650-1660. DOI:10.12263/DZXB.20250015
TU Hua-qing, LIAO Jun-hu, ZHU Jun, et al. Network Modal Coexistence and Optimal Deployment Method in Polymorphic Network Environment[J]. Acta Electronica Sinica, 2025, 53(05): 1650-1660. DOI:10.12263/DZXB.20250015
为解决多模态网络数据平面资源分配和业务流量用网需求的适配问题,文章提出了一种多模态网络环境下网络模态共存与优化部署方法.该方法充分考虑多模态网元资源约束、链路资源约束、流量转发延迟等关键约束以保障用户服务质量,并通过联合路由优化的方法确保每种网络模态的连通性.由于直接建模后的网络模态部署问题是非凸问题,难以直接求解,因此文章将原问题等价转换为0-1整数线性规划问题,并在此基础上设计基于随机舍入的网络模态部署与路由选择算法.理论分析表明,该算法具有
<math id="M1"><mi>Ο</mi><mo stretchy="false">(</mo><mi mathvariant="normal">l</mi><mi mathvariant="normal">o</mi><mi mathvariant="normal">g</mi><mtext> </mtext><mi>n</mi><mo stretchy="false">)</mo></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900479&type=
2.96333337
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900480&type=
9.65200043
的近似比性能,其中
<math id="M2"><mi>n</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900481&type=
2.28600001
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900482&type=
1.60866666
是网络中多模态网元的数量.仿真实验结果表明,所提方案可实现网络模态在数据平面的高效部署.在满足网络资源、流量转发延迟约束的前提下,通过3~6种不同数量网络模态分别在8 000条流的情况下进行实验,结果表明,所提算法相较于对比算法可有效降低13%~22%的链路负载.
To solve the problem of adapting the resource allocation in the data plane of polymorphic network to the network usage requirements of service traffic
this paper proposes a method for the coexistence and optimized deployment of network modals in a polymorphic network environment. This method considers key constraints such as polymorphic network element resource constraints
link resource constraints
and traffic forwarding delay to ensure the quality of user services. It also ensures the connectivity of each network mode through joint routing optimization. Since the direct modeling of the network modal deployment problem is a non-convex problem and difficult to solve directly
this paper transforms the original problem into a 0-1 integer linear programming problem. Based on this
a network modal deployment and routing selection algorithm based on stochastic rounding is designed. Theoretical analysis shows that this algorithm has an approximation ratio of
<math id="M3"><mi>Ο</mi><mo stretchy="false">(</mo><mi mathvariant="normal">l</mi><mi mathvariant="normal">o</mi><mi mathvariant="normal">g</mi><mtext> </mtext><mi>n</mi><mo stretchy="false">)</mo></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900483&type=
2.96333337
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900485&type=
9.65200043
where
<math id="M4"><mi>n</mi></math>
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900511&type=
2.28600001
https://html.publish.founderss.cn/rc-pub/api/common/picture?pictureId=87900512&type=
1.60866666
is the number of polymorphic network elements in the network. Simulation results demonstrate that the proposed approach can achieve efficient deployment of network modals in the data plane
effectively reducing link load by 13% to 22% while satisfying network resource and traffic forwarding delay constraints.
MISHRA S , JAIN V K , GYODA K , et al . An efficient content replacement policy to retain essential content in information-centric networking based Internet of Things network [J ] . Ad Hoc Networks , 2024 , 155 : 103389 .
RAHMAN A , HASAN K , KUNDU D , et al . On the ICN-IoT with federated learning integration of communication: Concepts, security-privacy issues, applications, and future perspectives [J ] . Future Generation Computer Systems , 2023 , 138 : 61 - 88 .
RAYCHAUDHURI D , NAGARAJA K , VENKATARAMANI A . MobilityFirst [J ] . ACM SIGMOBILE Mobile Computing and Communications Review , 2012 , 16 ( 3 ): 2 - 13 .
崔子熙 , 田乐 , 崔鹏帅 , 等 . 支持增量式编程的多模态网络环境 [J ] . 电子学报 , 2024 , 52 ( 4 ): 1230 - 1238 .
CUI Z X , TIAN L , CUI P S , et al . Enabling incremental programming in PINet environment [J ] . Acta Electronica Sinica , 2024 , 52 ( 4 ): 1230 - 1238 . (in Chinese)
胡宇翔 , 崔鹏帅 , 田乐 , 等 . 多模态网络环境研究进展 [J ] . 中国基础科学 , 2024 , 26 ( 3 ): 1 - 8 .
HU Y X , CUI P S , TIAN L , et al . Research progress on polymorphic network environment [J ] . China Basic Science , 2024 , 26 ( 3 ): 1 - 8 . (in Chinese)
WU J X , LI J F , SUN P H , et al . Theoretical framework for a polymorphic network environment [J ] . Engineering , 2024 , 10 ( 8 ): 222 - 234 .
李子勇 , 胡宇翔 , 田乐 , 等 . 支持多个网络功能共存的可编程数据平面虚拟化 [J ] . 电子与信息学报 , 2023 , 45 ( 10 ): 3667 - 3675 .
LI Z Y , HU Y X , TIAN L , et al . Virtualization of the programmable data plane for supporting coexistence of multiple network functions [J ] . Journal of Electronics & Information Technology , 2023 , 45 ( 10 ): 3667 - 3675 . (in Chinese)
ZHANG C , BI J , ZHOU Y , et al . HyperVDP: High-performance virtualization of the programmable data plane [J ] . IEEE Journal on Selected Areas in Communications , 2019 , 37 ( 3 ): 556 - 569 .
李炯 , 胡宇翔 , 崔鹏帅 , 等 . 面向多模态网络环境的网络模态增量式部署机制研究 [J ] . 电信科学 , 2023 , 39 ( 6 ): 33 - 43 .
LI J , HU Y X , CUI P S , et al . Research on incremental deployment mechanism of network modality for polymorphic network environment [J ] . Telecommunications Science , 2023 , 39 ( 6 ): 33 - 43 . (in Chinese)
ZHOU Y , BI J . ClickP4: Towards modular programming of P4 [C ] // Proceedings of the SIGCOMM Posters and Demos . New York : ACM , 2017 : 100 - 102 .
STOYANOV R , ZILBERMAN N . MTPSA: Multi-tenant programmable switches [C ] // Proceedings of the 3rd P4 Workshop in Europe . New York : ACM , 2020 : 43 - 48 .
胡宇翔 , 崔子熙 , 李子勇 , 等 . 基于领域专用软硬件协同的多模态网络环境构造技术 [J ] . 通信学报 , 2022 , 43 ( 4 ): 3 - 13 .
HU Y X , CUI Z X , LI Z Y , et al . Construction technologies of polymorphic network environment based on codesign of domain-specific software/hardware [J ] . Journal on Communications , 2022 , 43 ( 4 ): 3 - 13 . (in Chinese)
董永吉 , 胡宇翔 , 崔鹏帅 . 存转算一体的多模态网络共性平台技术研究 [J ] . 中兴通讯技术 , 2022 , 28 ( 1 ): 16 - 20, 74 .
DONG Y J , HU Y X , CUI P S . PINet data plane plaform technology for storage, forwarding and computing integration [J ] . ZTE Technology Journal , 2022 , 28 ( 1 ): 16 - 20, 74 . (in Chinese)
CAI T , CHEN W H , ZHANG J T , et al . SmartChain: A dynamic and self-adaptive sharding framework for IoT blockchain [J ] . IEEE Transactions on Services Computing , 2024 , 17 ( 2 ): 674 - 688 .
SCANO D , GIORGETTI A , SGAMBELLURI A , et al . Hierarchical control of SONiC-based packet-optical nodes encompassing coherent pluggable modules [C ] // 2021 European Conference on Optical Communication (ECOC) . IEEE , 2021 : 1 - 3 .
CONNOR O B , GHAFFARKHAH A , PUDELKO M , et al . Enabling the era of next generation SDN [EB/OL ] . ( 2021-12-10 )[ 2025-04-27 ] . https://opennetworking.org/stratum https://opennetworking.org/stratum .
YUAN S Z , TAN X B , WU J S , et al . A universal architecture and collaborative approach for polymorphic smart network nodes [C ] // 2023 International Conference on Ubiquitous Communication (Ucom) . Piscataway : IEEE , 2023 : 426 - 431 .
AKYOL OZER E , SARAC T . MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints [J ] . TOP , 2019 , 27 ( 1 ): 94 - 124 .
ACHTERBERG T . What’s new in Gurobi 9.0 [J ] . Webinar Talk Url , 2019 , 5 ( 9 ): 97 - 113 .
KIA R , SHAHNAZARI-SHAHREZAEI P , ZABIHI S . Solving a multi-objective mathematical model for a Multi-Skilled Project Scheduling Problem by CPLEX solver [C ] // 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) . Piscataway : IEEE , 2016 : 1220 - 1224 .
DIKSTEIN Y , HOPKINS M . Chernoff bounds and reverse hypercontractivity on HDX [C ] // 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) . Piscataway : IEEE , 2024 : 870 - 919 .
SENETA E . On the history of the strong law of large numbers and boole’s inequality [J ] . Historia Mathematica , 1992 , 19 ( 1 ): 24 - 39 .
DING W L , XU H . Dynamic learning-based link restoration in traffic engineering with archie [C ] // IEEE INFOCOM 2024 - IEEE Conference on Computer Communications . Piscataway : IEEE , 2024 : 2428 - 2437 .
PIÓRO M , SZENTESI Á , HARMATOS J , et al . On open shortest path first related network optimisation problems [J ] . Performance Evaluation , 2002 , 48 ( 1/2/3/4 ): 201 - 223 .
HOPPS C E . Analysis of an equal-cost multi-path algorithm [J ] . RFC , 2000 , 2992 : 1 - 8 .
TU H Q , ZHAO G M , XU H L , et al . A robustness-aware real-time SFC routing update scheme in multi-tenant clouds [J ] . IEEE/ACM Transactions on Networking , 2022 , 30 ( 3 ): 1230 - 1244 .
0
Views
11
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621