Delay cycle analysis of finite-buffer M/G/1 queues and its application to the analysis of M/G/1 priority queues with finite and infinite buffers

N , n -Preemptive-Priority M/G/1 Queues with Finite and Infinite Buffers

“…Compared to the previous studies [13][14][15]20], there are a couple of distinguishable contributions in this article. Unlike [15,20], where infinite-buffer priority queues are considered, this study deals with a priority queue with finite and infinite buffers.…”

“…For this reason, there have been recent studies on preemption-based scheduling methods for communication systems that accommodate both high-volume multimedia traffic and delay-sensitive traffic [2][3][4][5][6]. In this line of thought, [13] has recently analyzed an M/G/1/ðK, ∞Þ priority queueing model under the preemptive-resume priority discipline as well as under the nonpreemptive one. To do this, [13] developed a delay cycle analysis of singleclass finite-buffer M/G/1 queues and combined it with the traditional delay cycle analysis of infinite-buffer M/G/ 1 priority queues.…”

“…In this line of thought, [13] has recently analyzed an M/G/1/ðK, ∞Þ priority queueing model under the preemptive-resume priority discipline as well as under the nonpreemptive one. To do this, [13] developed a delay cycle analysis of singleclass finite-buffer M/G/1 queues and combined it with the traditional delay cycle analysis of infinite-buffer M/G/ 1 priority queues. [14] also has studied M/G/1ðK, ∞Þ priority queues under the preemptive-repeat-different priority discipline as well as under the preemptive-repeat-identical discipline.…”

“…In this study, we further extend the method proposed in [13] to a more sophisticated M/G/1/ðK, ∞Þ priority queueing model under the ðN, nÞ-preemptive priority discipline. The ðN, nÞ-preemptive priority discipline was proposed in [15] to deal with the drawbacks of the classical nonpreemptive and preemptive priority disciplines.…”

“…In this study, the delay cycle analysis of finite-buffer M/ G/1 queues proposed in [13], where the waiting time distribution of the delay cycle is derived, is extended to develop a queue length version of the delay cycle analysis of finitebuffer M/G/1 queues. The reason for this is that the derivation of queue length distributions is more straightforward under the ðN, nÞ-preemptive priority discipline.…”