Lattice path approach to transient solution of \(M/M/1\) with (\(0,k\)) control policy
From MaRDI portal
Publication:1209659
DOI10.1016/0378-3758(93)90010-4zbMath0765.60099OpenAlexW2047792282MaRDI QIDQ1209659
J. M. Gupta, Kanwar Sen, Joti L. Jain
Publication date: 16 May 1993
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(93)90010-4
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Combinatorial probability (60C05)
Related Items
Transient analysis of queues with heterogeneous arrivals, Lattice path counting and \(M/M/c\) queueing systems, 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, The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach, Combinatorial approach to Markovian queueing models, 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
Cites Work
- A Poisson input queue under \(N\)-policy and with a general start up time
- The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- Duality and Other Results for M/G/1 and GI/M/1 Queues, Via a New Ballot Theorem
- A modified random walk in the presence of partially reflecting barriers
- A sample path analysis of the M/M/1 queue
- Combinatorial Methods in the Theory of Queues
- Optimal Operating Policies for M/G/1 Queuing Systems
- On Lattice Paths with Several Diagonal Steps
- Characterization and Computation of Optimal Policies for Operating an M/G/1 Queuing System with Removable Server
- On queues involving batches
- On Certain Probability Models in Random Walk
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
