Call blocking probabilities in a two-link multirate loss system for Poisson traffic

• Published in: IET networks Vol. 7; no. 4; pp. 233 - 241
• Main Authors: Sagkriotis, Stefanos G, Pantelis, Spyros K, Moscholios, Ioannis D, Vassilakis, Vassilios G
• Format: Journal Article
• Language: English
• Published: The Institution of Engineering and Technology 01.07.2018; Wiley
• Subjects: available bandwidth units; bandwidth allocation; bandwidth‐per‐call requirements; call blocking probabilities; complete sharing policy; different bandwidth sharing policies; different service‐classes; high bandwidth requirements; highest threshold; integer number; in‐service calls; lowest threshold named support threshold; Markov processes; multirate tele‐traffic loss models; named offloading threshold; Poisson arriving calls; Poisson traffic; probability; quality of service; Special Issue: Traffic Engineering and Optimisation in Next Generation Networks; steady state probabilities; telecommunication congestion control; telecommunication links; telecommunication traffic; the bandwidth reservation policy; thresholds; two‐link multirate loss system; two‐link system; bandwidth-per-call requirements; telecommunication links; telecommunication congestion control; two-link system; Poisson arriving calls; highest threshold; Poisson traffic; available bandwidth units; steady state probabilities; different bandwidth sharing policies; integer number; lowest threshold named support threshold; probability; quality of service; multirate tele-traffic loss models; different service-classes; complete sharing policy; bandwidth allocation; in-service calls; thresholds; call blocking probabilities; named offloading threshold; Markov processes; two-link multirate loss system; high bandwidth requirements; the bandwidth reservation policy; telecommunication traffic
• ISSN: 2047-4954; 2047-4962; 2047-4962
• DOI: 10.1049/iet-net.2017.0223

The authors propose two multirate teletraffic loss models in a two-link system that accommodates Poisson arriving calls from different service-classes with different bandwidth-per-call requirements. Each link has two thresholds which refer to the number of in-service calls in the link. The lowest threshold named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. Two different bandwidth sharing policies are considered: (i) the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units and (ii) the bandwidth reservation policy, in which an integer number of bandwidth units is reserved to benefit calls of high bandwidth requirements. The two models do not have a product form solution for the steady state probabilities. However, they propose approximate formulas for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory.