On closed queueing networks with mixed preemptive resume priority servers

Autor:	Leemans, Herlinde, Dedene, Guido
Jazyk:	angličtina
Rok vydání:	1996
Předmět:	Networks
Popis:	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. ispartof: DTEW Research Report 9632 pages:1-16 status: published
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=od______1131::1ce9bdaa7d6bdda0dd6ad4e8d2f9e44f https://lirias.kuleuven.be/handle/123456789/118556 Zobrazit plný text záznamu