Modelling deadlock in open restricted queueing networks
研究了排队容量有限的开放受限排队网络中的死锁现象，提出了离散事件仿真中检测死锁的方法，并建立了单节点和双节点系统的马尔可夫链模型，将预期死锁时间与仿真结果对比。
Open restricted queueing networks give rise to the phenomenon of deadlock, whereby some customers may be unable to ever leave a server due to mutual blocking. This paper explores deadlock in queueing networks with limited queueing capacity, presents a method of detecting deadlock in discrete event simulations, and builds Markov chain models of these deadlocking networks. The three networks for which Markov models are given include single and multi-server networks for one and two node systems. The expected times to deadlock of these models are compared to results obtained using a simulation of the stochastic process, together with the developed deadlock detection method. This paper aims to be of value to simulation modellers of queues.