Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution
DOI10.1016/j.apm.2006.08.005zbMath1142.60060OpenAlexW2049216546MaRDI QIDQ2470263
Bidisha Borkakaty, Kanwar Sen, Manju Lata Agarwal
Publication date: 14 February 2008
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2006.08.005
Non-Markovian processes: estimation (62M09) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)
Related Items (2)
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
- Combinatorial approach to Markovian queueing models
- Distribution of number served during a busy period of GI/M/1/N queues: Lattice path approach
- Lattice path approach to transient analysis of M/G/1/N non-Markovian queues using Cox distributions
- A new approach to the busy period of the M/M/1 queue
- Services within a busy period of an M/M/1 queue and Dyck paths
- Lattice path counting and \(M/M/c\) queueing systems
- An Application of the Number of Minimal Lattice Paths to the Theory of Queues
- Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
- A note on generalized hyperexponential distributions
- Transient analysis of M/M/1 queues in discrete time by general server vacations
- ON THE RELIABILITY OF GAVER'S PARALLEL SYSTEM SUSTAINED BY A COLD STANDBY UNIT AND ATTENDED BY TWO REPAIRMEN
- Characterizations of generalized hyperexponential distribution functions
- A sample path analysis of the M/M/1 queue
- Safety Stock versus Safety Time in MRP Controlled Production Systems
- Combinatorial Methods in the Theory of Queues
- On Lattice Paths with Several Diagonal Steps
- On queues involving batches
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- The busy period of the M/GI/\(\infty\) queue
- 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
This page was built for publication: Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution