Modeling product-form state-dependent systems with BPP traffic

Głbowski, Mariusz; Kaliszan, Adam; Stasiak, Maciej

doi:10.1016/j.peva.2009.10.002

Cited by 73 publications

(78 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is proved in [55] that in order to model multiservice systems with state-dependent call admission process one can apply an approximation of the service process that occurs in these systems by one-dimensional Markov chain. The adopted approach allows the Kaufman-Roberts recurrence [27,28], developed for systems with state-independent call admission process and Erlang call streams, to be generalised to a form that makes it possible to determine the occupancy distribution (state probability) in systems with state dependent call arrival process servicing Erlang, Engset and Pascal traffic streams [55]:…”

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

“…The adopted approach allows the Kaufman-Roberts recurrence [27,28], developed for systems with state-independent call admission process and Erlang call streams, to be generalised to a form that makes it possible to determine the occupancy distribution (state probability) in systems with state dependent call arrival process servicing Erlang, Engset and Pascal traffic streams [55]:…”

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

“…With the occupancy distribution calculated and obtained on the basis of Formula (6), we are in a position to determine the values of parameters y En, j,c (n) and y Pa,k,c (n) which define the average number of serviced calls of class c generated by Engset sources from set j and Pascal sources from set k, respectively, in the occupancy state of n AUs [55]:…”

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

“…To solve a given set of confounded equations, it is necessary to use the iterative methods developed in [25,55]. Having determined the occupancy distribution in the limited-availability group with a reservation mechanism, the blocking probability for calls of class c that belong to set M = {1, 2, .…”

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

“…Let us consider a model of a limited-availability group with threshold mechanisms [55] with capacity V L (Fig. 3), that services m traffic classes belonging to set M = {1, 2, .…”

Section: Model Of An Output Group With Threshold Mechanismsmentioning

confidence: 99%

See 4 more Smart Citations

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

Głąbowski

Sobieraj

2017

Telecommun Syst

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

Section: Model Of Output Links With Resource Reservationmentioning

confidence: 99%

“…Let us consider a model of a limited-availability group with threshold mechanisms [55] with capacity V L (Fig. 3), that services m traffic classes belonging to set M = {1, 2, .…”

Section: Model Of An Output Group With Threshold Mechanismsmentioning

confidence: 99%

See 3 more Smart Citations