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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Zhang, Yunze (Autor:in) / Zhao, Kanglian (Autor:in) / Li, Wenfeng (Autor:in)


    Erscheinungsdatum :

    01.08.2024


    Format / Umfang :

    2672781 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch