...
首页> 外文期刊>Network and Service Management, IEEE Transactions on >Resilient and Latency-Aware Orchestration of Network Slices Using Multi-Connectivity in MEC-Enabled 5G Networks
【24h】

Resilient and Latency-Aware Orchestration of Network Slices Using Multi-Connectivity in MEC-Enabled 5G Networks

机译:使用MEC启用的5G网络中的多连接的网络切片的弹性和延迟感知编排

获取原文
获取原文并翻译 | 示例

摘要

Network slicing and multi-access edge computing (MEC) are new paradigms which play key roles in 5G and beyond networks. In particular, network slicing allows network operators (NOs) to divide the available network resources into multiple logical network slices (NSs) for providing dedicated virtual networks tailored to the specific service/business requirements. MEC enables NOs to provide diverse ultra-low latency services for supporting the needs of different industry verticals by moving computing facilities to the network edge. An NS can be constructed/deployed by instantiating a set of virtual network functions (VNFs) on top of MEC cloud servers for provisioning diverse latency-sensitive/time-critical communication services (e.g., autonomous driving and augmented reality) on demand at a lesser cost and time. However, VNFs, MEC cloud servers, and communication links are subject to failures due to software bugs, misconfiguration, overloading, hardware faults, cyber attacks, power outage, and natural/man-made disaster. Failure of a critical network component disrupts services abruptly and leads to users' dissatisfaction, which may result in revenue loss for the NOs. In this paper, we present a novel approach based on multi-connectivity in 5G networks to tackle this problem and our proposed approach is resilient against i) failure of VNFs, ii) failure of local servers within MEC, iii) failure of communication links, and iv) failure of an entire MEC cloud facility in regional level. To this end, we formulate the problem as a binary integer programming (BIP) model in order to optimally deploy NSs with the minimum cost, and prove it is NP-hard. Since the exact optimal solution for the NP-hard problem cannot be efficiently computed in polynomial time, we propose an efficient genetic algorithm based heuristic to obtain near-optimal solution in polynomial time. By extensive simulations, we show that our proposed approach not only reduces resource wastage, but also improves throughput while providing high resiliency against failures.
机译:网络切片和多访问边缘计算(MEC)是新的范例,它在5G和超出网络中播放关键角色。特别地,网络切片允许网络运营商(NOS)将可用的网络资源划分为多个逻辑网络切片(NSS),以提供针对特定服务/业务需求的专用虚拟网络。 MEC使NOS能够通过将计算设施移动到网络边缘来支持不同行业垂直的需求来提供不同的超低延迟服务。通过在MEC云服务器顶部实例化一组虚拟网络功能(VNFS),可以在MEC云服务器顶部进行配置/部署NS,以便在较小的情况下提供各种延迟敏感/时间关键通信服务(例如,自主驾驶和增强现实)成本和时间。然而,VNFS,MEC云服务器和通信链路由于软件错误,错误配置,重载,硬件故障,网络攻击,停电以及自然/人为灾难而受到故障的影响。关键网络组件的失败突然扰乱服务,并导致用户的不满,这可能导致NOS的收入损失。在本文中,我们提出了一种基于5G网络中的多连接的新方法来解决这个问题,并且我们所提出的方法是令人困惑的反对I)VNFS,ii)MEC,III内的本地服务器的失败,即通信链路的故障, IV和IV)区域层面的整个MEC云设施的失败。为此,我们将问题作为二进制整数编程(BIP)模型,以便以最小的成本最佳地部署NSS,并证明它是NP-HARD。由于在多项式时间内不能有效地计算NP-Colliqual问题的确切最佳解决方案,因此我们提出了一种基于高效的遗传算法的启发式算法,以获得多项式时间的近最佳解决方案。通过广泛的模拟,我们表明我们所提出的方法不仅降低了资源浪费,而且还提高了吞吐量,同时提供了高弹性的失败。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号