Paper Info
Title
OPSPF: Orbit Prediction Shortest Path First Routing for Resilient LEO Satellite Networks
Abstract
With global coverage as well as ultra-low latency, the Low-Earth-Orbit (LEO) satellite constellation is regarded as an ideal complement to the terrestrial network infrastructure. One technical issue in LEO satellite networks is efficient and resilient routing. Considering the periodic topology changes, straightforwardly leveraging terrestrial routing protocols, such as OSPF, will incur endless route convergence, consuming expensive inter-satellite link bandwidth. Prior work proposes several snapshot-based routing approaches, which either require to store a sequence of routing table snapshots in limited satellite memory, or have to maintain frequent interaction with the ground stations. In this work, we propose OPSPF, a novel routing protocol dedicated to LEO satellite networks. OPSPF takes advantage of the regularity of the constellation and conducts periodic route calculation for instantaneous routing table generation, which well handles the regular topology changes. Moreover, OPSPF proposes an on-demand dynamic routing mechanism, dedicated to the irregular topology changes caused by link failure/recovery. Evaluation shows, compared with OSPF, OPSPF has zero route convergence overhead during regular topology changes and 57% reduction of the communication overhead and 82% reduction of the route convergence time during irregular topology changes.
Year
DOI
Venue
2019
10.1109/ICC.2019.8761611
IEEE International Conference on Communications
Field
DocType
ISSN
Convergence (routing),Open Shortest Path First,Satellite constellation,Shortest path problem,Computer science,Latency (engineering),Computer network,Bandwidth (signal processing),Routing table,Routing protocol
Conference
1550-3607
Citations 
PageRank 
References 
0
0.34
0
Authors
6
Name
Order
Citations
PageRank
Tian Pan12111.90
Tao Huang24413.88
Xingchen Li300.34
Yujie Chen4105.41
Wenhao Xue500.34
yunjie liu62210.23