Busy period analysis of queue: lattice path approach
From MaRDI portal
Publication:969999
DOI10.1016/J.MCM.2009.04.022zbMATH Open1185.90040OpenAlexW2025185977MaRDI QIDQ969999FDOQ969999
Kanwar Sen, Manju Agarwal, Bidisha Borkakaty
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
Recommendations
- Lattice path approach to busy period density of queueing system \(C_2/C_2/1\)
- scientific article; zbMATH DE number 1058060
- 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
- Distribution of number served during a busy period of GI/M/1/N queues: Lattice path approach
- Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
- A new approach for analyzing the busy period distribution of \(\mathrm{M}/\mathrm{M}/c\) queue
- Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The combinatorics of birth-death processes and applications to queues
- Lattice path counting and \(M/M/c\) queueing systems
- Transient probabilities of a single server priority queueing system
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Title not available (Why is that?)
- Characterizations of generalized hyperexponential distribution functions
- Dual processes to solve single server systems
- Models and Algorithms for Transient Queueing Congestion at Airports
- A note on generalized hyperexponential distributions
- On queues involving batches
- 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
- Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
- Title not available (Why is that?)
- An Application of the Number of Minimal Lattice Paths to the Theory of Queues
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transient analysis of M/M/1 queues in discrete time by general server vacations
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
Cited In (4)
- 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
- Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
- Title not available (Why is that?)
- Analysis of the busy period for the \(\text{M}/\text{M}/c\) queue: An algorithmic approach
This page was built for publication: Busy period analysis of queue: lattice path approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q969999)