Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Journal of Telecommunications and Information Technology

2 2020

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Performance Evaluation of Two-Link Multirate Loss Models with Restricted Accessibility

Keramidi Irene P., Moscholios Ioannis D., Sarigiannidis Panagiotis G., Logothetis Michael D.

Journal of Telecommunications and Information Technology

2020

nr 2

61--69

We consider a two-link communication system with restricted accessibility that services Poisson arriving calls of many service-classes and propose a multirate teletraﬃc 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 (oﬄoading and support) which express the in-service calls in a link. The oﬄoading threshold represents the point from which a link oﬄoads calls. The support threshold (which is lower than the oﬄoading threshold) deﬁnes the point up to which a link supports oﬄoaded 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 traﬃc (i.e. traﬃc generated by a ﬁnite number of users). The accuracy of all formulas is veriﬁed through simulation and is found to be quite satisfactory.

Performance Evaluation of the Threshold Call Admission Policy in Multi-rate Loss Systems

Moscholios Ioannis D., Chousainov Iskanter-Alexandros, Panagoulias Panagiotis I., Sarigiannidis Panagiotis G., Logothetis Michael D.

Journal of Telecommunications and Information Technology

2020

nr 2

51--60

In this paper we consider a link, characterized by speciﬁc capacity, that services multi-rate random or quasirandom traﬃc. Random traﬃc is generated by an inﬁnite number of traﬃc sources, while quasi-random traﬃc is generated by a ﬁnite population of traﬃc 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 predeﬁned threshold (which can be diﬀerent 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.