Equalisation of blocking probability in switching systems with limited availability

Abstract

Three reservation algorithms for the limited-availability system are proposed and compared in the paper. These algorithms can be used for call blocking equalisation in outgoing links of multiservice switching networks. Two approximate methods of equalised blocking probability calculation in the system with limited availability are proposed. Results of analytical calculations are compared with results of digital simulation of limited availability groups and switching networks with reservation. These researches have confirmed a great accuracy of the proposed calculation methods. The formulae derived by the authors can be useful for the analysis and design ofiSDN and B-ISDN systems.

Modelling of virtual‐circuit switching nodes with multicast connections

“…One of the possible strategies of CAC function is the bandwidth reservation which has been considered in numerous works, for example in References [8][9][10][11]. The reservation mechanism makes access to network resources more proper for all traffic classes.…”

Virtual Circuit Switching Node with Bandwidth Reservation and Multicast Connections

“…In the case of Algorithms R4, the equalised blocking probability of can be approximated by the method developed for Algorithm R3 [7]. Figure 2 shows a fragment of a virtual circuit network with four nodes indicated by the letters A, B, C, D, respectively.…”

“…The thresholds Q i , which lead to the required level of blocking probabilities in the preceding algorithms, can be obtained iteratively [7]. 4) Algorithm R4: In the algorithms proposed above it is assumed that the thresholds Q i are common for the whole group, regardless of the division of free BBU's among particular links.…”

“…All the states higher than Q i belong to the reservation space R i = V − Q i , in which class i calls are blocked. In [7] three reservation algorithms for BMLAG and unicast traffic were proposed. Below, on the basis of the algorithms described in [7], we propose reservation algorithms for GMLAG with multicast traffic and give appropriate analytical formulae for blocking probability calculation in such a system.…”

“…In [7] three reservation algorithms for BMLAG and unicast traffic were proposed. Below, on the basis of the algorithms described in [7], we propose reservation algorithms for GMLAG with multicast traffic and give appropriate analytical formulae for blocking probability calculation in such a system. 1) Algorithm R1: In this algorithm the reservation threshold Q i is designated for all call classes with the exception of the "oldest" class, i.e.…”