QUEUE LENGTH DISTRIBUTION IN A QUEUE WITH RELATIVE PRIORITIES
نویسندگان
چکیده
منابع مشابه
Contents Stationary Queue Length Distribution for M / M / 1 / K Queue with Preemptive Priorities 6
This paper analyses a multiple class single server M/M/1/K queue with finite capacity under preemptive service priority discipline. The Poisson process has been used to model the multiple classes of arrival streams. The service times have exponential distribution. Analytical expressions for the flow balanced equations have been derived using Markov chain. This paper presents an analytical solut...
متن کاملThe Israeli Queue with Priorities
We consider a 2-class, single-server, preemptive priority queueing model in which the high-priority customers form a classical M/M/1 queue, while the low-priority customers form the so-called Israeli Queue with at most N different groups and unlimited-size batch service. We provide an extensive probabilistic analysis and calculate key performance measures. Special cases are analyzed and numeric...
متن کاملLoss probability in a finite queue with service interruptions and queue length distribution in the corresponding infinite queue
In this paper, we consider a discrete-time finite-buffer queue with correlated arrivals and service interruptions and the corresponding infinite-buffer queue. Under some assumptions, we derive an exact relation holding between the loss probability in the finite-buffer queue and the queue length distribution in the corresponding infinite-buffer queue. The exact relation is considered as an integ...
متن کاملA finite buffer queue with priorities
We consider a queue with finite buffer where the buffer size limits the amount of work that can be stored in the queue. The arrival process is a Poisson or a Markov modulated Poisson process. The service times (packet lengths) are iid with a general distribution. Our queue models the systems in the Internet more realistically than the usual M/GI/1/K queue which restricts the number of packets i...
متن کاملJoint queue length distribution of multi-class, single-server queues with preemptive priorities
In this paper we analyze an MN/MN/1 queueing system with N customer classes and preemptive priorities between classes, by using matrix-analytic techniques. This leads to an exact method for the computation of the steady state joint queue length distribution. We also indicate how the method can be extended to models with multiple servers and other priority rules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Korean Mathematical Society
سال: 2009
ISSN: 1015-8634
DOI: 10.4134/bkms.2009.46.1.107