Geometric node routing algorithms for low-Earth orbit global satellite communications systems

Novel algorithms for determining optimal routes through a packet-switched, LEO satellite communications system having inter-linked satellites are presented. These algorithms have their foundations in the field of differential geometry and a version of these algorithms has been implemented in the Iridium system. The implementation resulted in a multiple of an order of magnitude performance enhancement as well as a bound on the computational complexity (thus facilitating scalability)