Hybrid Geometric/Shortest-path Routing in Proliferated Low-Earth-Orbit Satellite Networks

被引:0
|
作者
Shake, Thomas [1 ]
机构
[1] MIT, Lincoln Lab, Cambridge, MA 02139 USA
关键词
D O I
10.1109/MILCOM58377.2023.10356345
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Routing data in satellite networks using predictable orbital geometry characteristics of a satellite constellation has been proposed in a number of studies. Orbital geometry may be used as a primary mechanism for determining routes or as an adjunct or a fallback to other routing techniques such as link-state routing. In cases where geometric information is used as an adjunct or fallback for a primary routing technique, the interactions between the primary and the adjunct/fallback routing mechanisms are of key importance in determining the routing performance of the combined routing mechanisms. This paper presents a study of a hybrid routing mechanism where some satellite routing nodes use shortest-path routing and other satellite routing nodes use a completely geometric approach to routing, with no exchange of routing table data or link state between different satellites using the two different routing mechanisms. A simple distributed procedure is presented for determining whether a given satellite uses shortest-path or geometric routing, and the routing performance in the overall constellation is calculated using random mixes of satellites using shortest-path vs geometric routing. Routing performance is characterized by path failure rate, latency, and transmission efficiency, and is calculated in an example medium-inclination 720-satellite Walker Delta satellite constellation. Performance is calculated in fully intact constellations and in the presence of satellite failures up to 8% of the satellites in the constellation.
引用
收藏
页数:8
相关论文
共 50 条
  • [22] Learning-Based Admission Control for Low-Earth-Orbit Satellite Communication Networks
    CHENG Lei
    QIN Shuang
    FENG Gang
    ZTE Communications, 2023, 21 (03) : 54 - 62
  • [23] Enhanced Pathfinding and Scalability with Shortest-Path Tree Routing For Space Networks
    De Jonckere, Olivier
    Fraire, Juan A.
    Burleigh, Scott
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 4082 - 4088
  • [24] A shortest-path routing algorithm for incomplete WK-recursive networks
    Su, MY
    Chen, GH
    Duh, DR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (04) : 367 - 379
  • [25] A Parallel Discrete Event Simulation Engine for the Low-Earth-Orbit Satellite Constellation Networks
    Su, Hailong
    Liu, Yaoqi
    Zhou, Yiqing
    Shi, Jinglin
    Li, Hongguang
    Qian, Manli
    CHINA COMMUNICATIONS, 2024, 21 (08) : 264 - 275
  • [26] Wavelength Conversion in All-Optical Networks with Shortest-Path Routing
    Thomas Erlebach
    Stamatis Stefanakos
    Algorithmica, 2005, 43 : 43 - 61
  • [27] Wavelength conversion in all-optical networks with shortest-path routing
    Erlebach, T
    Stefanakos, S
    ALGORITHMICA, 2005, 43 (1-2) : 43 - 61
  • [28] Communication performance of shuffle-exchange networks with shortest-path routing
    Broadwater, A
    Jayadev, BD
    Efe, K
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1259 - 1267
  • [29] An oblivious shortest-path routing algorithm for fully connected cubic networks
    Yang, Xiaofan
    Megson, Graham M.
    Evans, David J.
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2006, 66 (10) : 1294 - 1303
  • [30] A loop-free shortest-path routing algorithm for dynamic networks
    D'Angelo, Gianlorenzo
    D'Emidio, Mattia
    Frigioni, Daniele
    THEORETICAL COMPUTER SCIENCE, 2014, 516 : 1 - 19