Print Email Facebook Twitter Sojourn-time approximations for a multi-server processor sharing system with priorities Title Sojourn-time approximations for a multi-server processor sharing system with priorities Author van der Mei, R.D. van den Berg, J.L. Vranken, R. Gijsen, B.M.M. Publication year 2003 Abstract 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. Subject InformaticsPrioritiesSojourn-time approximationsSymmetric queuesApproximation theoryMathematical modelsProgram processorsQueueing theoryProcessor sharing (PS) modelsServers To reference this document use: http://resolver.tudelft.nl/uuid:079be771-19e7-4f65-a7f8-a595aac096af DOI https://doi.org/10.1016/s0166-5316(03)00094-4 TNO identifier 237375 Source Performance Evaluation, 54 (3), 249-261 Document type article Files To receive the publication files, please send an e-mail request to TNO Library.