The core insight behind the work is that not all link interruptions in a satellite network are surprises. Because satellites follow deterministic orbital trajectories, a substantial portion of the on–off behavior of inter-satellite links can be predicted in advance from the laws of orbital motion. Conventional terrestrial routing protocols were never designed to exploit this predictability. The widely deployed Open Shortest Path First (OSPF) protocol, for example, computes shortest paths solely on the basis of link distance, without considering how long a link will remain usable or how much bandwidth it has available. In a satellite constellation where a link may vanish in a matter of minutes, a path that is shortest today can be useless tomorrow, and services riding on it will be abruptly severed.

Existing remedies fall short in different ways. Fast reroute strategies, borrowed from terrestrial carrier networks, can protect traffic against sudden link failures by pre-establishing backup paths, but they consume substantial bandwidth resources and cannot provide protection for every node across an entire network. For a constellation with hundreds or thousands of satellites, blanket fast-reroute protection would be prohibitively expensive in terms of the reserved capacity it requires. The alternative—reacting only after a link breaks—forces the network to reconverge while traffic is already being dropped. The Beijing team’s approach occupies the middle ground: use the predictability of orbital dynamics to move services onto fresh paths just before the old ones are scheduled to disappear, minimizing both service disruption and resource overhead.

The technical foundation of the strategy is an extended OSPF protocol. The researchers augmented the routing information advertisement with two new fields: a “termination time of validity” and an “available bandwidth” value. These extensions, illustrated in the structure of the extended Route-LSA (link state advertisement), allow every router in the network to learn not just that a link exists, but how long it will remain available and how much capacity it can offer. Synchronization of the link state database across the entire network is achieved through the Link Management Protocol, ensuring that all nodes share a consistent, time-aware view of the constellation’s topology. This transforms the link state database from a static map into a dynamic schedule of the network’s future state.

With that time-aware database in place, the team redefined the routing metric itself. Rather than a pure distance measure, the new metric is a weighted combination of the conventional metric and the link effective duration. The weighting factor can be adjusted according to service requirements, letting operators strike a balance between the shortest path and the longest effective duration. The Constrained Shortest Path First (CSPF) algorithm then uses this metric to select paths that satisfy both length and duration constraints simultaneously. The researchers demonstrate the value of this with a concrete example: a path with fewer hops that interrupts after 200 seconds cannot satisfy a service requiring 800 seconds of transmission, whereas the CSPF algorithm can select a path with slightly more hops but an effective duration of up to 1,000 seconds, keeping the service alive for its entire lifetime.

On top of the extended protocol, the researchers built a pre-rerouting mechanism that operates at the source node of each label switched path (LSP). The source node continuously monitors the remaining effective time of the established LSP. When that remaining time falls below the remaining service transmission duration and is less than a preset threshold, the mechanism triggers automatically: the source node recomputes the optimal path satisfying both bandwidth and duration constraints based on the current network state, reserves resources and establishes a new LSP through the constraint-based routed label distribution protocol, performs the service switching, and finally releases the resources of the old path. The result is a handoff that completes before the old link ever breaks, rather than a recovery that begins after it does.

To prove that the mechanism actually works in hardware rather than only on paper, the team constructed an experimental environment based on the VxWorks embedded system and an FPGA hardware platform. Dynamic link on–off behavior was simulated by plugging and unplugging ports between control nodes. In the functional verification, when the old LSP was established over a port with a shorter effective time, triggering of the pre-rerouting caused the source node to automatically construct a new path through a port with a longer effective time. Ping packets were transmitted normally throughout the process, and after the old path was released, service transmission continued without any packet loss. This demonstrated that the strategy can autonomously complete path switching ahead of link interruption and preserve service continuity end to end.

The quantitative performance validation was carried out on the EXata hardware-in-the-loop simulation platform, using a topology in which two alternative paths connect the source node to the destination node. The primary path was configured with an effective duration of 100 seconds, while the service required 500 seconds of transmission, and the source node sent a total of 1,000 UDP packets. In the conventional OSPF rerouting scenario, the link failed at the 100-second mark and service transmission resumed only after an interruption of approximately 20 seconds; the destination ultimately received 930 packets, corresponding to a packet loss rate of 7 percent. In the pre-rerouting scenario, the service was switched to the backup path before the interruption occurred, transmission proceeded uninterrupted for the entire duration, and the destination received 990 packets—a packet loss rate of merely 1 percent, roughly 6 percentage points better than the conventional scheme.

The researchers are candid about the limits of the approach. The new path established by pre-rerouting may be inferior to the original path in terms of hop count and transmission delay, since the mechanism prioritizes availability over optimality when the clock is running out. They note that future work could further optimize transmission performance by recomputing the globally optimal path after the interruption has passed, combining the continuity guarantees of pre-rerouting with the efficiency of full recalculation. Even with that caveat, the study delivers an efficient, low-loss service continuity assurance solution for LEO satellite networks facing predictable link interruptions, and the authors argue it carries significant engineering application value for the stable and reliable operation of space–air–ground integrated networks.

As 6G architectures pull satellites, aircraft, and ground networks into a single seamless fabric, the ability to route around scheduled disruptions will only grow in importance. Constellation operators are planning systems with thousands of satellites whose links rise and set on orbital schedules, and every predictable interruption handled proactively is bandwidth and capacity saved for the failures that genuinely cannot be foreseen. By teaching a decades-old routing protocol to read the orbital clock—embedding link lifetimes and bandwidth into the advertisements that shape every path decision—the Beijing team’s work points toward networks that treat the dynamism of space not as a hazard to be survived, but as a schedule to be planned around, keeping business and broadband services flowing smoothly through the churn of the constellation overhead.

Subject of Research: Pre-rerouting strategy based on an extended OSPF protocol to ensure service continuity in low Earth orbit satellite networks

Article Title: Pre-rerouting strategy to ensure business continuity for low-Earth-orbit satellite network

Article References: Pre-rerouting strategy to ensure business continuity for low-Earth-orbit satellite network. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: LEO satellite networks, 6G, pre-rerouting, OSPF, CSPF, inter-satellite links, service continuity, packet loss, label switched path, space-air-ground integrated networks, routing protocol, Beijing University of Posts and Telecommunications