Tail asymptotics for the M₁,M₂/G₁,G₂/1 retrial queue with non-preemptive priority

DOI10.1007/S11134-020-09666-8MaRDI QIDQ2220362zbMATH OpenOpenAlexFDO

Authors Bin Liu, Yiqiang Q. Zhao

Publication date 22 January 2021

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.05342

zbMATH Keywords

exhaustive stochastic decomposition approachnumber of customerspriority queueregularly varying distributionretrial queuestationary distributiontail asymptotics

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Abstract: Stochastic networks with complex structures are key modelling tools for many important applications. In this paper, we consider a specific type of network: the retrial queueing systems with priority. This type of queueing system is important in various applications, including telecommunication and computer management networks with big data. For this type of system, we propose a detailed stochastic decomposition approach to study its asymptotic behaviour of the tail probability of the number of customers in the steady-state for retrial queues with two types (Type-1 and Type-2) of customers, in which Type-1 customers (in a queue) have non-preemptive priority to receive service over Type-2 customers (in an orbit). Under the assumption that the service times of Type-1 customers have a regularly varying tail and the service times of Type-2 customers have a tail lighter than Type-1 customers, we obtain tail asymptotic properties for the number of customers in the queue and in the orbit, respectively, conditional on the server's status, in terms of a detailed stochastic decomposition approach. Tail asymptotic properties are often used as key tools for approximating various performance metrics and constructing numerical algorithms for computations.

Recommendations

• On the single server retrial queue with priority customers
• scientific article; zbMATH DE number 1783861
• Tail asymptotics for \(M/M/c\) retrial queues with non-persistent customers
• scientific article; zbMATH DE number 1240557
• On the performance of the M₁,M₂/G₁,G₂/1 retrial queue with pre-emptive resume policy

Cites work

• A discrete-time Geo/G/1 retrial queue with preferred and impatient customers
• A mixed priority retrial queue with negative arrivals, unreliable server and multiple vacations
• A survey of retrial queueing systems
• A survey of retrial queues
• An Introduction to Heavy-Tailed and Subexponential Distributions
• Analysis of a single-server retrial queue with quasi-random input and nonpreemptive priority
• Analyzing retrial queues by censoring
• Bayesian inference for queueing networks and modeling of internet services
• Comparison methods for stochastic models and risks
• Discrete-time Geo\(^X\)/G/1 queue with preemptive resume priority
• scientific article; zbMATH DE number 43570 (Why is no real title available?)
• scientific article; zbMATH DE number 1257656 (Why is no real title available?)
• scientific article; zbMATH DE number 1026574 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1
• On the single server retrial queue with priority customers
• On the single server retrial queue with priority subscribers and server breakdowns
• Regularly varying tail of the waiting time distribution in M/G/1 retrial queue
• Retrial Queueing Systems
• Sampling at a random time with a heavy-tailed distribution
• Sampling at subexponential times, with queueing applications
• Single server retrial queues with priority calls.
• Sojourn time tails in the single server queue with heavy-tailed service times
• Stationary analysis of a retrial queue with preemptive repeated attempts
• Tail asymptotics for \(M/M/c\) retrial queues with non-persistent customers
• Tail Asymptotics for the Queue Size Distribution in an M/G/1 Retrial Queue
• Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times

Cited in

(8)

• scientific article; zbMATH DE number 1240557 (Why is no real title available?)
• Tail asymptotics of the queue size distribution in the M/M/m retrial queue
• Tail probabilities in queueing processes
• Refined tail asymptotic properties for the M^X/G/1 retrial queue
• Analysis of a retrial queueing system with priority service and modified multiple vacations
• Retrial queues with constant retrial times
• Numerical computations and tail asymptotics for stationary indices of a discrete-time queue
• Tail asymptotics for the queue size distribution in the \(MAP/G/1\) retrial queue

This page was built for publication: Tail asymptotics for the \(M_1,M_2/G_1,G_2/1\) retrial queue with non-preemptive priority

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220362)