An analytical framework of a C-RAN supporting random, quasi-random and bursty traffic

An analytical framework of a C-RAN supporting random, quasi-random and bursty traffic

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

I.-A. Chousainov, I. Moscholios, P. Sarigiannidis, A. Kaloxylos, M. Logothetis: An analytical framework of a C-RAN supporting random, quasi-random and bursty traffic. In: Computer Networks, 180 , 2020.

Περίληψη

We consider a cloud radio access network (C-RAN) where the baseband signal processing servers, named baseband units (BBUs) are separated from the remote radio heads (RRHs). The RRHs form a single cluster while the BBUs form a pool of resources. Each RRH may accommodate random (Poisson) or quasi-random or bursty traffic. The latter is approximated via the compound Poisson process according to which batches of calls, with a generally distributed batch size, follow a Poisson process. A call requires a computational resource and a radio resource unit from the BBUs and the serving RRH, respectively. If any of the two units is unavailable, call blocking occurs. Otherwise, the new call is accepted in the RRH. We model this C-RAN as a loss system and study two different cases: i) all RRHs accommodate bursty traffic and ii) some RRHs accommodate random traffic, some quasi-random traffic and the rest RRHs accommodate bursty traffic. In both cases, we show that a product form solution exists for the steady state probabilities and propose efficient convolution algorithms for the accurate calculation of time and call congestion probabilities. The accuracy of these algorithms is verified via simulation. © 2020 Elsevier B.V.

BibTeX (Download)

@article{Chousainov2020b,
title = {An analytical framework of a C-RAN supporting random, quasi-random and bursty traffic},
author = { I.-A. Chousainov and I. Moscholios and P. Sarigiannidis and A. Kaloxylos and M. Logothetis},
url = {https://www.researchgate.net/publication/342682428_An_Analytical_Framework_of_a_C-RAN_Supporting_Random_Quasi-Random_and_Bursty_Traffic},
doi = {10.1016/j.comnet.2020.107410},
year  = {2020},
date = {2020-01-01},
journal = {Computer Networks},
volume = {180},
abstract = {We consider a cloud radio access network (C-RAN) where the baseband signal processing servers, named baseband units (BBUs) are separated from the remote radio heads (RRHs). The RRHs form a single cluster while the BBUs form a pool of resources. Each RRH may accommodate random (Poisson) or quasi-random or bursty traffic. The latter is approximated via the compound Poisson process according to which batches of calls, with a generally distributed batch size, follow a Poisson process. A call requires a computational resource and a radio resource unit from the BBUs and the serving RRH, respectively. If any of the two units is unavailable, call blocking occurs. Otherwise, the new call is accepted in the RRH. We model this C-RAN as a loss system and study two different cases: i) all RRHs accommodate bursty traffic and ii) some RRHs accommodate random traffic, some quasi-random traffic and the rest RRHs accommodate bursty traffic. In both cases, we show that a product form solution exists for the steady state probabilities and propose efficient convolution algorithms for the accurate calculation of time and call congestion probabilities. The accuracy of these algorithms is verified via simulation. © 2020 Elsevier B.V.},
keywords = {Bursty, Cloud, Congestion, Radio access, Random},
pubstate = {published},
tppubtype = {article}
}
Κατηγορία
Μετάβαση στο περιεχόμενο