Decomposing the queue length distribution of processor-sharing models into queue lengths of permanent customer queues

Research output: Contribution to journalArticleAcademicpeer-review

97 Downloads (Pure)

Abstract

We obtain a decomposition result for the steady state queue length distribution in egalitarian processor-sharing (PS) models. In particular, for multi-class egalitarian PS queues, we show that the marginal queue length distribution for each class equals the queue length distribution of an equivalent single class PS model with a random number of permanent customers. Similarly, the mean sojourn time (conditioned on the initial service requirement) for each class can be obtained by conditioning on the number of permanent customers. The decomposition result implies linear relations between the marginal queue length probabilities, which also hold for other PS models such as the egalitarian PS models with state-dependent system capacity that only depends on the total number of customers in the system. Based on the exact decomposition result for egalitarian PS queues, we propose a similar decomposition for discriminatory processor-sharing (DPS) models, and numerically show that the approximation is accurate for moderate differences in service weights. (Keywords: Processor-sharing queues; Queue length; Decomposition; Permanent customers; Approximation; Generalized discriminatory processor-sharing)
Original languageUndefined
Article number10.1016/j.peva.2005.07.009
Pages (from-to)100-116
Number of pages17
JournalPerformance evaluation
Volume62
Issue number1-4
DOIs
Publication statusPublished - Oct 2005

Keywords

  • Generalized discriminatory processor-sharing
  • Permanent customers
  • Approximation
  • EWI-1929
  • Processor-sharing queues
  • IR-65584
  • METIS-224607
  • Queue length
  • Decomposition

Cite this