M/M/1 Queueing System with Non-preemptive Priority

Zhao Guo-xi, Hu Qi-Zhou

备注：: 8 pages

英文摘要：

The performance of non-preemptive M/M/1 queueing system with two priority is analyzed. By using complementary variable method to make vector Markov process and analyzing the state-change equations of the queueing system, the generating function of two kinds of customers'length distribution are derived under non-preemptive priority .Through further discussion, the probability of the server that it is working or free and average length of two kinds of customers are also derived.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Optimization of traffic control in MMAP[2]/PH[2]/S priority queueing model with PH retrial times and preemptive repeat policy

The presented study elaborates a multi-server priority queueing model considering the pre-emptive repeat policy and phase-type distribution (PH) for retrial process. The incoming heterogeneous calls are categorized as handoff calls and new calls. The arrival and service processes of both types of calls follow marked Markoian arrival process (MMAP) and PH distribution with distinct parameters, re-spectively. An arriving new call will be blocked when all the channels are occupied, and consequently will join the orbit (virtual space) of infinite capacity to retry following PH distribution. When a…

2021-07-31math.OCmath.PR

On deciding stability of multiclass queueing networks under buffer priority scheduling policies

One of the basic properties of a queueing network is stability. Roughly speaking, it is the property that the total number of jobs in the network remains bounded as a function of time. One of the key questions related to the stability issue is how to determine the exact conditions under which a given queueing network operating under a given scheduling policy remains stable. While there was much initial progress in addressing this question, most of the results obtained were partial at best and so the complete characterization of stable queueing networks is still lacking. In this paper, we resol…

2009-11-19math.OCmath.PR

Peak Age of Information in Priority Queueing Systems

We consider a priority queueing system where a single processor serves k classes of packets that are generated randomly following Poisson processes. Our objective is to compute the expected Peak Age of Information (PAoI) under various scenarios. In particular, we consider two situations where the buffer size at each queue is one and infinite, and in the infinite buffer size case we consider First Come First Serve (FCFS) and Last Come First Serve (LCFS) as service disciplines. For the system with buffer size one at each queue, we derive PAoI exactly for the case of exponential service time and …

2020-11-03cs.ITmath.ITmath.OC

High-Priority Expected Waiting Times in the Delayed Accumulating Priority Queue with Applications to Health Care KPIs

We provide the first analytical expressions for the expected waiting time of high-priority customers in the delayed APQ by exploiting a classical conservation law for work-conserving queues. Additionally, we describe an algorithm to compute the expected waiting times of both low-priority and high-priority customers, which requires only the truncation of sums that converge quickly in our experiments. These insights are used to demonstrate how the accumulation rate and delay level should be chosen by health care practitioners to optimize common key performance indicators (KPIs). In particular, w…

2022-02-10math.OCmath.PR

Queueing Systems with Preferred Service Delivery Times and Multiple Customer Classes

Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service delivery times and gauge the service quality based on the service provider's ability to complete the service as close as possible to the preferred time. Customers can be of different priority classes, and their priority may increase as they wait longer in the queue. The service provider can reject customers upon their arrival if the system is overloaded or ou…

2022-03-02math.OC

Queueing Subject To Action-Dependent Server Performance: Utilization Rate Reduction

We consider a discrete-time system comprising a first-come-first-served queue, a non-preemptive server, and a stationary non-work-conserving scheduler. New tasks enter the queue according to a Bernoulli process with a pre-specified arrival rate. At each instant, the server is either busy working on a task or is available. When the server is available, the scheduler either assigns a new task to the server or allows it to remain available (to rest). In addition to the aforementioned availability state, we assume that the server has an integer-valued activity state. The activity state is non-decr…

2020-08-04math.OCstat.AP

更多相关论文收起更多论文

Congestion analysis of unsignalized intersections

This paper considers an unsignalized intersection used by two traffic streams. A stream of cars is using a primary road, and has priority over the other, low-priority, stream. Cars belonging to the latter stream cross the primary road if the gaps between two subsequent cars on the primary road is larger than their critical headways. Questions that naturally arise are: given the arrival pattern of the cars on the primary road, what is the maximum arrival rate of low-priority cars such that the number of such cars remains stable? In the second place, what can be said about the delay experienced …

2018-02-05math.OCmath.PRphysics.soc-ph