← Search

Weikun Chen

1 accepted papers

2021

An Efficient Linear Programming Rounding-and-Refinement Algorithm for Large-Scale Network Slicing Problem

ICASSP 2021accepted

In this paper, we consider the network slicing problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and allocate network resources to meet diverse service requirements, and propose an efficient two-stage algorithm…

Cited by 0SourceScholar