Multiservice Loss Models in Single or Multi-Cluster C-RAN Supporting Quasi-Random Traffic

Applied Sciences

Michael Logothetis¹  Panagiotis Sarigiannidis²  Ioannis Moscholios³  Iskanter-Alexandros Chousainov³ 

[1] Department Electrical & Computer Engineering, University Patras, 265 04 Patras, Greece;Department Electrical & Computer Engineering, University W. Macedonia, 501 00 Kozani, Greece;Department Informatics & Telecommunications, University Peloponnese, 221 00 Tripolis, Greece;

关键词: cloud-radio access;    cluster;    time congestion;    quasi-random;    product form;    convolution;   

DOI  :  10.3390/app11188559

来源: DOAJ

【 摘 要 】

In this paper, a cloud radio access network (C-RAN) is considered where the baseband units form a pool of computational resource units and are separated from the remote radio heads (RRHs). Based on their radio capacity, the RRHs may form one or many clusters: a single cluster when all RRHs have the same capacity and multi-clusters where RRHs of the same radio capacity are grouped in the same cluster. Each RRH services the so-called multiservice traffic, i.e., calls from many service classes with various radio and computational resource requirements. Calls arrive in the RRHs according to a quasi-random process. This means that new calls are generated by a finite number of mobile users. Arriving calls require simultaneously computational and radio resource units in order to be accepted in the system, i.e., in the serving RRH. If their requirements are met, then these calls are served in the (serving) RRH for a service time which is generally distributed. Otherwise, call blocking occurs. We start with the single-cluster C-RAN and model it as a multiservice loss system, prove that the model has a product form solution, and determine time congestion probabilities via a convolution algorithm whose accuracy is validated with the aid of simulation. Furthermore, the previous model is generalized to include the more complex case of more than one clusters.

【 授权许可】

Unknown