Analytical modelling of multiservice switching networks with multiservice sources and resource management mechanisms

Abstract

This article proposes a new analytical method of determining occupancy distribution and blocking probability in multiservice switching networks with admission control mechanisms and resource management mechanisms. The proposed method is a universal one, which allows for determining blocking probability using the same model, regardless of the type of admission control mechanisms and resource management mechanisms. The versatility of the method is demonstrated in the article for two selected mechanisms, i.e. a threshold mechanism and a resource reservation mechanisms. The switching networks under consideration are offered multiservice traffic streams, generated by the so-called multiservice sources, according to Erlang, Engset and Pascal distributions. The proposed method is based on a generalised way of determining traffic characteristics for inter-stage links of switching networks with resource and call management mechanisms. Particular attention is given to determining the influence of the introduced mechanisms in outgoing links of the switching network on the traffic properties of inter-stage links of the network. The results of analytical calculations are then compared with the results obtained in digital simulation for a number of selected switching networks.

Analytical Modeling of Switching Fabrics of Elastic Optical Networks

“…Then, [35] discusses a model of MSNs with point-to-group selection and a number of attempts to set up a connection, while [36] discusses a model of MSNs with point-to-point selection. The literature also offers examples of more complex models of MSNs that take into account, for example, Erlang, Engset, and Pascal traffic streams [37], as well as call admission control mechanisms [38], [39] or overflow links [40]- [42].…”

“…In [45], a method for modeling switching networks that have the advantage of servicing multi-cast traffic is derived. Reference [39] proposes MSN models with threshold mechanisms for traffic generated by the so-called multiservice sources. Finally, [40]- [42] consider MSN models with so-called overflow links introduced to their structure.…”

An Analytical Framework in OFDM Wireless Networks Servicing Random or Quasi-Random Traffic

“…Apart from this significant modification in the call admission, it is important to mention that the model of [23] has a product form solution (PFS) for the steady-state probabilities. The existence of a PFS is significant in loss/queueing models, since it results in efficient algorithms (of recursive or convolutional form) for the performance measures calculation [32][33][34][35][36][37]. However, in the P-S model, the calculation of CBP and resource utilization is based on complicated algorithms which are unattractive for network planning engineers.…”

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

“…The fact that call blocking probabilities (CBP) are calculated via the classical Erlang B formula has led to numerous extensions of Erlang's model for the call-level analysis of wired (e.g. [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]), wireless (e.g. [17][18][19][20][21][22][23][24][25][26][27][28]), satellite (e.g.…”