arXiv 2301.093722023-01-23cs.NI

面向大规模卫星网络实时的应用的在线网络切片

Online Network Slicing for Real Time Applications in Large-scale Satellite Networks

Binquan Guo, Hongyan Li, Zhou Zhang, Ye Yan

备注：: Accepted to appear in IEEE ICC 2023

摘要：

在这项工作中，我们研究资源分配策略的实时的【形】通信（RTC）在卫星网络与虚拟网络功能。通过星间链路（ISL）、在轨计算和网络虚拟化技术的增强，大规模卫星网络可以为具有多样化功能的RTC应用提供低延迟和高带宽的全球覆盖。然而，使用间歇性ISL实现具有特定功能要求的RTC需要具有快速响应时间的高效路由方法。我们确定，这样的路由问题在时变图可以制定为一个整数线性规划问题。分支定界方法引起$\mathcal{O}(|\mathcal{L}^τ| \cdot (3 |\mathcal{V}^τ| + |\mathcal{L}^τ|)^{|\mathcal{L}^τ|})$时间复杂度，其中$|\mathcal{V}^τ|$是节点的数量，并且$|\mathcal{L}^τ|$是在时间间隔$τ$期间的链路的数量。通过采用基于k-最短路径的算法，理论上的最坏情况复杂度变为$O(|\mathcal{V}^τ|! \cdot |\mathcal{V}^τ|^3)$。虽然它在大多数情况下运行得很快，但它的解决方案可能是次优的，并且可能找不到，从而导致实际中的接受率受损。为了克服这一点，我们进一步设计了一个基于图的算法，利用特殊结构的解决方案空间，它可以获得最优解的多项式时间与计算复杂性为$\mathcal{O}(3|\mathcal{L}^τ| + (2\log{|\mathcal{V}^τ|}+1) |\mathcal{V}^τ|)$。在星链星座上进行的仿真验证了该算法的有效性。

英文摘要：

In this work, we investigate resource allocation strategy for real time communication (RTC) over satellite networks with virtual network functions. Enhanced by inter-satellite links (ISLs), in-orbit computing and network virtualization technologies, large-scale satellite networks promise global coverage at low-latency and high-bandwidth for RTC applications with diversified functions. However, realizing RTC with specific function requirements using intermittent ISLs, requires efficient routing methods with fast response times. We identify that such a routing problem over time-varying graph can be formulated as an integer linear programming problem. The branch and bound method incurs $\mathcal{O}(|\mathcal{L}^τ| \cdot (3 |\mathcal{V}^τ| + |\mathcal{L}^τ|)^{|\mathcal{L}^τ|})$ time complexity, where $|\mathcal{V}^τ|$ is the number of nodes, and $|\mathcal{L}^τ|$ is the number of links during time interval $τ$. By adopting a k-shortest path-based algorithm, the theoretical worst case complexity becomes $O(|\mathcal{V}^τ|! \cdot |\mathcal{V}^τ|^3)$. Although it runs fast in most cases, its solution can be sub-optimal and may not be found, resulting in compromised acceptance ratio in practice. To overcome this, we further design a graph-based algorithm by exploiting the special structure of the solution space, which can obtain the optimal solution in polynomial time with a computational complexity of $\mathcal{O}(3|\mathcal{L}^τ| + (2\log{|\mathcal{V}^τ|}+1) |\mathcal{V}^τ|)$. Simulations conducted on starlink constellation with thousands of satellites corroborate the effectiveness of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

摘要：

英文摘要：

相关论文