JOURNAL BROWSE
Search
Advanced SearchSearch Tips
QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES
Kim, Jeong-Sim;
  PDF(new window)
 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
M/G/1 queue;relative priority model;queue length distribution;
 Language
English
 Cited by
1.
HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES, Probability in the Engineering and Informational Sciences, 2015, 29, 02, 153  crossref(new windwow)
2.
Analysis of the M/G/1 queue with discriminatory random order service policy, Performance Evaluation, 2011, 68, 3, 256  crossref(new windwow)
3.
Interpolation approximations for the steady-state distribution in multi-class resource-sharing systems, Performance Evaluation, 2015, 91, 56  crossref(new windwow)
4.
M/M/c Retrial Queue with Multiclass of Customers, Methodology and Computing in Applied Probability, 2014, 16, 4, 931  crossref(new windwow)
 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. crossref(new window)

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. crossref(new window)

3.
M. Haviv and J. van der Wal, Waiting times in queues with relative priorities, Oper. Res. Lett. 35 (2007), no. 5, 591-594. crossref(new window)