Satellite Deterministic Routing for Delay-Sensitive Data Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current low-earth-orbit satellite networks face challenges in providing deterministic guarantees for bandwidth, delay, jitter, and packet loss, especially in scenarios requiring low-delay and high-reliability communication, such as unmanned aerial vehicle control and remote industrial Internet interconnection, due to high-speed motion causing propagation delay changes and complex resource occupation calculations.
Innovation Solution
A satellite network deterministic route construction method that collects real-time transmission and topology information, screens feasible paths based on preset demands, and selects paths with lowest overhead to ensure end-to-end deterministic forwarding, considering resource occupation and buffer areas, using credit-based shaping algorithms for traffic management.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If time-varying continuous graph model is used for route calculation, then deterministic resource occupation is guaranteed, but calculation complexity becomes extremely high and scalability deteriorates
Solution Approach 1:
The patent segments the continuous time-varying graph into discrete time snapshots, where each snapshot represents the network topology at a specific time interval. This segmentation transforms the continuous optimization problem into discrete steps, reducing calculation complexity while maintaining deterministic guarantees through periodic updates.
Solution Approach 2:
The patent performs preliminary route calculation and resource reservation at each time snapshot before actual data transmission. By pre-calculating deterministic routes and reserving resources in advance based on predicted topology, the system avoids real-time calculation complexity during data flow while ensuring deterministic guarantees.
2Device complexity
If traditional routing algorithms are used, then calculation complexity is low, but deterministic guarantees for bandwidth, delay, jitter and packet loss cannot be provided
Solution Approach 1:
The patent introduces dynamic route adjustment based on time-varying topology snapshots. Routes are recalculated at each snapshot according to current network conditions, enabling the system to adapt to changing satellite positions and link qualities while maintaining deterministic guarantees through controlled update frequency.
Solution Approach 2:
The patent introduces a control plane as an intermediary between the physical network and data plane. The control plane performs deterministic route calculation, resource reservation, and traffic engineering functions, separating complex deterministic guarantee mechanisms from simple data forwarding operations.
3Reliability
If single-hop inter-satellite link scheduling is implemented, then packet loss is avoided at individual hops, but end-to-end multi-hop global deterministic service quality cannot be realized
Solution Approach 1:
The patent creates a universal end-to-end deterministic routing framework that works across multi-hop satellite networks. The control plane implements global view-based route calculation that simultaneously considers all hops in the path, providing unified deterministic guarantees for bandwidth, delay, jitter, and packet loss across the entire end-to-end connection.
Data Source
AI summary
The present disclosure provides a satellite network deterministic route construction method, forwarding method, and system. The deterministic route construction method includes: according to service data and topology information of an entire satellite network, searching for a plurality of feasible paths from the source node to the destination node corresponding to the service data; according to transmission configuration information of the service data and the topology information of the entire satellite network, screening out, from the plurality of feasible paths, a feasible path satisfying a preset transmission demand as present target feasible path; and determining path overhead of each target feasible path, and selecting a feasible path with lowest path overhead as a deterministic forwarding path of the service data. The present disclosure can achieve specification of end-to-end path satisfying delay requirements and deterministic delay forwarding for delay-sensitive service data, thereby effectively reducing reconfiguration overhead, and realizing high scalability.