@article{Keramidi202061,

title = {Performance evaluation of two-link multirate loss models with restricted accessibility},

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

url = {https://www.researchgate.net/publication/342568028_Performance_Evaluation_of_Two-Link_Multirate_Loss_Models_with_Restricted_Accessibility},

doi = {10.26636/jtit.2020.142320},

year  = {2020},

date = {2020-01-01},

journal = {Journal of Telecommunications and Information Technology},

number = {2},

pages = {61-69},

abstract = {We consider a two-link communication system with restricted accessibility that services Poisson arriving calls of many service-classes and propose a multirate teletraffic loss model for its analysis. In a restricted accessibility system, call blocking occurs even if available resources do exist at the time of a call's arrival. In the two-link system under consideration, each link has two thresholds (offloading and support) which express the in-service calls in a link. The offloading threshold represents the point from which a link offloads calls. The support threshold (which is lower than the offloading threshold) defines the point up to which a link supports offloaded calls. The two-link system with restricted accessibility is modeled as a loss system whose steady state probabilities do not have a product form solution. However, approximate formulas for the determination of call blocking probabilities are proposed. In addition, we also provide a corresponding analysis related to the case of quasi-random traffic (i.e. traffic generated by a finite number of users). The accuracy of all formulas is verified through simulation and is found to be quite satisfactory. © 2020 National Institute of Telecommunications. All rights reserved.},

keywords = {Accessibility, blocking, Non-product form, Poisson, Quasi-random, Threshold},

pubstate = {published},

tppubtype = {article}

}

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

}