.png){kind=icon}
Return
Modelling deadlock in open restricted queueing networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2017.10.039.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2017 The Author(s). Published by Elsevier B.V.
Keywords:
Queueing
Queueing networks
Deadlock
Markov models
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
Maleimide–based donor-π-acceptor-π-donor derivative for efficient organic light-emitting diodes
PREAI
ShareSave
View more