Call Blocking Probabilities in Multi-Cluster C-RAN Supporting Poisson Traffic
Iskanter-Alexandros Chousainov, Ioannis D. Moscholios, Michael D. Logothetis · 2020
In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units (BBUs). The RRHs are grouped in different clusters according to their capacity while the BBUs form a centralized pool of computational resource units. Each RRH accommodates Poisson arriving calls which require a radio and a computational resource unit in order to be accepted in the C-RAN. If these units are not available, call blocking occurs. To compute call blocking probabilities we propose a convolution algorithm which performs quite satisfactory, in terms of computational time.