Routing schemes play a crucial role in handling link failures, especially in satellite networks where such failures are common due to the challenging space environment. In this article, a resilient routing algorithm called “shortest path first directional routing (SPFDR)” is proposed. By modeling the topology of the constellation as a mesh and applying specific rules for outport selection, SPFDR can handle any $k$ ($k \leq$ 2) link/node failures with minimal path stretch in inclined low Earth-orbit megaconstellations. A rigorous proof of SPFDR under $k$ ($k \leq$ 2) link/node failures is provided. The most prominent aspects of SPFDR are linear time complexity and label-free strategy. The simulation results demonstrate that SPFDR guarantees 100% reachability against any $k$ link/node failures ($k \leq$ 2), with an average path stretch increase of approximately zero.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Resilient Routing Algorithm for Handling $K$-Link/Node Failure in Inclined LEO Megaconstellations


    Contributors:
    Zhang, Yunze (author) / Zhao, Kanglian (author) / Li, Wenfeng (author)


    Publication date :

    2024-08-01


    Size :

    2672781 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English