Performance bounds for cellular mobile communications networks with repeated attempts
Moshe Zukerman, Chia Min Lee · 2002
This paper provides bounds for performance evaluation and dimensioning of mobile networks, taking into consideration repeated call attempts. We consider two 49-cell wrap-around architectures of digital cellular mobile communications networks based on: (1) a symmetric traffic scenario and (2) a highway. We assume Poisson arrivals, and exponential holding and sojourn times. Worst (M/M/k-type) and best (M/M/k/k-type) case scenarios are considered. Markov chain simulations are used to evaluate performance for both approaches. The M/M/k approach is accurately approximated by a Jackson network model. The performance difference between the scenarios is evaluated and compared.