Approach to Evaluating Characteristics of Multichannel Loss System with FCFD Preempted Priority Discipline

In the paper we consider a multichannel loss preemptive priority system with a Poisson input and general service time distribution depending on the priority of job. Jobs of the same priority are preempted according with First Come First Displaced (FCFD) protocol. Approximate formulas are obtained for the loss probability of a prescribed priority job and some other characteristics of the system. It particular cases, the obtained formulas are exact.Comment: 6 pages, no figures. arXiv admin note: text overlap with arXiv:2206.0926

On completion times in a two-class priority queue with impatience loane Muni Toke

Abstract: In this note, we consider a two-class priority queueing system with Poisson arrivals, general service time distribution and one server, in which customers that are not currently being served may leave the queue according to exponentially distributed patience times, i.e., a M 1 , M 2 /G/1 + M system using a generalised Kendall's notation. We expand the classic methodology to derive analytical formulas for the completion times in such a system, using preemptive repeat different and preemptive repeat identical disciplines. Known average completion times for priority queues without impatience are retrieved as limit cases. Keywords: priority queues; queues with impatience; reneging; completion times; preemptive disciplines. Reference to this paper should be made as follows: Toke, I.M. (2014) 'On completion times in a two-class priority queue with impatience', Int

Approximations for the waiting-time distribution in an M/P H/c priority queue

We investigate the use of priority mechanisms when assigning service engineers to customers as a tool for service differentiation. To this end, we analyze a non-preemptive M/PH/c priority queue with various customer classes. For this queue, we present various accurate and fast methods to estimate the first two moments of the waiting time per class given that all servers are occupied. These waiting time moments allow us to approximate the overall waiting time distribution per class. We subsequently apply these methods to real-life data in a case study

Analysis of a two-class single-server discrete-time FCFS queue : the effect of interclass correlation

In this paper, we study a discrete-time queueing system with one server and two classes of customers. Customers enter the system according to a general independent arrival process. The classes of consecutive customers, however, are correlated in a Markovian way. The system uses a global FCFS service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their classes. The service-time distribution of the customers is general but class-dependent, and therefore, the exact order in which the customers of both classes succeed each other in the arrival stream is important, which is reflected by the complexity of the system content and waiting time analysis presented in this paper. In particular, a detailed waiting time analysis of this kind of multi-class system has not yet been published, and is considered to be one of the main novelties by the authors. In addition to that, a major aim of the paper is to estimate the impact of interclass correlation in the arrival stream on the total number of customers in the system, and the customer delay. The results reveal that the system can exhibit two different classes of stochastic equilibrium: a strong equilibrium where both customer classes give rise to stable behavior individually, and a compensated equilibrium where one customer type creates overload

15 september 2010: de internationale dag van de democratie

Since 2008 the International Community has been observing annually the International Day of Democracy. This article examines what exactly the international community celebrates on that day. In other words it is analyzed how the concept of democracy is defined within the UN framework