Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Modelling deadlock in open restricted queueing networks

Palmer, Geraint I. ORCID:, Harper, Paul R. ORCID: and Knight, Vincent A. ORCID: 2018. Modelling deadlock in open restricted queueing networks. European Journal of Operational Research 266 (2) , pp. 609-621. 10.1016/j.ejor.2017.10.039

[thumbnail of 1-s2.0-S0377221717309529-main.pdf] PDF - Published Version
Available under License Creative Commons Attribution.

Download (1MB)


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.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Subjects: Q Science > QA Mathematics
Additional Information: This is an open access article under the CC BY license. ( )
Publisher: Elsevier
ISSN: 0377-2217
Date of First Compliant Deposit: 9 November 2017
Date of Acceptance: 16 October 2017
Last Modified: 12 May 2023 05:02

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item


Downloads per month over past year

View more statistics