Distributed Dynamic Routing Algorithm for Satellite Constellation

Abstract

This paper researches an routing algorithm of satellite constellation. First of all, based on the periodicity and predictability of the topology structure of inter-satellite link subnet, calculate the sequence of static topology. And then use breadth first search spanning tree to get broadcast routing table, which is used to change link-states in real-time. At last, according to every node’s static topology and real-time linkstates, search the node’s dynamic routing table. This algorithm adopts distributive computation, on the basis of static routing, uses link states to obtain dynamic routing table. All of the routing processing are done by looking up table instead of calculating, which means it has better real-time efficiency and QoS guarantee.