Online Network Slicing for Real Time Applications in Large-scale Satellite Networks
Binquan Guo, Hongyan Li, Zhou Zhang, Ye Yan

TL;DR
This paper proposes a novel graph-based routing algorithm for real-time communication in large-scale satellite networks, achieving optimal solutions efficiently amidst dynamic, time-varying network conditions.
Contribution
It introduces a polynomial-time graph-based algorithm for resource allocation in satellite networks, improving upon traditional ILP and k-shortest path methods.
Findings
The proposed algorithm finds optimal routes efficiently in large satellite constellations.
Simulations on Starlink data validate the algorithm's effectiveness and scalability.
The method outperforms existing approaches in solution quality and computational speed.
Abstract
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 time complexity, where is the number of nodes, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSatellite Communication Systems · Interconnection Networks and Systems · Distributed systems and fault tolerance
