Fast Reroute Algorithms for Satellite Network With Segment Routing

Abstract

Satellite networks, which have wide coverage and high throughput, are more and more important for the Internet. Low earth orbit (LEO) satellites have been more widely used than other orbiting satellites because they have lower unidirectional links (UDL) transmission delay. However, due to the variability and instability of satellite links, leading to relatively higher UDL transmission delay and more link failures for satellite networks. Thus, fast reroute (FRR) schemes, which can bypass the failure links and improve network performance, are badly needed in satellite networks. However, FRR need relatively large computing resources while satellites have limited resources. Thus, traditional routing technologies cannot be directly applied to satellite network due to frequent topology changes and poor computing performance. To meet the challenges, we propose a hybrid FRR schemes for satellite networks that combines the centralized computing with distributed segment routing (SR). With the scheme, satellites with relatively more computing resources can pre-compute the reroute paths, and distribute the routing rules to satellites that have more forwarding resources. We formulate the problem, propose a classification algorithm that can distinguish satellites according to their computing and forwarding resources. Additionally, we also propose a real-time backup path maintenance algorithm in the hybrid rerouting scheme. Finally, we conduct comprehensive simulations to evaluate the performance of the proposed algorithms, and the results show that under extreme conditions, the proposed LFR algorithm is 30.9% better than traditional algorithms in storage resource utilization; and the proposed LFA+ algorithm is 74.3% better than traditional algorithms in update time comparison.

Keywords

• Satellite routing
• fast reroute
• segment routing
• centralized routing
• hybrid routing