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

}