Multiservice Queuing System with Elastic Traffic

This article proposes a new model of a multiservice queueing system with elastic traffic. The model makes it possible to determine individual delay characteristics in network nodes for each serviced call class. The proposed model can be used to analyse present-day network systems.

Any analysis of multiservice networks requires a set of appropriate queueing models to be developed. Numerous works, e.g. [1], propose an approximate approach in which all call classes have identical characteristics resulting from a possibility of traffic compression (the so-called elastic traffic). Such an approach eventually leads to the Erlang model which does not allow queues for selected traffic classes to be evaluated. [2] proposes a SDFIFO model (State-Dependent FIFO). This model results from the queueing interpretation of the model with traffic compression [3], [4]. The present article* proposes a generalisation to model [2] to introduce a possibility of servicing elastic traffic.