Message Routing Algorithms for Satellite Constellations

Hundreds of satellites will soon be orbiting the Earth forming new global communication networks. Messages will be routed through these networks via intersatellite links and an efficient routing is necessary for high data throughput and low latency. The topologies (connectivity) of these communication networks will change in time due to the motion of the satellites and due to failures in both the satellites and the links. These networks will require dynamic message routing algorithms that determine routing based on the network topology and the network load.The general routing problem is related to the n problem nsive to find the optimal solution. An effective routing algorithm would route packets in a near-optimal way with limited load and connectivity knowledge. This project if focused on the design, evaluation and simulation of such algorithms.