Shortest Path on Layered Graph in 5G Network Slicing Problem
  • Trang chủ
  • Shortest Path on Layered Graph in 5G Network Slicing Problem

Shortest Path on Layered Graph in 5G Network Slicing Problem

Thời gian: 10:00 đến 10:45 Ngày 25/04/2019

Địa điểm: B4-705, VIASM

Báo cáo viên: Duong Quang Huy, Concordia University

Tóm tắt:
With the 5th  generation of mobile networking (5G) on our doorstep, optical network operators are reorganizing their network infrastructures so that they can deploy different topologies on the same physical infrastructure on demand.
This new paradigm, called network slicing, together with network function virtualization (NFV), can be enabled by segmenting the physical resources based on the requirements of the application level. 
 
In this work, we investigate a nested decomposition scheme for the design of reliable 5G network slicing. We used a layered graph as a method to solve the problem of NFV placement. Due to the problem's property, it raises a particular shortest path problem for which we are looking for efficient solutions. We call it the shortest path problem on the layered graph with arc licensing cost.
 
Extensive computational results show that we can get an approximation optimal reliable 5G slicing solutions with high accuracy (about  99% on average) in fairly reasonable computational times.