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

}

@article{Panagoulias2019b,

title = {An analytical framework in OFDM wireless networks servicing random or quasi-random traffic},

author = { P.I. Panagoulias and I.D. Moscholios and P.G. Sarigiannidis and M. Glabowski and M.D. Logothetis},

url = {https://www.researchgate.net/publication/337850639_An_Analytical_Framework_in_OFDM_Wireless_Networks_Servicing_Random_or_Quasi-Random_Traffic},

doi = {10.3390/app9245376},

year  = {2019},

date = {2019-01-01},

journal = {Applied Sciences (Switzerland)},

volume = {9},

number = {24},

abstract = {We consider the downlink of an orthogonal frequency division multiplexing (OFDM)-based cell that services calls from many service-classes. The call arrival process is random (Poisson) or quasi-random, i.e., calls are generated by an infinite or a finite number of sources, respectively. In order to determine congestion probabilities and resource utilization, we model the cell as a multirate loss model. Regarding the call admission, we consider the restricted accessibility, the bandwidth reservation (BR), and the complete sharing (CS) policies. In a system of restricted accessibility, a new call may be blocked even if resources do exist. In a BR system, subcarriers can be reserved in favor of calls of high subcarrier requirements. Finally, in a CS system, a new call is blocked due to resource unavailability. In all three policies, we show that there exist recursive formulas for the determination of the various performance measures. Based on simulation, the accuracy of the proposed formulas is found to be quite satisfactory. © 2019 by the authors.},

keywords = {Complete sharing, Congestion, OFDM, Quasi-random, Random, Recursive, Reservation, Restricted},

pubstate = {published},

tppubtype = {article}

}