Computing call blocking probabilities in LEO satellite networks

We present an analytical model for computing call blocking probabilities in a LEO satellite network that carries voice calls. Both satellite-fixed and earth-fixed constellations are considered. The model is analyzed approximately by decomposing it into sub-systems. Each sub-system is solved exactly in isolation using a Markov process and the individual results are combined together through an iterative method. Our model also calculates call blocking probabilities due to hand-offs. Numerical results demonstrate that our method is accurate for a wide range of traffic patterns and for constellations with a number of satellites that is representative of commercial systems. For larger systems, we also propose a method to calculate upper and lower bounds for call blocking probabilities.