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
From MaRDI portal
Publication:5957837
DOI10.1016/S0378-3758(01)00146-XzbMath0996.60103OpenAlexW2044790913MaRDI QIDQ5957837
Kanwar Sen, Manju Lata Agarwal
Publication date: 31 October 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(01)00146-x
busy period densityC\(_2\)-discretized systemCox distributionlattice paths combinatoricstransient queue length distribution
Related Items
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, Lattice path approach for busy period density of \(M/G/1\) queues using \(C_{3}\) Coxian distribution, Busy period analysis of queue: lattice path 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
Cites Work
- Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
- Combinatorial approach to Markovian queueing models
- Transient analysis of queues with heterogeneous arrivals
- On the transient waiting times for a GI/M/1 priority queue
- The transient BMAP/G/l queue
- Characterizations of generalized hyperexponential distribution functions
- Markov Processes Representing Traffic in Connecting Networks
- Discrete-Time Queuing Theory
- A Combinatorial Method in the Theory of Queues
- 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
