2021 |
I.A. Chousainov; I. Moscholios; P. Sarigiannidis; M. Logothetis , "Multiservice Loss Models for Cloud Radio Access Networks", IEEE Access, 2021. Journal Article Abstract | BibTeX | Tags: call blocking, Cloud-radio access, convolution, poisson process | Links: @article{Chousainov2021, title = {Multiservice Loss Models for Cloud Radio Access Networks}, author = {I.A. Chousainov and I. Moscholios and P. Sarigiannidis and M. Logothetis}, url = {https://www.researchgate.net/publication/353991171_Multiservice_Loss_Models_for_Cloud_Radio_Access_Networks}, doi = {10.1109/ACCESS.2021.3105946}, year = {2021}, date = {2021-08-18}, journal = {IEEE Access}, abstract = {In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units which form a common pool of computational resource units. Depending on their capacity, the RRHs may form one or more clusters. Each RRH accommodates multiservice traffic, i.e., calls from different service-classes with different radio and computational resource requirements. Arriving calls follow a Poisson process and simultaneously require radio and computational resource units in order to be accepted in the serving RRH. If their resource requirements cannot be met then calls are blocked and lost. Otherwise, calls remain in the serving RRH for a generally distributed service time. Assuming the single-cluster C-RAN, we model it as a multiservice loss system, prove that a product form solution exists for the steady-state probabilities and determine call blocking probabilities via an efficient convolution algorithm whose accuracy is validated via simulation. Furthermore, we generalize the previous multiservice loss model by considering the more complex multi-cluster case where RRHs of the same capacity are grouped in different clusters.}, keywords = {call blocking, Cloud-radio access, convolution, poisson process}, pubstate = {published}, tppubtype = {article} } In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units which form a common pool of computational resource units. Depending on their capacity, the RRHs may form one or more clusters. Each RRH accommodates multiservice traffic, i.e., calls from different service-classes with different radio and computational resource requirements. Arriving calls follow a Poisson process and simultaneously require radio and computational resource units in order to be accepted in the serving RRH. If their resource requirements cannot be met then calls are blocked and lost. Otherwise, calls remain in the serving RRH for a generally distributed service time. Assuming the single-cluster C-RAN, we model it as a multiservice loss system, prove that a product form solution exists for the steady-state probabilities and determine call blocking probabilities via an efficient convolution algorithm whose accuracy is validated via simulation. Furthermore, we generalize the previous multiservice loss model by considering the more complex multi-cluster case where RRHs of the same capacity are grouped in different clusters. |
2020 |
I. Moscholios; P. Sarigiannidis; M. Logothetis , "Teletraffic Loss/Queueing Models in LEO Mobile Satellite Systems: a Short Survey", 2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP), IEEE, 2020. Conference Abstract | BibTeX | Tags: call blocking, loss, low earth orbit, mobile satellite system, queueing | Links: @conference{Moscholios2020, title = {Teletraffic Loss/Queueing Models in LEO Mobile Satellite Systems: a Short Survey}, author = { I. Moscholios 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/346846594_Teletraffic_LossQueueing_Models_in_LEO_Mobile_Satellite_Systems_a_Short_Survey}, doi = {10.1109/csndsp49049.2020.9249490}, 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 = {In this paper we present teletraffic loss/queueing models that can be applied in low earth orbit mobile satellite systems (LEO-MSS) with "satellite-fixed"cells for the determination of call blocking probabilities of new and handover calls. We study two different model categories: a) those that focus on single-rate traffic where calls belong to a single service-class and require one channel for service and b) those that focus on multirate traffic where the LEO-MSS accommodates many service-classes whose calls may require more than one channels for service. © 2020 IEEE.}, keywords = {call blocking, loss, low earth orbit, mobile satellite system, queueing}, pubstate = {published}, tppubtype = {conference} } In this paper we present teletraffic loss/queueing models that can be applied in low earth orbit mobile satellite systems (LEO-MSS) with "satellite-fixed"cells for the determination of call blocking probabilities of new and handover calls. We study two different model categories: a) those that focus on single-rate traffic where calls belong to a single service-class and require one channel for service and b) those that focus on multirate traffic where the LEO-MSS accommodates many service-classes whose calls may require more than one channels for service. © 2020 IEEE. |
2019 |
P. Panagoulias; I. Moscholios; P. Sarigiannidis; N. Sagias; M. Logothetis , "Performance Metrics in OFDM Wireless Networks with Restricted Accessibility", 2019. Conference Abstract | BibTeX | Tags: call blocking, OFDM, Poisson, Recursive, Restricted | Links: @conference{Panagoulias2019, title = {Performance Metrics in OFDM Wireless Networks with Restricted Accessibility}, author = { P. Panagoulias and I. Moscholios and P. Sarigiannidis and N. Sagias and M. Logothetis}, url = {https://www.researchgate.net/publication/338601635_Performance_Metrics_in_OFDM_Wireless_Networks_with_Restricted_Accessibility}, doi = {10.1109/PACET48583.2019.8956292}, year = {2019}, date = {2019-01-01}, journal = {5th Panhellenic Conference on Electronics and Telecommunications, PACET 2019}, abstract = {In this paper we study the downlink of an Orthogonal Frequency Division Multiplexing (OFDM) based cell that accommodates calls from different service-classes with different resource requirements. We assume that calls arrive in the system according to a Poisson process while the call admission is based on restricted accessibility. In a restricted accessibility system, a new call may be blocked even if available resources do exist at the time of its arrival. To determine, via recursive formulas, the most important performance metrics, i.e., Call Blocking Probabilities (CBP) and resource utilization in this system, we model the system as a multirate loss model. The accuracy of the proposed formulas is verified via simulation and found to be quite satisfactory. © 2019 IEEE.}, keywords = {call blocking, OFDM, Poisson, Recursive, Restricted}, pubstate = {published}, tppubtype = {conference} } In this paper we study the downlink of an Orthogonal Frequency Division Multiplexing (OFDM) based cell that accommodates calls from different service-classes with different resource requirements. We assume that calls arrive in the system according to a Poisson process while the call admission is based on restricted accessibility. In a restricted accessibility system, a new call may be blocked even if available resources do exist at the time of its arrival. To determine, via recursive formulas, the most important performance metrics, i.e., Call Blocking Probabilities (CBP) and resource utilization in this system, we model the system as a multirate loss model. The accuracy of the proposed formulas is verified via simulation and found to be quite satisfactory. © 2019 IEEE. |
I.P. Keramidi; I.D. Moscholios; P.G. Sarigiannidis; M.D. Logothetis , "Call blocking probabilities in a two-link loss model with restricted accessibility", 2019. Conference Abstract | BibTeX | Tags: call blocking, Loss model, Offloading, Product form, Restricted accessibility, Teletraffic | Links: @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} } 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. |
Address
Internet of Things and Applications Lab
Department of Electrical and Computer Engineering
University of Western Macedonia Campus
ZEP Area, Kozani 50100
Greece
Contact Information
tel: +30 2461 056527
Email: ithaca@uowm.gr