| Autor: |
Xiaojun Cao, Sumesh J. Philip, Danyang Zheng, Chengzong Peng |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
IEEE Transactions on Network and Service Management. 18:2545-2556 |
| ISSN: |
2373-7379 |
| DOI: |
10.1109/tnsm.2021.3096477 |
| Popis: |
In network function virtualization (NFV), the client’s service requests will go through multiple service functions (SFs). The instances of the required SFs will be hosted on the geographically-distributed physical nodes in physical networks (PNs). The failure of any physical nodes or virtual nodes (i.e., SF instances) will impact the delivery of services and the client’s experience. It is essential for service providers to take the node failure and network reliability into account. Different from physical node failures that will affect the PN’s topology and connectivity, virtual node failures impact the services delivery of certain clients. As a result, applying traditional backup schemes that are designed for physical node failures may not efficiently provide protection for virtual node failures. In this work, we define and mathematically formulate a new latency-bounded off-site virtual node protection (LOVNP) problem in NFV. After proving the NP-hardness of the LOVNP problem, we introduce a novel shared protection technique called pairwise node protection to effectively facilitate the protection of node failures in NFV. Then, we propose an efficient heuristic algorithm called protection centrality based pairwise node protection (PC-PNP) to optimize the LOVNP problem and prove that PC-PNP has a logarithm-approximation boundary. Our extensive simulations and analysis show that the proposed algorithm significantly outperforms the algorithms that are extended from the existing work. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
