4.5 Article

Resilient Control Plane Design for Virtualized 6G Core Networks

Journal

IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT
Volume 19, Issue 3, Pages 2453-2467

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNSM.2022.3193241

Keywords

Virtual machine monitors; Control systems; Switches; 6G mobile communication; Virtualization; Optimization; Technological innovation; Software defined networks; virtual networks; resilient hypervisor placement; intelligent algorithms

Funding

  1. New National Excellence Program of the Ministry for Innovation and Technology from the National Research, Development and Innovation Fund [UNKP-21-3]
  2. KDP-2021 Program of the Ministry for Innovation and Technology from National Research, Development and Innovation Fund
  3. National Research, Development and Innovation Fund of Hungary [134604, 137698, 128062, FK_20, PD_21, K_18]
  4. Janos Bolyai Research Scholarship of the Hungarian Academy of Sciences
  5. Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) [438892507]
  6. Federal Ministry of Education and Research of Germany (BMBF) [16KISK002]

Ask authors/readers for more resources

This paper proposes a latency-aware dual hypervisor placement and control path design method, which protects against single-link and hypervisor failures and is ready for unknown future changes.
With the advent of 6G and its mission-critical and tactile Internet applications running in a virtualized environment on the same physical infrastructure, even the shortest service disruptions have severe consequences for thousands of users. Therefore, the network hypervisors, which enable such virtualization, should tolerate failures or be able to adapt to sudden traffic fluctuations instantaneously, i.e., should be well-prepared for such unpredictable environmental changes. In this paper, we propose a latency-aware dual hypervisor placement and control path design method, which protects against single-link and hypervisor failures and is ready for unknown future changes. We prove that finding the minimum number of hypervisors is not only NP-hard, but also hard to approximate. We propose optimal and heuristic algorithms to solve the problem. We conduct thorough simulations to demonstrate the efficiency of our method on real-world optical topologies, and show that with an appropriately selected representative set of possible future requests, we are not only able to approach the maximum possible acceptance ratio but also able to mitigate the need of frequent hypervisor migrations for most realistic latency constraints.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available