Bulletin of the Korean Mathematical Society (대한수학회보)

Korean Mathematical Society (대한수학회)
권호 표지
DOI QR코드

DOI QR Code

QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES

  • Kim, Jeong-Sim (DEPARTMENT OF MATHEMATICS EDUCATION CHUNGBUK NATIONAL UNIVERSITY)
  • Published : 2009.01.31
Download PDF
⟨ Previous Next ⟩

Abstract

We consider a single server multi-class queueing model with Poisson arrivals and relative priorities. For this queue, we derive a system of equations for the transform of the queue length distribution. Using this system of equations we find the moments of the queue length distribution as a solution of linear equations.

Keywords

References

  1. E. Altman, A. Avrachenkov, and U. Ayesta, A survey on discriminatory processor shar- ing, Queueing Syst. 53 (2006), no. 1-2, 53-63. https://doi.org/10.1007/s11134-006-7586-8
  2. M. Haviv and J. van der Wal, Equilibrium strategies for processor sharing and random queues with relative priorities, Probab. Eng. Inform. Sci. 11 (1997), no. 4, 403-412. https://doi.org/10.1017/S0269964800004940
  3. M. Haviv and J. van der Wal, Waiting times in queues with relative priorities, Oper. Res. Lett. 35 (2007), no. 5, 591-594. https://doi.org/10.1016/j.orl.2006.10.003

Cited by

  1. HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES vol.29, pp.02, 2015, https://doi.org/10.1017/S0269964814000278
  2. Analysis of the M/G/1 queue with discriminatory random order service policy vol.68, pp.3, 2011, https://doi.org/10.1016/j.peva.2010.12.001
  3. Interpolation approximations for the steady-state distribution in multi-class resource-sharing systems vol.91, 2015, https://doi.org/10.1016/j.peva.2015.06.005
  4. M/M/c Retrial Queue with Multiclass of Customers vol.16, pp.4, 2014, https://doi.org/10.1007/s11009-013-9340-0