ITEM METADATA RECORD
Title: On closed queueing networks with mixed preemptive resume priority servers
Authors: Leemans, Herlinde
Dedene, Guido
Issue Date: 1996
Publisher: K.U.Leuven - Departement toegepaste economische wetenschappen
Series Title: DTEW Research Report 9632 pages:1-16
Abstract: This paper discusses a typical closed queueing network model in which multiple preemptive resume servers are present with different priority structures at each priority node. An algorithm is developed that is applicable for the three-node two-class model and results are compared to point estimates obtained from simulation. The algorithm is partly based on the Delay/MVA algorithm developed by Bondi and Chuang, because of the accuracy with which instant arrival queue lengths at fcfs servers are calculated. Results are also compared with results obtained from the Shadow Approximation.
Publication status: published
KU Leuven publication type: IR
Appears in Collections:Research Center for Management Informatics (LIRIS), Leuven

Files in This Item:
File Status SizeFormat
OR_9632.pdf Published 320KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.