Approximate Performance Measures for a Single Station Two-Stage Reneging Queue

2020/05/07 by Katsunobu Sasanuma, Sasanuma, Katsunobu, Alan Scheller‐Wolf +1
Business, Management and Accounting · Computer Science · Engineering · #Advanced Queuing Theory Analysis #Advanced Wireless Network Optimization #FOS: Mathematics #Probability (math.PR) #Wireless Communication Networks Research

paper · pdf · doi:10.48550/arxiv.2005.03239

openalex publication_date 2020/05/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive approximate analytical formulas representing performance measures for our two-stage queue following the Markov chain decomposition approach. Our formulas not only give accurate results spanning the heavy-traffic to the light-traffic regimes, but also provide insight into capacity decisions.

Related

• Controlling arrival and service rates to reduce sensitivity of queueing systems with customer abandonment
• New Perspectives on the Erlang-A Queue
• Large Deviations for the Single Server Queue and the Reneging Paradox
• Comparisons of Standard and Ticket Queues
• Finite-Time Behavior of Erlang-C Model: Mixing Time, Mean Queue Length and Tail Bounds