Coupling in the queue with impatience: case of several servers

DOI10.1007/S10626-019-00280-2MaRDI QIDQ2286329zbMATH OpenOpenAlexFDO

Authors Pascal Moyal

Publication date 22 January 2020

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

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

zbMATH Keywords

couplingergodic theoryreal-time queueing systemsstochastic recursive sequences

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Abstract: We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic recursions, we propose a sufficient condition of existence of a unique stationary state of the system using Renovation theory. Whenever this condition is relaxed we use extension techniques to prove the existence of a stationary state in some cases.

Recommendations

• The queue with impatience: construction of the stationary workload under FIFO
• Strong stability and uniform ergodicity estimates for the waiting process in queueing models with impatient customers
• scientific article; zbMATH DE number 3858809
• STABILITY IN QUEUES WITH IMPATIENT CUSTOMERS
• Construction of the stationary regime of queues with locking

Cites work

• A correction and some additional remarks on: Stationary solutions of stochastic recursions describing discrete event systems
• A generalized backward scheme for solving nonmonotonic stochastic recursions
• A method for solving a class of recursive stochastic equations
• Convex comparison of service disciplines in real time queues
• Ergodicity of stochastic processes describing the operation of open queueing networks
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• scientific article; zbMATH DE number 3858809 (Why is no real title available?)
• scientific article; zbMATH DE number 3866333 (Why is no real title available?)
• scientific article; zbMATH DE number 3874381 (Why is no real title available?)
• scientific article; zbMATH DE number 4078457 (Why is no real title available?)
• scientific article; zbMATH DE number 1947316 (Why is no real title available?)
• scientific article; zbMATH DE number 1460450 (Why is no real title available?)
• scientific article; zbMATH DE number 3322728 (Why is no real title available?)
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• On queues with impatience: stability, and the optimality of earliest deadline first
• On the stability of a class of non-monotonic systems of parallel queues
• On the Theory of Queues With Many Servers
• Perfect sampling for infinite server and loss systems
• Single-server queues with impatient customers
• Stationary solutions of stochastic recursions describing discrete event systems
• Stochastic modeling and analysis of telecoms networks
• The queue with impatience: construction of the stationary workload under FIFO

Cited in

(4)

• Construction of the stationary regime of queues with locking
• The queue with impatience: construction of the stationary workload under FIFO
• When Service Times Depend on Customers’ Delays: A Relationship Between Two Models of Dependence
• Two coupled queues with vastly different arrival rates: critical loading case

This page was built for publication: Coupling in the queue with impatience: case of several servers

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