2020
I.-A. Chousainov; I. Moscholios; P. Sarigiannidis; A. Kaloxylos; M. Logothetis
An Analytical Framework of a C-RAN Supporting Bursty Traffic Conference
ICC 2020 - 2020 IEEE International Conference on Communications (ICC), IEEE, ICC 2020 - 2020 IEEE International Conference on Communications (ICC), 2020.
Περίληψη | BibTeX | Ετικέτες: batch, Bursty, Cloud, Congestion, Product form, Radio access | Σύνδεσμοι:
@conference{Chousainov2020,
title = {An Analytical Framework of a C-RAN Supporting Bursty Traffic},
author = { I.-A. Chousainov and I. Moscholios and P. Sarigiannidis and A. Kaloxylos and M. Logothetis},
url = {https://www.researchgate.net/publication/343243729_An_Analytical_Framework_of_a_C-RAN_Supporting_Bursty_Traffic},
doi = {10.1109/ICC40277.2020.9149219},
year = {2020},
date = {2020-06-01},
booktitle = {ICC 2020 - 2020 IEEE International Conference on Communications (ICC)},
journal = {IEEE International Conference on Communications},
publisher = {IEEE},
address = {ICC 2020 - 2020 IEEE International Conference on Communications (ICC)},
abstract = {In this paper we consider a cloud radio access network (C-RAN) architecture 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 centralized pool of data center resources. Each RRH of the C-RAN accommodates bursty traffic which is expected to play a dominant role in 5G networks. We approximate bursty traffic via the compound Poisson process according to which batches of calls, with a generally distributed batch size, occur at time points that follow a negative exponential distribution. Each call of a new batch is treated separately from the other calls of the same batch. A new call requires a computational resource unit from the centralized pool of BBUs and a radio resource unit from the serving RRH. If both units are available, then the call is accepted in the RRH for an exponentially distributed service time. Otherwise, call blocking occurs. We model this C-RAN as a loss system and show that the steady state probabilities have a product form solution (PFS). Based on the PFS, we propose an efficient convolution algorithm for the accurate calculation of the main performance measures which are time and call congestion probabilities. The accuracy of this algorithm is verified via simulation. © 2020 IEEE.},
keywords = {batch, Bursty, Cloud, Congestion, Product form, Radio access},
pubstate = {published},
tppubtype = {conference}
}
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 Journal Article
In: Computer Networks, vol. 180, 2020.
Περίληψη | BibTeX | Ετικέτες: Bursty, Cloud, Congestion, Radio access, Random | Σύνδεσμοι:
@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}
}
I.-A. Chousainov; I.D. Moscholios; P.G. Sarigiannidis
Congestion probabilities in a multi-cluster c-ran servicing a mixture of traffic sources Journal Article
In: Electronics (Switzerland), vol. 9, no. 12, pp. 1-18, 2020.
Περίληψη | BibTeX | Ετικέτες: Bursty, Cloud-radio access, Cluster, Congestion, Poisson, Probability, Product form, Quasi-random | Σύνδεσμοι:
@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}
}
Διεύθυνση
Internet of Things and Applications Lab
Department of Electrical and Computer Engineering
University of Western Macedonia Campus
ZEP Area, Kozani 50100
Greece
Πληροφορίες Επικοινωνίας
tel: +30 2461 056527
Email: ithaca@uowm.gr