The QNET method for two-moment analysis of open queueing networks
Queueing Systems: Theory and Applications
A heavy traffic limit theorem for networks of queues with multiple customer types
Mathematics of Operations Research
A multiclass station with Markovian feedback in heavy traffic
Mathematics of Operations Research
A multiclass network with non-linear, non-convex, non-monotonic stability conditions
Queueing Systems: Theory and Applications
An invariance principle for semimartingale reflecting Brownian motions in an orthant
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
State space collapse with application to heavy traffic limits for multiclass queueing networks
Queueing Systems: Theory and Applications
Stability of Multiclass Queueing Networks Under Priority Service Disciplines
Operations Research
Diffusion approximations for Kumar-Seidman network under a priority service discipline
Operations Research Letters
Existence Condition for the Diffusion Approximations of Multiclass Priority Queueing Networks
Queueing Systems: Theory and Applications
A Brownian model for multiclass queueing networks with finite buffers
Journal of Computational and Applied Mathematics - Selected papers of the international symposium on applied mathematics, August 2000, Dalian, China
A simple proof of diffusion approximations for LBFS re-entrant lines
Operations Research Letters
Hi-index | 0.00 |
We establish a sufficient condition for the existence of the (conventional) diffusion approximation for multiclass queueing networks under priority service disciplines. The sufficient condition relates to a sufficient condition for the weak stability of the fluid networks that correspond to the queueing networks under consideration. In addition, we establish a necessary condition for the network to have a continuous diffusion limit; the necessary condition is to require a reflection matrix (of dimension equal to the number of stations) to be completely-S. When applied to some examples, including generalized Jackson networks, single station multiclass queues, first-buffer-first-served re-entrant lines, a two-station Dai–Wang network and a three-station Dumas network, the sufficient condition coincides with the necessary condition.