Waiting times in queues with relative priorities

Authors:
Moshe Haviv;Jan Van Der Wal
Affiliations:
Department of Statistics, The Hebrew University of Jerusalem, 91905 Jerusalem, Israel;Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands and Faculty of Economics and Business, University of Amsterdam, Amsterdam, The Nethe ...
Venue:
Operations Research Letters
Year:
2007

Citing 2
Cited 2

Sharing a Processor Among Many Job Classes

Journal of the ACM (JACM)
A survey on discriminatory processor sharing

Queueing Systems: Theory and Applications

Analysis of the M/G/1 queue with discriminatory random order service policy

Performance Evaluation
Heavy traffic analysis of the discriminatory randomorderofservice discipline

ACM SIGMETRICS Performance Evaluation Review - Special Issue on IFIP PERFORMANCE 2011- 29th International Symposium on Computer Performance, Modeling, Measurement and Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter.