2020
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}
}
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.
Διεύθυνση
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