Congestion probabilities in a multi-cluster c-ran servicing a mixture of traffic sources

  • Αρχική/
  • Congestion probabilities in a multi-cluster c-ran servicing a mixture of traffic sources

Congestion probabilities in a multi-cluster c-ran servicing a mixture of traffic sources

  • Post by:
  • Ιανουάριος 1, 2020
  • Comments off

I.-A. Chousainov, I.D. Moscholios, P.G. Sarigiannidis: Congestion probabilities in a multi-cluster c-ran servicing a mixture of traffic sources. In: Electronics (Switzerland), vol. 9, no. 12, pp. 1-18, 2020.

Περίληψη

A multi-cluster cloud radio access network (C-RAN) is considered in this paper where the remote radio heads (RRHs) form different clusters. A cluster includes RRHs that have the same radio resource unit capacity. In addition, all RRHs are separated from the common pool of computational resource units named baseband units. Each RRH accommodates calls whose arrival process can be random, quasi-random, or even bursty. The latter is modeled according to the compound Poisson process where calls arrive in the C-RAN in the form of batches whose size (in calls) is generally distributed. An arriving call requires a radio and a computational resource unit so as to be accepted in the C-RAN. If at least one of these units is not available, the call is blocked. To analyze the proposed multi-cluster C-RAN we model it as a loss system, show that the steady-state probabilities have a product form solution and propose an algorithm for the computation of congestion probabilities. The accuracy of the proposed algorithm is verified via simulation. © 2020 by the authors. Licensee MDPI, Basel, Switzerland.

Σύνδεσμοι

BibTeX (Download)

@article{Chousainov20201,
title = {Congestion probabilities in a multi-cluster c-ran servicing a mixture of traffic sources},
author = { I.-A. Chousainov and I.D. Moscholios and P.G. Sarigiannidis},
url = {https://www.researchgate.net/publication/347616523_Congestion_Probabilities_in_a_Multi-Cluster_C-RAN_Servicing_a_Mixture_of_Traffic_Sources},
doi = {10.3390/electronics9122120},
year  = {2020},
date = {2020-01-01},
journal = {Electronics (Switzerland)},
volume = {9},
number = {12},
pages = {1-18},
abstract = {A multi-cluster cloud radio access network (C-RAN) is considered in this paper where the remote radio heads (RRHs) form different clusters. A cluster includes RRHs that have the same radio resource unit capacity. In addition, all RRHs are separated from the common pool of computational resource units named baseband units. Each RRH accommodates calls whose arrival process can be random, quasi-random, or even bursty. The latter is modeled according to the compound Poisson process where calls arrive in the C-RAN in the form of batches whose size (in calls) is generally distributed. An arriving call requires a radio and a computational resource unit so as to be accepted in the C-RAN. If at least one of these units is not available, the call is blocked. To analyze the proposed multi-cluster C-RAN we model it as a loss system, show that the steady-state probabilities have a product form solution and propose an algorithm for the computation of congestion probabilities. The accuracy of the proposed algorithm is verified via simulation. © 2020 by the authors. Licensee MDPI, Basel, Switzerland.},
keywords = {Bursty, Cloud-radio access, Cluster, Congestion, Poisson, Probability, Product form, Quasi-random},
pubstate = {published},
tppubtype = {article}
}
Κατηγορία
Μετάβαση στο περιεχόμενο