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