Protection Strategies for Dynamic VNF Placement and Service Chaining

被引:2
|
作者
Askari, Leila [1 ]
Tamizi, Mohammadhassan [1 ]
Ayoub, Omran [1 ]
Tornatore, Massimo [1 ]
机构
[1] Politecn Milan, Dept Elect Informat & Bioengn, Milan, Italy
来源
30TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN 2021) | 2021年
关键词
NFV; Protection for Dynamic Service Chaining;
D O I
10.1109/ICCCN52240.2021.9522159
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Network Function Virtualization (NFV) provides a major shift in the provisioning of telecommunication services by decoupling network functions from dedicated hardware devices. Such decoupling enables operational expenditure (OpEx) and capital expenditure (CapEx) reduction and allows to increase service agility. NFV relies on Virtualized Network Functions (VNFs) and, by placing VNFs on NFV-capable network nodes, and by chaining them in a specific order while guaranteeing a given end to end latency, Service Chains (SCs) are formed to provide a specific service. To achieve great flexibility in resource assignment in the network and decrease further OpEx, it is important to consider provisioning of SCs in a dynamic scenario in which traffic evolves in the network. In this study we observe that, when deploying a SC in a situation where SC requests arrive dynamically in the network, it is important to consider protection techniques to withstand failures of the network components supporting the SC. Different protection approaches can be followed to protect the SC against failures. We consider three different protection strategies, namely, Virtual-Node protection, Virtual- Link protection and End-to-End protection, which provide protection against single virtual node (hosting a VNF), single virtual link (connecting two consequent VNF of SC together) and single virtual node/virtual link failure for dynamic VNF placement. For each of them, we provide a heuristic approach for dynamic provisioning of the SC with protection. In our simulative numerical results over realistic network and SC settings, we compare the three strategies and show that End-to-End protection and Virtual-Node protection have both high blocking, however, End-to-End is able to satisfy the latency requirement of more SCs with respect to virtual node protection. Of the three protection strategies, Virtual-Link protection requires less network and computational resources and achieves lower SC latency violation.
引用
收藏
页数:9
相关论文
共 50 条
  • [21] A Knapsack-based Optimization Algorithm for VNF Placement and Chaining Problem
    Ikhelef, Issam Abdeldjalil
    Saidi, Mohand Yazid
    Li, Shuopeng
    Chen, Ken
    PROCEEDINGS OF THE 2022 47TH IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS (LCN 2022), 2022, : 430 - 437
  • [22] SET: a Simple and Effective Technique to improve cost efficiency of VNF placement and chaining algorithms for network service provisioning
    Ahvar, Shohreh
    Mirzaei, Mohammad M.
    Leguay, Jeremie
    Ahvar, Ehsan
    Medhat, Ahmed M.
    Crespi, Noel
    Glitho, Roch
    2018 4TH IEEE CONFERENCE ON NETWORK SOFTWARIZATION AND WORKSHOPS (NETSOFT), 2018, : 293 - 297
  • [23] Traffic-Aware and Energy-Efficient vNF Placement for Service Chaining: Joint Sampling and Matching Approach
    Pham, Chuan
    Tran, Nguyen H.
    Ren, Shaolei
    Saad, Walid
    Hong, Choong Seon
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2020, 13 (01) : 172 - 185
  • [24] Deep Reinforcement Learning for VNF Placement and Chaining of Cloud Network Services
    Khemili, Wided
    Hajlaoui, Jalel Eddine
    Saidi, Mohand Yazid
    Omri, Mohamed Nazih
    Chen, Ken
    ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 3, AINA 2024, 2024, 201 : 84 - 96
  • [25] CCVP: Cost-efficient Centrality-based VNF Placement and Chaining Algorithm for Network Service Provisioning
    Ahvar, Shohreh
    Hnin Pann Phyu
    Buddhacharya, Sachham Man
    Ahvar, Ehsan
    Crespi, Noel
    Glitho, Roch
    2017 IEEE CONFERENCE ON NETWORK SOFTWARIZATION (IEEE NETSOFT), 2017,
  • [26] On Performance VNF Load Prediction Models in Service Function Chaining
    Cho, Yunyoung
    Jang, Seokwon
    Pack, Sangheon
    11TH INTERNATIONAL CONFERENCE ON ICT CONVERGENCE: DATA, NETWORK, AND AI IN THE AGE OF UNTACT (ICTC 2020), 2020, : 344 - 346
  • [27] Placement of dynamic service function chains in partially VNF-enabled networks
    Afsaneh Allahvirdi
    Saleh Yousefi
    Asghar Asgharian Sardroud
    Telecommunication Systems, 2022, 81 : 225 - 240
  • [28] Placement of dynamic service function chains in partially VNF-enabled networks
    Allahvirdi, Afsaneh
    Yousefi, Saleh
    Sardroud, Asghar Asgharian
    TELECOMMUNICATION SYSTEMS, 2022, 81 (02) : 225 - 240
  • [29] A hybrid optimization-Machine Learning approach for the VNF placement and chaining problem
    Araujo, Samuel M. A.
    de Souza, Fernanda S. H.
    Mateus, Geraldo R.
    COMPUTER NETWORKS, 2021, 199
  • [30] Holu: Power-Aware and Delay-Constrained VNF Placement and Chaining
    Varasteh, Amir
    Madiwalar, Basavaraj
    Van Bemten, Amaury
    Kellerer, Wolfgang
    Mas-Machuca, Carmen
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2021, 18 (02): : 1524 - 1539