The Queueing Model of a Multiservice System with Dynamic Resource Sharing for Each Class of Calls

Queuing models for wireless mesh networks

“…Multiservice queueing systems models [8,18] adopt that the packet stream of a given call can be represented by the constant bit rate that corresponds to the so-called equivalent bandwidth [16,17]. Each traffic source generates a packet stream of class i, (0 ≤ i ≤ m) that can be described by the following parameters:…”

“…An accurate model of the queueing system with statedependent queue service discipline is proposed in [8] and [18]. The queue service discipline adopted in the model means that the number of allocated resources of the server to calls serviced in a given occupancy state depends on the distribution of this state between individual call classes, i.e.…”

“…The discussed model has been determined at the so-called microstate level in which the state of a service process (microstate) is defined by the number of calls of particular classes serviced in the system. Let us consider then, after [8,18] a queueing system with a server with the capacity of C AUs and the queue with the capacity of U AUs.…”

“…Having determined the average lengths of queues it is possible to determine, on the basis of Little's theorem, average waiting times for service of streams of particular classes. The appropriate computational formulae are to be found in [8] and [18].…”

“…[8] and [18] [8,18], developed at the socalled microstate level [20]. The other model is an approximate model and is introduced to a queueing system at the so-called macrostate level [18].…”