39 research outputs found
Analysis of Multiserver Retrial Queueing System: A Martingale Approach and an Algorithm of Solution
The paper studies a multiserver retrial queueing system with servers.
Arrival process is a point process with strictly stationary and ergodic
increments. A customer arriving to the system occupies one of the free servers.
If upon arrival all servers are busy, then the customer goes to the secondary
queue, orbit, and after some random time retries more and more to occupy a
server. A service time of each customer is exponentially distributed random
variable with parameter . A time between retrials is exponentially
distributed with parameter for each customer. Using a martingale
approach the paper provides an analysis of this system. The paper establishes
the stability condition and studies a behavior of the limiting queue-length
distributions as increases to infinity. As , the paper
also proves the convergence of appropriate queue-length distributions to those
of the associated `usual' multiserver queueing system without retrials. An
algorithm for numerical solution of the equations, associated with the limiting
queue-length distribution of retrial systems, is provided.Comment: To appear in "Annals of Operations Research" 141 (2006) 19-52.
Replacement corrects a small number of misprint
Fluid Approximation of a Call Center Model with Redials and Reconnects
In many call centers, callers may call multiple times. Some of the calls are
re-attempts after abandonments (redials), and some are re-attempts after
connected calls (reconnects). The combination of redials and reconnects has not
been considered when making staffing decisions, while ignoring them will
inevitably lead to under- or overestimation of call volumes, which results in
improper and hence costly staffing decisions. Motivated by this, in this paper
we study call centers where customers can abandon, and abandoned customers may
redial, and when a customer finishes his conversation with an agent, he may
reconnect. We use a fluid model to derive first order approximations for the
number of customers in the redial and reconnect orbits in the heavy traffic. We
show that the fluid limit of such a model is the unique solution to a system of
three differential equations. Furthermore, we use the fluid limit to calculate
the expected total arrival rate, which is then given as an input to the Erlang
A model for the purpose of calculating service levels and abandonment rates.
The performance of such a procedure is validated in the case of single
intervals as well as multiple intervals with changing parameters
A Note on an M/M/s Queueing System with two Reconnect and two Redial Orbits
A queueing system with two reconnect orbits, two redial (retrial) orbits, s servers and two independent Poisson streams of customers is considered. An arriving customer of type i, i = 1, 2 is handled by an available server, if there is any; otherwise, he waits in an infinite buffer queue. A waiting customer of type i who did not get connected to a server will lose his patience and abandon after an exponentially distributed amount of time, the abandoned one may leave the system (lost customer) or move into one of the redial orbits, from which he makes a new attempt to reach the primary queue, and when a customer finishes his conversation with a server, he may comeback to the system, to one of the reconnect orbits where he will wait for another service. In this paper, a fluid model is used to derive a first order approximation for the number of customers in the redial and reconnect orbits in the heavy traffic. The fluid limit of such a model is a unique solution to a system of three differential equations
Critically loaded multi-server queues with abandonments, retrials, and time-varying parameters
In this paper, we consider modeling time-dependent multi-server queues that
include abandonments and retrials. For the performance analysis of those, fluid
and diffusion models called "strong approximations" have been widely used in
the literature. Although they are proven to be asymptotically exact, their
effectiveness as approximations in critically loaded regimes needs to be
investigated. To that end, we find that existing fluid and diffusion
approximations might be either inaccurate under simplifying assumptions or
computationally intractable. To address that concern, this paper focuses on
developing a methodology by adjusting the fluid and diffusion models so that
they significantly improve the estimation accuracy. We illustrate the accuracy
of our adjusted models by performing a number of numerical experiments
Performance analysis of time-dependent queueing systems: survey and classification
Many queueing systems are subject to time-dependent changes in system parameters, such as the arrival
rate or number of servers. Examples include time-dependent call volumes and agents at inbound call
centers, time-varying air traffic at airports, time-dependent truck arrival rates at seaports, and cyclic message volumes in computer systems.There are several approaches for the performance analysis of queueing systems with deterministic parameter changes over time. In this survey, we develop a classification scheme that groups these approaches according to their underlying key ideas into (i) numerical and analytical solutions,(ii)approaches based on models with piecewise constant parameters, and (iii) approaches based on mod-ified system characteristics. Additionally, we identify links between the different approaches and provide a survey of applications that are categorized into service, road and air traffic, and IT systems
EUROPEAN CONFERENCE ON QUEUEING THEORY 2016
International audienceThis booklet contains the proceedings of the second European Conference in Queueing Theory (ECQT) that was held from the 18th to the 20th of July 2016 at the engineering school ENSEEIHT, Toulouse, France. ECQT is a biannual event where scientists and technicians in queueing theory and related areas get together to promote research, encourage interaction and exchange ideas. The spirit of the conference is to be a queueing event organized from within Europe, but open to participants from all over the world. The technical program of the 2016 edition consisted of 112 presentations organized in 29 sessions covering all trends in queueing theory, including the development of the theory, methodology advances, computational aspects and applications. Another exciting feature of ECQT2016 was the institution of the TakĂĄcs Award for outstanding PhD thesis on "Queueing Theory and its Applications"
Overlapping time of a virtual customer in time-varying many-server queues
Motivated by the ongoing COVID-19 pandemic, this paper investigates
customers' infection risk by evaluating the overlapping time of a virtual
customer with others in queueing systems. Most of the current methodologies
focus on characterizing the risk in stationary systems, which may not apply to
the more practical time-varying systems. As such, we propose an approximation
framework that relies on the fluid limit to compute the expected overlapping
time in time-varying queueing systems. Simulation experiments verify the
accuracy of our approach