@conference{Moscholios2020b,
title = {A Multirate System of Quasi-Random Arrivals and a Threshold Call Admission Policy},
author = { I. Moscholios and I.A. Chousainov and P. Panagoulias and P. Sarigiannidis and M. Logothetis},
editor = { Networks 2020 12th International Symposium on Communication Systems and Digital Signal Processing ({CSNDSP})},
url = {https://www.researchgate.net/publication/346841887_A_Multirate_System_of_Quasi-Random_Arrivals_and_a_Threshold_Call_Admission_Policy},
doi = {10.1109/CSNDSP49049.2020.9249590},
year = {2020},
date = {2020-07-01},
booktitle = {2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)},
journal = {2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2020},
publisher = {IEEE},
abstract = {We consider a link that services multirate quasirandom traffic. Calls are distinguished to handover and new calls. New calls compete for the available bandwidth under a threshold call admission policy. In that policy, new calls of a service-class are blocked if the in-service handover and new calls of the same service-class including the new call, exceeds a predefined threshold. Handover calls compete for the available bandwidth under the complete sharing policy. The steady state probabilities in the proposed model have a product form solution which leads to a convolution algorithm for the accurate calculation of congestion probabilities and link utilization. © 2020 IEEE.},
keywords = {blocking, Congestion, convolution, Product form, Quasi-random},
pubstate = {published},
tppubtype = {conference}
}

@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}
}