A Queueing Model of a Multi-Service System with State-Dependent Distribution of Resources for Each Class of Calls

Queuing Systems for the Internet

“…The model does not include a possibility of servicing elastic traffic. The present article proposes a generalisation of the queuing model [16] to include a possibility to estimate queueing characteristics for individual elastic traffic streams. The idea behind this generalisation was originally presented in [17].…”

“…It is convenient in engineering practice to adopt that the allocation unit will be equal to 1 bps, (or 1 kbps, 1 mbps, etc., depending on bit rate units adequate for a considered system) [16], i.e. :…”

“…The number of busy AUs will never exceed the real capacity of the multiservice server. The average number of calls y i (n) of class i serviced in state n is expressed by Formula [16]:…”

“…Papers [15] and [16] propose a multiservice queueing model based on a queueing interpretation of the occupancy distribution in a full-availability system with elastic traffic [12]. The discipline for the service of the queue in [16] has been labelled SD FIFO (State Dependent FIFO).…”

“…The discipline for the service of the queue in [16] has been labelled SD FIFO (State Dependent FIFO). It is consistent with the allocation of resources in a multiservice server…”