论文标题
SL-EDGE:边缘网络切片
Sl-EDGE: Network Slicing at the Edge
论文作者
论文摘要
多访问边缘计算(MEC)资源的网络切片预计将是5G网络及以后成功的关键技术。设定MEC切片的主要挑战与传统的资源分配问题不同,是边缘节点取决于紧密纠缠的严格约束的网络,计算和存储资源。因此,现有切片算法几乎无法解决资源过度提供的不产生的MEC切片。本文的主要创新是SL-EDGE,这是一个统一的MEC切片框架,它允许网络操作员在边缘设备上实例化异质切片服务(例如,视频流,可电视,5G网络访问)。我们首先描述了SL-EDGE的体系结构和操作,然后证明最佳实例化关节网络切片的问题是NP-HARD。因此,我们提出了近乎最佳的算法,这些算法利用边缘节点之间的关键相似性和资源虚拟化以实例化的异质切片7.5倍,在最佳的0.25之内。我们首先通过广泛的数值分析评估算法的性能,并表明SL-EDGE实例化切片比最新的MEC切片算法更有效。此外,使用9个智能手机的24-Radio测试床上的实验结果表明,SL-EDGE曾经提供了一次高效的关节LTE连接性切片,WiFi上的视频流和FFMPEG视频转编码。
Network slicing of multi-access edge computing (MEC) resources is expected to be a pivotal technology to the success of 5G networks and beyond. The key challenge that sets MEC slicing apart from traditional resource allocation problems is that edge nodes depend on tightly-intertwined and strictly-constrained networking, computation and storage resources. Therefore, instantiating MEC slices without incurring in resource over-provisioning is hardly addressable with existing slicing algorithms. The main innovation of this paper is Sl-EDGE, a unified MEC slicing framework that allows network operators to instantiate heterogeneous slice services (e.g., video streaming, caching, 5G network access) on edge devices. We first describe the architecture and operations of Sl-EDGE, and then show that the problem of optimally instantiating joint network-MEC slices is NP-hard. Thus, we propose near-optimal algorithms that leverage key similarities among edge nodes and resource virtualization to instantiate heterogeneous slices 7.5x faster and within 0.25 of the optimum. We first assess the performance of our algorithms through extensive numerical analysis, and show that Sl-EDGE instantiates slices 6x more efficiently then state-of-the-art MEC slicing algorithms. Furthermore, experimental results on a 24-radio testbed with 9 smartphones demonstrate that Sl-EDGE provides at once highly-efficient slicing of joint LTE connectivity, video streaming over WiFi, and ffmpeg video transcoding.