Dynamic VNF Placement, Resource Allocation and Traffic Routing in 5G

Auteurs : Morteza Golkarifard, Carla Fabiana Chiasserini, Francesco Malandrino, Ali Movaghar

Computer Networks, 2021
Soumis à arXiv le 18 Fév. 2021
Résumé scientifique

5G networks are going to support a variety of vertical services, with a diverse set of key performance indicators (KPIs), by using enabling technologies such as software-defined networking and network function virtualization. It is the responsibility of the network operator to efficiently allocate the available resources to the service requests in such a way to honor KPI requirements, while accounting for the limited quantity of available resources and their cost. A critical challenge is that requests may be highly varying over time, requiring a solution that accounts for their dynamic generation and termination. With this motivation, we seek to make joint decisions for request admission, resource activation, VNF placement, resource allocation, and traffic routing. We do so by considering real-world aspects such as the setup times of virtual machines, with the goal of maximizing the mobile network operator profit. To this end, first, we formulate a one-shot optimization problem which can attain the optimum solution for small size problems given the complete knowledge of arrival and departure times of requests over the entire system lifespan. We then propose an efficient and practical heuristic solution that only requires this knowledge for the next time period and works for realistically-sized scenarios. Finally, we evaluate the performance of these solutions using real-world services and large-scale network topologies. {Results demonstrate that our heuristic solution performs better than a state-of-the-art online approach and close to the optimum.

Les articles autour de lui, par date et par proximité

Plus haut, c’est plus proche de cet article ; à gauche, c’est plus ancien. Les traits relient les articles proches entre eux : les groupes de traits sont des sous-thèmes. Sélectionnez un point pour voir pourquoi il est là. Retour au résumé de cet article

Comment lire cette carte ? Guide illustré

Les articles les plus proches Les travaux antérieurs sur lesquels il s’appuie Les articles qui le citent

Les articles autour de celui-ci

Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.

Les articles les plus proches

  1. Très proche Cite cet article
    Energy-efficient and Traffic-aware VNF Placement for Vertical Services in 5G Networks
    Yi Yue, Wen-Cong Yang, Xiao Liang et al. · 2022 · International Conference on Trust, Security and Privacy in Computing and Communications · cité 1 fois · Pas encore résumé
    Résumé scientifique

    Enabled by Network Function Virtualization (NFV) and Software-Defined Networks (SDN), 5G networks benefit various industries (the so-called verticals) by supporting their technological and business needs flexibly and swiftly. However, a critical challenge is making high-quality joint optimal decisions for vertical demand mapping, involving Virtual Network Function (VNF) placement and optimization of network resources. In particular, to devise VNF placement schemes, network operators need to consider different objectives, such as minimizing operational costs or network latency, which are optimization objectives traditionally addressed separately. This paper studies the VNF placement for servi…

  2. Très proche Cité par cet article Utilisé en profondeur par cet article Une méthode qu’il utilise
    VNF Placement and Resource Allocation for the Support of Vertical Services in 5G Networks
    S. Agarwal, F. Malandrino, C. Chiasserini et al. · 2018 · IEEE/ACM Transactions on Networking · cité 126 fois · Pas encore résumé
    Résumé scientifique

    One of the main goals of 5G networks is to support the technological and business needs of various industries (the so-called verticals), which wish to offer to their customers a wide range of services characterized by diverse performance requirements. In this context, a critical challenge lies in mapping in an automated manner the requirements of verticals into decisions concerning the network infrastructure, including VNF placement, resource assignment, and traffic routing. In this paper, we seek to make such decisions jointly, accounting for their mutual interaction, efficiently. To this end, we formulate a queuing-based model and use it at the network orchestrator to optimally match the v…

  3. Très proche
    Online algorithm for migration aware Virtualized Network Function placing and routing in dynamic 5G networks
    Yanghao Xie, Sheng Wang, Binbin Wang et al. · 2021 · Comput. Networks · cité 8 fois · Pas encore résumé
    Résumé scientifique

    Abstract The goal of Network Function Virtualization (NFV) is to build agile and service-aware networks by building a new paradigm of provisioning network services where physical network functions are deployed as Virtualized Network Functions (VNFs). Due to the advantages of NFV, 5G networks have adopted NFV as one of its key enabling technologies. One of the most important challenges for realizing NFV-enable 5G Networks is VNF placing and routing. However, most existing studies neglected flow rate fluctuation of service requests, which could cause service migration and fluctuation of queues (buffers) in the networks. In this paper, we study the cost-minimizing problem of VNF placing and rou…

  4. Très proche
    Dynamic Network Slicing and Resource Allocation for 5G-and-Beyond Networks
    A. Abdellatif, Amr Mohamed, A. Erbad et al. · 2022 · IEEE Wireless Communications and Networking Conference · cité 23 fois · Pas encore résumé
    Résumé scientifique

    5G networks are designed not only to transport data, but also to process them while supporting a vast number of services with different key Performance Indicators (KPIs). Network virtualization has emerged to enable this vision, however it calls for designing efficient computing and network resource allocation schemes to support diverse services, while jointly considering all KPIs associated with these services. Thus, this paper proposes a dynamic network slicing and resource allocation framework that aims at maintaining high-level network operational performance, while fulfilling diverse services’ requirements and KPIs, e.g., availability, reliability, and data quality. Differently from the…

  5. Très proche
    Getting the Most Out of Your VNFs: Flexible Assignment of Service Priorities in 5G
    F. Malandrino, C. Chiasserini · 2019 · IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks · cité 9 fois · Pas encore résumé
    Résumé scientifique

    Through their computational and forwarding capabilities, 5G networks can support multiple vertical services. Such services may include several common virtual (network)functions (VNFs), which could be shared to increase resource efficiency. In this paper, we focus on the seldom studied VNF-sharing problem, and decide (i)whether sharing a VNF instance is possible/beneficial or not, (ii)how to scale virtual machines hosting the VNFs to share, and (iii)the priorities of the different services sharing the same VNF. These decisions are made with the aim to minimize the mobile operator's costs while meeting the verticals' performance requirements. Importantly, we show that the aforementioned priori…

  6. Très proche
    Offline Joint Network and Computational Resource Allocation for Energy-Efficient 5G and beyond Networks
    M. Gatzianas, A. Mesodiakaki, G. Kalfas et al. · 2021 · Applied Sciences · cité 11 fois · Pas encore résumé
    Résumé scientifique

    In order to cope with the ever-increasing traffic demands and stringent latency constraints, next generation, i.e., sixth generation (6G) networks, are expected to leverage Network Function Virtualization (NFV) as an enabler for enhanced network flexibility. In such a setup, in addition to the traditional problems of user association and traffic routing, Virtual Network Function (VNF) placement needs to be jointly considered. To that end, in this paper, we focus on the joint network and computational resource allocation, targeting low network power consumption while satisfying the Service Function Chain (SFC), throughput, and delay requirements. Unlike the State-of-the-Art (SoA), we also tak…

  7. Très proche
    Energy-efficient Joint Computational and Network Resource Planning in Beyond 5G Networks
    M. Gatzianas, A. Mesodiakaki, G. Kalfas et al. · 2021 · Global Communications Conference · cité 5 fois · Pas encore résumé
    Résumé scientifique

    Network Function Virtualization (NFV) is expected to be a crucial enabler of Beyond 5G (B5G) networks, supporting new services with stringent requirements, while offering high flexibility and configurability. In this paper, we consider the joint problem of Virtual Network Function (VNF) placement alongside computational and communication resource allocation in a mobile network to minimize total power expenditure while satisfying the Service Function Chain (SFC), throughput and delay requirements. We explicitly account for the Access Network (AN) and formulate a general Mixed Integer Linear Program (MILP). Due to the high complexity of the latter, we propose an efficient heuristic, which is s…

  8. Très proche Cite cet article
    Dynamic VNF Placement in 5G Edge Nodes
    D. Harris, D. Raz · 2022 · IEEE Conference on Network Softwarization · cité 11 fois · Pas encore résumé
    Résumé scientifique

    The ongoing transition into 5G networks is enabled in part by the combination of NFV (Network Function Virtualization) and MEC (Multi-access Edge Computing), two promising paradigms that allow executing ultra-low-latency network services on edge nodes, physically closer to the clients. However, orchestrating this complex distributed environment and especially provisioning services in a timely manner, in order to address the dynamic workload, remained a big challenge. In this paper we address this challenge and study ways to dynamically place network functions at edge nodes, across the network, in a way that maximizes client satisfaction, we measure this satisfaction by the number of clients …

Les travaux antérieurs sur lesquels il s’appuie

  1. Proche Une méthode qu’il utilise
    Maximizing Throughput of Delay-Sensitive NFV-Enabled Request Admissions via Virtualized Network Function Placement
    Meitian Huang, Wei-Fa Liang, Yu Ma et al. · 2019 · IEEE Transactions on Cloud Computing · cité 39 fois · Pas encore résumé
    Résumé scientifique

    Network Function Virtualization (NFV) has attracted significant attention from both industry and academia as an important paradigm change in network service provisioning. Most existing studies on admissions of NFV-enabled requests focused on deploying dedicated Virtualized Network Function (VNF) instances to serve each individual request without exploring the sharing of VNF instances among multiple user requests. However, with ever-growing demands of user services, exclusive usages of VNF instances in most networks drastically degrade the network performance and largely under-utilize the VNF instance resources. In this paper, we jointly explore two different VNF instance scaling techniques, …

  2. Proche Une méthode qu’il utilise
    Dynamic Network Function Instance Scaling Based on Traffic Forecasting and VNF Placement in Operator Data Centers
    Hong Tang, Da-shui Zhou, Duan Chen · 2019 · IEEE Transactions on Parallel and Distributed Systems · cité 90 fois · Pas encore résumé
    Résumé scientifique

    Traffic in operator networks is time varying. Conventional network functions implemented by black-boxes should satisfy the peak traffic requirement, and hence result in low resource utilization. Thanks to the emergence of Virtual Network Function (VNF), which is realized by running networking software on Virtual Machines (VMs), the operator can dynamically scale in or scale out the VNF instances and hence save the required resources. In this paper, we introduce how the dynamic VNF scaling is implemented in practical operator Data Center Networks (DCNs). First, we analyze the traffic characteristics in our operator networks, and introduce how the VNFs are organized in a common operator DCN. B…

  3. Proche
    Joint Placement and Allocation of Virtual Network Functions with Budget and Capacity Constraints
    G. Sallam, Bo Ji · 2019 · IEEE Conference on Computer Communications · cité 48 fois · Pas encore résumé
    Résumé scientifique

    With the advent of Network Function Virtualization (NFV), network services that traditionally run on proprietary dedicated hardware can now be realized using Virtual Network Functions (VNFs) that are hosted on general-purpose commodity hardware. This new network paradigm offers a great flexibility to Internet service providers (ISPs) for efficiently operating their networks (collecting network statistics, enforcing management policies, etc However, introducing NFV requires an investment to deploy VNFs at certain network nodes (called VNF-nodes), which has to account for practical constraints such as the deployment budget and the VNF-node capacity. To that end, it is important to design a joi…

  4. Proche* Une méthode qu’il utilise
    Near optimal placement of virtual network functions
    Rami Cohen, L. Lewin-Eytan, J. Naor et al. · 2015 · IEEE Conference on Computer Communications · cité 515 fois · Pas encore résumé
  5. Proche Une méthode qu’il utilise
    Traffic-Aware and Energy-Efficient vNF Placement for Service Chaining: Joint Sampling and Matching Approach
    C. Pham, Nguyen H. Tran, Shao-Lei Ren et al. · 2020 · IEEE Transactions on Services Computing · cité 241 fois · Pas encore résumé
    Résumé scientifique

    Although network function virtualization (NFV) is a promising approach for providing elastic network functions, it faces several challenges in terms of adaptation to diverse network appliances and reduction of the capital and operational expenses of the service providers. In particular, to deploy service chains, providers must consider different objectives, such as minimizing the network latency or the operational cost, which are coupled objectives that have traditionally been addressed separately. In this paper, the problem of virtual network function (vNF) placement for service chains is studied for the purpose of energy and traffic-aware cost minimization. This problem is formulated as an…

Les articles qui le citent

  1. Très proche
    VNF and CNF Placement in 5G: Recent Advances and Future Trends
    Wissal Attaoui, Essaid Sabir, H. Elbiaze et al. · 2023 · IEEE Transactions on Network and Service Management · cité 89 fois · Pas encore résumé
    Résumé scientifique

    With the growing demand for openness, scalability, and granularity, mobile network function virtualization (NFV) has emerged as a key enabler for the most of mobile network operators. NFV decouples network functions from hardware devices. This decoupling allows network services, called Virtualized Network Functions (VNFs), to be hosted on commodity hardware which simplifies and enhances service deployment and management for providers, improves flexibility, and leads to efficient and scalable resource usage, and lower costs. The proper placement of VNFs in the hosting infrastructures is one of the main technical challenges. This placement significantly influences the network’s performance, re…

  2. Proche
    Leveraging Deep Reinforcement Learning With Attention Mechanism for Virtual Network Function Placement and Routing
    Nan He, Song Yang, Fan Li et al. · 2023 · IEEE Transactions on Parallel and Distributed Systems · cité 73 fois · Pas encore résumé
    Résumé scientifique

    The efficacy of Network Function Virtualization (NFV) depends critically on (1) where the virtual network functions (VNFs) are placed and (2) how the traffic is routed. Unfortunately, these aspects are not easily optimized, especially under time-varying network states with different QoS requirements. Given the importance of NFV, many approaches have been proposed to solve the VNF placement and Service Function Chaining (SFC) routing problem. However, those prior approaches mainly assume that the network state is static and known, disregarding dynamic network variations. To bridge that gap, we leverage Markov Decision Process (MDP) to model the dynamic network state transitions. To jointly mi…

  3. Proche
    A-DDPG: Attention Mechanism-based Deep Reinforcement Learning for NFV
    Nan He, Song Yang, Fan Li et al. · 2021 · International Workshop on Quality of Service · cité 35 fois · Pas encore résumé
    Résumé scientifique

    The efficacy of Network Function Virtualization (NFV) depends critically on (1) where the virtual network functions (VNFs) are placed and (2) how the traffic is routed. Unfortunately, these aspects are not easily optimized, especially under time-varying network states with different quality of service (QoS) requirements. Given the importance of NFV, many approaches have been proposed to solve the VNF placement and traffic routing problem. However, those prior approaches mainly assume that the state of the network is static and known, disregarding real-time network variations. To bridge that gap, in this paper, we formulate the VNF placement and traffic routing problem as a Markov Decision Pr…

  4. Proche
    Dynamic, Reconfigurable and Green Network Slice Admission Control and Resource Allocation in the O-RAN Using Model Predictive Control
    Nikolaos Fryganiotis, E. Stai, Ioannis Dimolitsas et al. · 2024 · 2024 IFIP Networking Conference (IFIP Networking) · cité 7 fois · Pas encore résumé
    Résumé scientifique

    In the context of 5G, virtualization has transformed Radio Access Network (RAN) architectures, enabling efficient resource utilization, flexibility and scalability of RAN deployments and operations. Within this paradigm, network slicing has emerged as a pivotal technique, enabling the creation of tailored virtual network instances to meet diverse service requirements. This study performs joint slice request admission control and optimal Virtual Network Functions (VNFs) placement in O-RAN-enabled networks, subject to infrastructure and Quality-of-Service constraints. Contrary to existing schemes, emphasis is placed on two not yet deeply studied directions. The first is about handling future u…

  5. Proche
    Dynamic and efficient resource allocation for 5G end‐to‐end network slicing: A multi‐agent deep reinforcement learning approach
    Muhammad Asim Ejaz, Guowei Wu, Tahir Iqbal · 2024 · International Journal of Communication Systems · cité 10 fois · Pas encore résumé
    Résumé scientifique

    The rapid evolution of user equipment (UE) and 5G networks drives significant transformations, bringing technology closer to end‐users. Managing resources in densely crowded areas such as airports, train stations, and bus terminals poses challenges due to diverse user demands. Integrating mobile edge computing (MEC) and network function virtualization (NFV) becomes vital when the service provider's (SP) primary goal is maximizing profitability while maintaining service level agreement (SLA). Considering these challenges, our study addresses an online resource allocation problem in an MEC network where computing resources are limited, and the SP aims to boost profit by securely admitting more…

Comment ces articles sont-ils trouvés ?

Nous comparons le titre et le résumé de cet article avec ceux de tous les articles résumés sur ce site, et avec les articles que Semantic Scholar recommande, ceux qu’il cite et ceux qui le citent (pour un article très cité, ses citations les plus récentes et, depuis OpenAlex, les plus citées). Parmi les travaux antérieurs et les suites, les articles qui s’utilisent en profondeur, une méthode qu’il utilise et les suites très citées remontent un peu. Les niveaux (très proche, proche, apparenté) viennent de la similarité des textes, pas d’un jugement de qualité ; * signale un article sans résumé, comparé par son titre. La phrase sous un article est écrite par une IA à partir des deux résumés : vérifiez-la dans les articles. Un article jugé hors sujet par trois lecteurs quitte la liste.

Mis à jour le 4 novembre 2026.

Le guide illustré des articles autour d’un article