Dual processes to solve single server systems
From MaRDI portal
Publication:2568425
DOI10.1016/j.jspi.2005.02.010zbMath1075.60117OpenAlexW1996732463MaRDI QIDQ2568425
Publication date: 10 October 2005
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2005.02.010
randomizationM/M/1catastrophessingle server queueing systemtransient probability functionslattice path combinatoricsM/M/1/H
Queueing theory (aspects of probability theory) (60K25) Continuous-time Markov processes on discrete state spaces (60J27)
Related Items (23)
Bijections from Dyck and Motzkin meanders with catastrophes to pattern avoiding Dyck paths ⋮ The single server queue with catastrophes and geometric reneging ⋮ On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue ⋮ Transient probability functions of finite birth-death processes with catastrophes ⋮ Birth-multiple catastrophe processes ⋮ A double-ended queue with catastrophes and repairs, and a jump-diffusion approximation ⋮ Lattice paths with catastrophes ⋮ Grand Dyck paths with air pockets ⋮ LINEAR BIRTH/IMMIGRATION-DEATH PROCESS WITH BINOMIAL CATASTROPHES ⋮ Unnamed Item ⋮ Dyck paths with catastrophes modulo the positions of a given pattern ⋮ Batch renewal arrival process subject to geometric catastrophes ⋮ The Batch Markovian Arrival Process Subject to Renewal Generated Geometric Catastrophes ⋮ Busy period analysis of queue: lattice path approach ⋮ Lattice path counting and the theory of queues ⋮ On batch queueing systems: a combinatorial approach ⋮ Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions ⋮ Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions ⋮ Alternative approaches for the transient analysis of Markov chains with catastrophes ⋮ Gambler's ruin with catastrophes and windfalls ⋮ Stochastic resetting and applications ⋮ Explicit transient probabilities of various Markov models ⋮ The exponential-dual matrix method: Applications to Markov chain analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Transient probability functions of finite birth-death processes with catastrophes
- Birth-multiple catastrophe processes
- Continuous-time Markov chains. An applications-oriented approach
- The combinatorics of birth-death processes and applications to queues
- A continuous-time Markov chain under the influence of a regulating point process and applications in stochastic models with catastrophes
- Transient solution of an M/M/1 queue with catastrophes
- Transient analysis of the M/M/1 queue
- On the Classical Ruin Problems
- A Combinatorial Method in the Theory of Queues
This page was built for publication: Dual processes to solve single server systems