Sojourn-time approximations for a multi-server processor sharing system with priorities

Share/Save/Bookmark

Mei van der, R.D. and Berg van den, J.L. and Vranken, R. and Gijsen, B.M.M. (2003) Sojourn-time approximations for a multi-server processor sharing system with priorities. Performance Evaluation, 54 (3). pp. 249-261. ISSN 0166-5316

[img]PDF
Restricted to UT campus only
: Request a copy
159Kb
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.
Item Type:Article
Copyright:© 2003 Elsevier
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75020
Official URL:http://dx.doi.org/10.1016/S0166-5316(03)00094-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 216274