Diffusion approximation for a processor sharing queue in heavy traffic
| dc.creator | Gromoll, H. Christian | |
| dc.date | 2004-05-14 | |
| dc.date.accessioned | 2026-07-07T05:08:18Z | |
| dc.date.available | 2026-07-07T05:08:18Z | |
| dc.description | Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps track of the residual service times of all jobs in the system at any given time. From this measure valued process, one can recover the traditional performance processes, including queue length and workload. We show that under mild assumptions, including standard heavy traffic assumptions, the (suitably rescaled) measure valued processes corresponding to a sequence of processor sharing queues converge in distribution to a measure valued diffusion process. The limiting process is characterized as the image under an appropriate lifting map, of a one-dimensional reflected Brownian motion. As an immediate consequence, one obtains a diffusion approximation for the queue length process of a processor sharing queue. | |
| dc.identifier | https://arxiv.org/abs/math/0405298 | |
| dc.identifier | http://arxiv.org/abs/math/0405298 | |
| dc.identifier | Annals of Applied Probability 2004, Vol. 14, No. 2, 555-611 | |
| dc.identifier | doi:10.1214/105051604000000035 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/71206 | |
| dc.subject | Probability | |
| dc.subject | 60K25 (Primary) 68M20, 90B22. (Secondary) | |
| dc.title | Diffusion approximation for a processor sharing queue in heavy traffic | |
| dc.type | text |