Sojourn-time approximations for a multi-server processor sharing system with priorities
article
We study mean sojourn times in a multi-server processor sharing system with two priority classes and with general service-time distributions. For high-priority customers, the mean sojourn time follows directly from classical results on symmetric queues. For low-priority customers, in the absence of exact results, we propose a simple and explicit approximation for the mean sojourn time. Extensive numerical experiments demonstrate that the approximations are highly accurate for a wide range of parameter settings. © 2003 Elsevier B.V. All rights reserved.
Topics
TNO Identifier
237375
Source
Performance Evaluation, 54(3), pp. 249-261.
Pages
249-261
Files
To receive the publication files, please send an e-mail request to TNO Repository.