Busy period analysis of queue: lattice path approach
From MaRDI portal
Publication:969999
DOI10.1016/J.MCM.2009.04.022zbMath1185.90040OpenAlexW2025185977MaRDI QIDQ969999
Kanwar Sen, Bidisha Borkakaty, Manju Lata Agarwal
Publication date: 8 May 2010
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2009.04.022
Cites Work
- Lattice path approach to busy period density of queueing system \(C_2/C_2/1\)
- Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions
- Combinatorial approach to Markovian queueing models
- Transient probabilities of a single server priority queueing system
- The combinatorics of birth-death processes and applications to queues
- Lattice path counting and \(M/M/c\) queueing systems
- Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
- Dual processes to solve single server systems
- An Application of the Number of Minimal Lattice Paths to the Theory of Queues
- A note on generalized hyperexponential distributions
- Transient analysis of M/M/1 queues in discrete time by general server vacations
- Characterizations of generalized hyperexponential distribution functions
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Models and Algorithms for Transient Queueing Congestion at Airports
- On queues involving batches
- Lattice paths combinatorics applied to transient queue length distribution of C\(_2/\)M/1 queues and busy period analysis of bulk queues C\(_2^b/\)M/1
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Busy period analysis of queue: lattice path approach
