 Calculation of the performance region of an easy-to-optimize alternative for Generalized Processor SharingJasper Vanlerberghe, Joris Walraevens, Tom Maertens and Herwig Bruneel European Journal of Operational Research, 2018, vol. 270, issue 2, 625-635 Abstract: Service differentiation is a basic requirement in every modern queueing system with multiple classes of customers. In this paper, we look at Hierarchical Generalized Processor Sharing (H-GPS), which is a discrete-time hierarchically-structured implementation of the well-known idealized Generalized Processor Sharing (GPS) scheduling discipline. We prove that, for three classes, H-GPS can be configured to obtain any performance possible by other scheduling mechanisms, such as priority queueing or GPS. The hierarchical nature of a H-GPS system, however, has the major advantage that optimization is easier and more intuitive. To this end, we also present an algorithm to calculate the configuration parameters for H-GPS given a certain performance objective. Keywords: Queueing; Hierarchical Generalized Processor Sharing; Feasible region; Optimization (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:270:y:2018:i:2:p:625-635 DOI: 10.1016/j.ejor.2018.04.018 Access Statistics for this article European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati More articles in European Journal of Operational Research from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.