2021
I.-A. Chousainov; I. Moscholios; P. Sarigiannidis; M. Logothetis
Multiservice loss models in single or multi-cluster c-ran supporting quasi-random traffic Journal Article
In: Applied Sciences (Switzerland), vol. 11, no. 18, 2021, (cited By 0).
Περίληψη | BibTeX | Ετικέτες: Cloud-radio access, Cluster, convolution, Product form, Quasi-random, Time congestion | Σύνδεσμοι:
@article{Chousainov2021b,
title = {Multiservice loss models in single or multi-cluster c-ran supporting quasi-random traffic},
author = { I.-A. Chousainov and I. Moscholios and P. Sarigiannidis and M. Logothetis},
url = {https://www.researchgate.net/publication/354616239_Multiservice_Loss_Models_in_Single_or_Multi-Cluster_C-RAN_Supporting_Quasi-Random_Traffic},
doi = {10.3390/app11188559},
year = {2021},
date = {2021-01-01},
journal = {Applied Sciences (Switzerland)},
volume = {11},
number = {18},
abstract = {In this paper, a cloud radio access network (C-RAN) is considered where the baseband units form a pool of computational resource units and are separated from the remote radio heads (RRHs). Based on their radio capacity, the RRHs may form one or many clusters: a single cluster when all RRHs have the same capacity and multi-clusters where RRHs of the same radio capacity are grouped in the same cluster. Each RRH services the so-called multiservice traffic, i.e., calls from many service classes with various radio and computational resource requirements. Calls arrive in the RRHs according to a quasi-random process. This means that new calls are generated by a finite number of mobile users. Arriving calls require simultaneously computational and radio resource units in order to be accepted in the system, i.e., in the serving RRH. If their requirements are met, then these calls are served in the (serving) RRH for a service time which is generally distributed. Otherwise, call blocking occurs. We start with the single-cluster C-RAN and model it as a multiservice loss system, prove that the model has a product form solution, and determine time congestion probabilities via a convolution algorithm whose accuracy is validated with the aid of simulation. Furthermore, the previous model is generalized to include the more complex case of more than one clusters. © 2021 by the authors. Licensee MDPI, Basel, Switzerland.},
note = {cited By 0},
keywords = {Cloud-radio access, Cluster, convolution, Product form, Quasi-random, Time congestion},
pubstate = {published},
tppubtype = {article}
}
2020
I. Moscholios; I.A. Chousainov; P. Panagoulias; P. Sarigiannidis; M. Logothetis
A Multirate System of Quasi-Random Arrivals and a Threshold Call Admission Policy Conference
2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP), IEEE, 2020.
Περίληψη | BibTeX | Ετικέτες: blocking, Congestion, convolution, Product form, Quasi-random | Σύνδεσμοι:
@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}
}
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.D. Moscholios; I.-A. Chousainov; P.I. Panagoulias; P.G. Sarigiannidis; M.D. Logothetis
Performance evaluation of the threshold call admission policy in multi-rate loss systems Journal Article
In: Journal of Telecommunications and Information Technology, no. 2, pp. 51-60, 2020.
Περίληψη | BibTeX | Ετικέτες: blocking, Congestion, convolution, Product form, Quasi-random, Rando | Σύνδεσμοι:
@article{Moscholios202051,
title = {Performance evaluation of the threshold call admission policy in multi-rate loss systems},
author = { I.D. Moscholios and I.-A. Chousainov and P.I. Panagoulias and P.G. Sarigiannidis and M.D. Logothetis},
url = {https://www.researchgate.net/publication/342568954_Performance_Evaluation_of_the_Threshold_Call_Admission_Policy_in_Multi-rate_Loss_Systems},
doi = {10.26636/jtit.2020.142120},
year = {2020},
date = {2020-01-01},
journal = {Journal of Telecommunications and Information Technology},
number = {2},
pages = {51-60},
abstract = {In this paper we consider a link, characterized by specific capacity, that services multi-rate random or quasirandom traffic. Random traffic is generated by an infinite number of traffic sources, while quasi-random traffic is generated by a finite population of traffic sources. The link is modeled as a multi-rate loss system. Handover and new calls are distinguished. New calls compete for the available bandwidth under a threshold call admission policy. In that policy, a new call of a particular service-class is not allowed to enter the system if the in-service handover and new calls of the same service-class plus the new call, exceed a predefined threshold (which can be different for each service-class). On the other hand, handover calls compete for the available bandwidth based on the complete sharing policy. We show that the steady state probabilities in the proposed models have a product form solution (PFS). The PFS leads to a convolution algorithm for accurate calculation of congestion probabilities and link utilization. © 2020 National Institute of Telecommunications. All rights reserved.},
keywords = {blocking, Congestion, convolution, Product form, Quasi-random, Rando},
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}
}
2019
I.P. Keramidi; I.D. Moscholios; P.G. Sarigiannidis; M.D. Logothetis
Call blocking probabilities in a two-link loss model with restricted accessibility Conference
2019.
Περίληψη | BibTeX | Ετικέτες: call blocking, Loss model, Offloading, Product form, Restricted accessibility, Teletraffic | Σύνδεσμοι:
@conference{Keramidi2019,
title = {Call blocking probabilities in a two-link loss model 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/336097286_Call_Blocking_Probabilities_in_a_Two-Link_Loss_Model_with_Restricted_Accessibility},
doi = {10.1109/ConTEL.2019.8848554},
year = {2019},
date = {2019-01-01},
journal = {ConTEL 2019 - 15th International Conference on Telecommunications, Proceedings},
abstract = {In this paper we study the impact of restricted accessibility in a system of two parallel links that accommodates Poisson arriving calls from a single service-class. In a restricted accessibility system, a new call may be blocked even if available bandwidth units do exist at the time of its arrival. In the two-link system, each particular link has a low and a high threshold. Both thresholds express the number of in-service calls in the link. The low threshold shows the point up to which the link can support offloaded calls from the other link. The high threshold shows the point where one link starts offloading calls to the other link. The two-link system with restricted accessibility is modelled as a loss model whose steady state probabilities do not have a product form solution. In order to determine the main teletraffic performance metric in this model which is call blocking probabilities, we propose an approximate method. The accuracy of this method is verified via simulation and found to be quite satisfactory. © 2019 IEEE.},
keywords = {call blocking, Loss model, Offloading, Product form, Restricted accessibility, Teletraffic},
pubstate = {published},
tppubtype = {conference}
}
Διεύθυνση
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