Geographical Reservation for Guaranteed Handover and Routing in Low Earth Orbit Constellations

In this paper, we address the problem of permanent guaranteed routing through a LEO satellite constellation with inter-satellite links. A reduction to a geometric problem of intersection of rectangles is given, along with algorithmic issues. We express the problem on a very simple model, and discuss the extension to more complicated schemes. We present some experimental results based on this framework that demonstrate the efficiency of the method in a call admission control process.