Motivated by a variety of applications in information and communication systems, we consider queueing networks in which the service rate at each of the individual nodes depends on the state of the entire system. The asymptotic behaviour of this type of networks is fundamentally different from classical queueing networks, where the service rate at each node is usually assumed to be independent of the state of the other nodes. We study the per-node rate stability and output rates for a general class of feed-forward queueing networks with a general capacity allocation function. More specifically, we derive necessary conditions of per-node rate stability, and give bounds for the per-node output rate and asymptotic growth rates, under mild assumptions on the allocation function. For a set of parallel nodes, we further prove the convergence of the output rates and give a sharp characterization of the per-node rate stability. The results provide new intuition and fundamental insight in the stability and throughput behavior of queueing networks with shared resources.

queueing networks, state-dependent allocation, rate stability, output rate, growth rate"
Queueing theory (msc 60K25), Queues and service (msc 90B22)
Logistics (theme 3), Energy (theme 4)
CWI. Probability, Networks and Algorithms [PNA]

Jonckheere, M, van der Mei, R.D, & van der Weij, W. (2007). Rate stability and output rates in queueing networks with shared resources. CWI. Probability, Networks and Algorithms [PNA]. CWI.