A Caching Based Robust Routing Algorithm Using DDR for LEO Constellation Networks

The Laser Inter-Satellite Link (LISL) has emerged as a promising method for achieving higher transmission rates, increasing bandwidth, and reducing power consumption in Low Earth Orbit (LEO) constellation networks. Currently, a variety of routing algorithms have been developed for LEO constellation...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Conference on Communications workshops s. 1747 - 1752
Hlavní autoři: Chen, Zhihao, Tian, Feng, Zhao, Yanchun, Wang, Wenqian, Wu, Youlong, Hu, Haiying
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 08.06.2025
Témata:
Conferences
DDR
Hardware
LEO constellation network
LISL
Low earth orbit satellites
Packet loss
packet loss ratio
Routing
SDRAM
Software
Software algorithms
Software reliability
System analysis and design
ISSN:2694-2941
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Laser Inter-Satellite Link (LISL) has emerged as a promising method for achieving higher transmission rates, increasing bandwidth, and reducing power consumption in Low Earth Orbit (LEO) constellation networks. Currently, a variety of routing algorithms have been developed for LEO constellation network with LISL. However, most of them assumed that the LISLs are stable, and none of them considered the packet loss caused by the LISL jitters. When the LISL is jittering the packet loss ratio becomes higher, and the LISLs are not stable actually. This paper proposes a caching-based robust routing algorithm for LEO constellation with LISL by using the Double Data Rate SDRAM (DDR). Specifically, the packets transmitted in the most recent time period on each LISL are ring cached in DDR, and the cached packets are rerouted in the interruption event of LISL. We propose a detailed software and hardware caching based routing system design and show its advantages in LISL constellation networks. Various simulations are constructed, and our proposed algorithm outperforms the existing routing algorithm in terms of packet loss ratio.
ISSN:2694-2941
DOI:10.1109/ICCWorkshops67674.2025.11162301