Multiclass queueing networks have been used to model communication and complex manufacturing systems. Recent results show that these networks can be unstable in the sense that the total number of jobs in the network explodes as time goes to infinity even if the traffic intensity at each station is less than unity. Simulation is used to demonstrate these unusual phenomena. Conjectures based on simulation are presented. Key words and phrases: discrete event simulation, multiclass queueing networks, instability, steady state. Submitted July 1995 Revised March 1996 IIE Transactions, Vol 29, pp 213-219 (1997). 1 Introduction Multiclass queueing networks have been used to model communication and complex manufacturing systems. A distinguishing f...
We study the performance of distributed simulation of open queueing networks, by analysing queueing ...
Queueing networks constitute a large family of stochastic models, involving jobs that enter a networ...
Summarization: Production networks with finite buffers, random rates, and breakdowns are analyzed us...
Multiclass queueing networks have been used to model communication and complex manufacturing systems...
Multi-class re-entrant networks are common in semiconductor, communication and other complex manufac...
This paper treats transience for queueing network models by considering an associated fluid model. I...
Summarization: This paper presents a review of and refinements to a class of discrete-event models f...
In this article we study the performance of distributed simulation of open feedforward queueing netw...
In this article we study the performance of distributed simulation of open feedforward queueing netw...
This paper studies the instability of multiclass queueing networks. We prove that if a fluid limit m...
In this article we study the performance of distributed simulation of open feedforward queueing netw...
The multiclass queueing network (McQN) arises as a natural multiclass extension of the traditional (...
The multiclass queueing network (McQN) arises as a natural multiclass extension of the traditional (...
Summarization: This paper presents a flow approximation of acyclic queueing networks with multiple c...
In this paper we study message flow processes in distributed simulators of open queueing networks. W...
We study the performance of distributed simulation of open queueing networks, by analysing queueing ...
Queueing networks constitute a large family of stochastic models, involving jobs that enter a networ...
Summarization: Production networks with finite buffers, random rates, and breakdowns are analyzed us...
Multiclass queueing networks have been used to model communication and complex manufacturing systems...
Multi-class re-entrant networks are common in semiconductor, communication and other complex manufac...
This paper treats transience for queueing network models by considering an associated fluid model. I...
Summarization: This paper presents a review of and refinements to a class of discrete-event models f...
In this article we study the performance of distributed simulation of open feedforward queueing netw...
In this article we study the performance of distributed simulation of open feedforward queueing netw...
This paper studies the instability of multiclass queueing networks. We prove that if a fluid limit m...
In this article we study the performance of distributed simulation of open feedforward queueing netw...
The multiclass queueing network (McQN) arises as a natural multiclass extension of the traditional (...
The multiclass queueing network (McQN) arises as a natural multiclass extension of the traditional (...
Summarization: This paper presents a flow approximation of acyclic queueing networks with multiple c...
In this paper we study message flow processes in distributed simulators of open queueing networks. W...
We study the performance of distributed simulation of open queueing networks, by analysing queueing ...
Queueing networks constitute a large family of stochastic models, involving jobs that enter a networ...
Summarization: Production networks with finite buffers, random rates, and breakdowns are analyzed us...