Combinatorial approach to Markovian queueing models
From MaRDI portal
Publication:1209660
DOI10.1016/0378-3758(93)90011-TzbMath0766.60117OpenAlexW2056411352MaRDI QIDQ1209660
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)90011-t
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Combinatorial probability (60C05)
Related Items (9)
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 ⋮ 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 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 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
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- The Distribution of the Maximum Length of a Poisson Queue During a Busy Period
- The Trivariate Distribution of the Maximum Queue Length, the Number of Customers Served and the Duration of the Busy Period for the M/G/1 Queueing System
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorial approach to Markovian queueing models
