Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline |
| |
Authors: | Shun-Chen Niu |
| |
Institution: | (1) School of Management, The University of Texas at Dallas, P. O. Box 830688, 75083-0688 Richardson, Texas, USA |
| |
Abstract: | We give in this paper a detailed sample-average analysis of GI/G/1 queues with the preemptive-resume LIFO (last-in-first-out) queue discipline: we study the long-run state behavior of the system by averaging over arrival epochs, departure epochs, as well as time, and obtain relations that express the resulting averages in terms of basic characteristics within busy cycles. These relations, together with the fact that the preemptive-resume LIFO queue discipline is work-conserving, imply new representations for both actual and virtual delays in standard GI/G/1 queues with the FIFO (first-in-first-out) queue discipline. The arguments by which our results are obtained unveil the underlying structural explanations for many classical and somewhat mysterious results relating to queue lengths and/or delays in standard GI/G/1 queues, including the well-known Bene's formula for the delay distribution in M/G/l. We also discuss how to extend our results to settings more general than GI/G/1. |
| |
Keywords: | GI/G/1 queues actual and virtual delays preemptive-resume LIFO queue discipline Pollaczek-Khintchine formula |
本文献已被 SpringerLink 等数据库收录! |
|