Abstract Priority queueing models have been commonly used in telecommunication systems. The development of analytically tractable models to determine their performance is vitally important. The discrete time batch Markovian arrival process (DBMAP ) has been widely used to model the source behavior of data traffic, while phase-type (PH) distribution has been extensively applied to model the serv...

We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from cumulative arrival and service time processes which are assumed to satisfy an appropriate sample path large deviation principle. We establish logarithmic asympto...

A general framework for aggregation and decomposition of product form queueing networks with state dependent routing and servicing is presented. By analogy with electrical circuit theory, the stations are grouped into clusters or subnetworks such that the process decomposes into a global process and a local process. Moreover, the local process factorizes into the subnetworks. The global process...