Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Exact tail asymptotics for a discrete-time preemptive priority queue

Exact tail asymptotics for a discrete-time preemptive priority queue In this paper, we consider a discrete-time preemptive priority queue with different service completion probabilities for two classes of customers, one with high-priority and the other with low-priority. This model corresponds to the classical preemptive priority queueing system with two classes of independent Poisson customers and a single exponential server. Due to the possibility of customers’ arriving and departing at the same time in a discrete-time queue, the model considered in this paper is more complicated than the continuous-time model. In this model, we focus on the characterization of the exact tail asymptotics for the joint stationary distribution of the queue length of the two types of customers, for the two boundary distributions and for the two marginal distributions, respectively. By using generating functions and the kernel method, we get the exact tail asymptotic properties along the direction of the low-priority queue, as well as along the direction of the high-priority queue. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

Exact tail asymptotics for a discrete-time preemptive priority queue

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/exact-tail-asymptotics-for-a-discrete-time-preemptive-priority-queue-M4s6fkLC3R

References (21)

Publisher
Springer Journals
Copyright
Copyright © 2015 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/s10255-015-0448-6
Publisher site
See Article on Publisher Site

Abstract

In this paper, we consider a discrete-time preemptive priority queue with different service completion probabilities for two classes of customers, one with high-priority and the other with low-priority. This model corresponds to the classical preemptive priority queueing system with two classes of independent Poisson customers and a single exponential server. Due to the possibility of customers’ arriving and departing at the same time in a discrete-time queue, the model considered in this paper is more complicated than the continuous-time model. In this model, we focus on the characterization of the exact tail asymptotics for the joint stationary distribution of the queue length of the two types of customers, for the two boundary distributions and for the two marginal distributions, respectively. By using generating functions and the kernel method, we get the exact tail asymptotic properties along the direction of the low-priority queue, as well as along the direction of the high-priority queue.

Journal

Acta Mathematicae Applicatae Sinica – Springer Journals

Published: Apr 12, 2015

There are no references for this article.