Analysis of queueing systems with customer interjections
type: Item
instance of: scholarly article
title: Analysis of queueing systems with customer interjections
zbMATH Open document ID: 1270.60101
author: Qi-Ming He
author: Alireza A. Chavoushi
published in: Queueing Systems
publication date: 2013-01-28T00:00:00Z
review text: The paper deals with a single server queueing system, where two types of customers, which join a single queue of infinite capacity, arrive according to a Poisson process. The first type of customers are normal customers and join the queue at the end, whereas the second type of customers are interjecting customers which do not interrupt the service in progress and try to cut in the queue as follows. Upon arrival, the customer contacts the first customer waiting in the queue for a possible interjection. That customer (regardless of its type) may let the new customer cut in with probability \(\eta_C\), i.e., the new customer takes the first position in the queue. If the first customer refuses the interjection request, the new customer contacts the second customer in the queue. The process repeats until either the customer interjects successfully or joins the queue at the end if all customers refuse its interjection request. The service times of all customers are exponentially distributed with the same mean. For this system, denoted by M[2]/M/1/FCFS, the waiting times of normal customers and interjecting customers are studied; in particular, their mean and variance are characterized analytically and numerically. The basic queueing model is extended to an MMAP[2]/PH/1/FCFS queue, and an algorithm is developed for computing the means and variances of the waiting times of normal, interacting and arbitrary customers. The results are obtained by using matrix analytic methods. Furthermore, numerical results are presented.
reviewed by: Andreas Brandt
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J20
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6131913
zbMATH Keywords: single server queueing system
zbMATH Keywords: interjection
zbMATH Keywords: priority queue
zbMATH Keywords: waiting time
zbMATH Keywords: stochastic order
zbMATH Keywords: matrix-analytic methods
MaRDI profile type: Publication
full work available at URL: s11134-012-9302-1
OpenAlex ID: W1984895351
cites work: Pricing and Priority Auctions in Queueing Systems with a Generalized Delay Cost Structure
cites work: Marked point processes as limits of Markovian arrival streams
cites work: Q2730382
cites work: Q3938929
cites work: Means and variances of time averages in Markovian environments
cites work: To queue or not to queue: equilibrium behavior in queueing systems.
cites work: Markov chains with marked transitions
cites work: Optimum Bribing for Queue Position
cites work: Q4101255
cites work: Introduction to Matrix Analytic Methods in Stochastic Modeling
cites work: Inequalities: theory of majorization and its applications
cites work: Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
cites work: Q3923308
cites work: Generalizations of the Pollaczek-Khinchin integral equation in the theory of queues
cites work: Non-negative matrices and Markov chains.
cites work: Q4301147
cites work: The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
cites work: Deciding Which Queue to Join: Some Counterexamples
cites work: The amount of overtaking in a network of queues
cites work: Queueing Analysis of a Jockeying Model
DOI: 10.1007/S11134-012-9302-1
description: scientific article; zbMATH DE number 6131913