Sustainable Virtual Network Function Placement and Traffic Routing for Green Mobile Edge Networks

被引:0
|
作者
Liang, Junbin [1 ]
Huang, Shaodong [1 ]
Qiu, Yu [2 ]
Liu, Lu [3 ]
Aziz, Furqan [3 ]
Chen, Min [2 ]
机构
[1] Guangxi Univ, Sch Comp Elect & Informat, Guangxi Key Lab Multimedia Commun & Network Techno, Nanning 530004, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou 510640, Peoples R China
[3] Univ Leicester, Dept Comp & Math Sci, Leicester LE1 7RH, England
来源
IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING | 2024年 / 8卷 / 04期
基金
中国国家自然科学基金;
关键词
Routing; Costs; Green products; Wireless communication; Batteries; Service function chaining; Reliability; Mobile edge network; network function virtualization; service function chaining; placement; routing; green energy harvesting; availability; RESOURCE-ALLOCATION; ENERGY; CLOUD; DESIGN;
D O I
10.1109/TGCN.2024.3392813
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Green Mobile Edge Networks (GMENs) are emerging networks that harvest green energy for powering mobile edge nodes, thereby reducing carbon dioxide emissions and energy costs. In GMENs, network service providers can flexibly place multiple virtual network functions (VNFs) that form a service function chain (SFC) in a specific order on geographically distributed edge nodes based on the level of harvested green energy, providing customized and sustainable network services for users. To meet the diversified availability requirements of users, backup SFCs need to be provided in addition to the primary SFC. These backup SFCs can be activated for providing uninterrupted services when the primary SFC is unavailable. However, due to the dynamic nature of wireless communication links, the uncertainty and unpredictability of green energy, and the limited resources available at edge nodes, optimizing the VNF placement and route traffic in real-time is challenging to minimize energy costs of all nodes and form expected SFCs with higher availability than user demand value. In this paper, the above problem is first formulated as an integer nonlinear programming and proven to be NP-hard. Then, it is discretized into a sequence of one-slot optimization problems to handle real-time changes in green energy and link availability. Finally, an online approximation strategy with a constant approximation ratio is proposed to solve the one-slot problems in polynomial time. This is the first study into online link availability-aware VNF placement and traffic routing problems in GMENs, motivated by sustainability concerns. The evaluation results indicate that the proposed scheme can ensure service availability while reducing the energy costs of all edge nodes and has achieved better performance when compared with other state-of-the-art methods.
引用
收藏
页码:1450 / 1465
页数:16
相关论文
共 50 条
  • [1] Delay-Aware Virtual Network Function Placement and Routing in Edge Clouds
    Yang, Song
    Li, Fan
    Trajanovski, Stojan
    Chen, Xu
    Wang, Yu
    Fu, Xiaoming
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2021, 20 (02) : 445 - 459
  • [2] Joint Virtual Network Function Placement and Flow Routing in Edge-Cloud Continuum
    Mao, Yingling
    Shang, Xiaojun
    Liu, Yu
    Yang, Yuanyuan
    IEEE TRANSACTIONS ON COMPUTERS, 2024, 73 (03) : 872 - 886
  • [3] Online Reliability-Enhanced Virtual Network Services Provisioning in Fault-Prone Mobile Edge Cloud
    Qiu, Yu
    Liang, Junbin
    Leung, Victor C. M.
    Wu, Xu
    Deng, Xia
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (09) : 7299 - 7313
  • [4] Traffic routing in stochastic network function virtualization networks
    Yang, Song
    Li, Fan
    Trajanovski, Stojan
    Fu, Xiaoming
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2020, 169
  • [5] Leveraging Deep Reinforcement Learning With Attention Mechanism for Virtual Network Function Placement and Routing
    He, Nan
    Yang, Song
    Li, Fan
    Trajanovski, Stojan
    Zhu, Liehuang
    Wang, Yu
    Fu, Xiaoming
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2023, 34 (04) : 1186 - 1201
  • [6] Virtual network function placement with bounded migrations
    Xie, Yanghao
    Wang, Sheng
    Wang, Binbin
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (03): : 2355 - 2366
  • [7] Virtual network function placement with bounded migrations
    Yanghao Xie
    Sheng Wang
    Binbin Wang
    Cluster Computing, 2021, 24 : 2355 - 2366
  • [8] Low-Latency and Reliable Virtual Network Function Placement in Edge Clouds
    Ben Haim, Roi
    Rottenstreich, Ori
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2023, 20 (03): : 2172 - 2185
  • [9] Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem
    Ljubic, Ivana
    Mouaci, Ahlam
    Perrot, Nancy
    Gourdin, Eric
    COMPUTERS & OPERATIONS RESEARCH, 2021, 130
  • [10] Multicast Routing and Virtual Network Function Placement in NFV-SDN Networks: A Genetic Algorithms Approach
    Garcia, German
    Pinto-Roa, Diego P.
    PROCEEDINGS OF THE 2022 LATIN AMERICA NETWORKING CONFERENCE, LANC 2022, 2022, : 10 - 17