The Foregound-Background Processor-Sharing Queue: a survey
| dc.creator | Nuyens, Misja | |
| dc.date | 2004-12-09 | |
| dc.date | 2005-12-16 | |
| dc.date.accessioned | 2026-07-07T06:39:08Z | |
| dc.date.available | 2026-07-07T06:39:08Z | |
| dc.description | The Foreground-Background (FB) discipline, which gives service to the customer that has received the least amount of service, minimises the queue length for a certain class of heavy-tailed service times. In this paper we give an overview of the results in the literature on single-server queues with the FB discipline. | |
| dc.description | 19 pages | |
| dc.identifier | https://arxiv.org/abs/math/0412182 | |
| dc.identifier | http://arxiv.org/abs/math/0412182 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/100974 | |
| dc.subject | Probability | |
| dc.subject | primary 60K25; secondary 68M20, 90B22 | |
| dc.title | The Foregound-Background Processor-Sharing Queue: a survey | |
| dc.type | text |