Processor Sharing Queues with Impatience
概率论
2009-08-25 v1
摘要
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by measure valued Markov processes on R^2\_+. A scaling procedure that gives rise to a fluid model with a nontrivial, yet tractable steady state behavior, is presented. This fluid model model captures many essential features of the underlying stochastic model, and it is used to analyze the impact of impatience in processor sharing queues.
引用
@article{arxiv.math/0604215,
title = {Processor Sharing Queues with Impatience},
author = {Christian H. Gromoll and Philippe Robert and Bert Zwart},
journal= {arXiv preprint arXiv:math/0604215},
year = {2009}
}