论文标题
使用两种选择的力量，用于启用边缘网络切片的启发式网络切片优化
Heuristic for Edge-enabled Network Slicing Optimization using the Power of Two Choices
论文作者
论文摘要
我们为网络切片放置优化问题提出了一种在线启发式算法。该解决方案适应了支持大规模网络的位置，并集成了边缘特异性和URLLC约束。我们依靠一种称为两个选择的力量来构建启发式方法的方法。评估结果表明，在大规模的情况下，在几秒钟内解决该问题的启发式良好表现。与确定性的在线整数线性编程（ILP）解决方案相比，启发式还可以提高网络切片放置请求的接受率。
We propose an online heuristic algorithm for the problem of network slice placement optimization. The solution is adapted to support placement on large scale networks and integrates Edge-specific and URLLC constraints. We rely on an approach called the Power of Two Choices to build the heuristic. The evaluation results show the good performance of the heuristic that solves the problem in few seconds under a large scale scenario. The heuristic also improves the acceptance ratio of network slice placement requests when compared against a deterministic online Integer Linear Programming (ILP) solution.
