Abstract
We present an analytical model for calculating upper and lower bounds for call-blocking probabilities in a LEO satellite network that carries voice calls. The method is especially useful for large systems where calculation of call-blocking probabilities are too expensive. Our method calculates upper and lower bounds very easily and produces fairly accurate results.
| Original language | English |
|---|---|
| Pages (from-to) | 1-15 |
| Number of pages | 15 |
| Journal | Turkish Journal of Electrical Engineering and Computer Sciences |
| Volume | 11 |
| Issue number | 1 |
| Publication status | Published - 2003 |
| Externally published | Yes |