The equivalence of the transient behaviour formulae for the single server queue
From MaRDI portal
Publication:4542194
DOI10.1081/SAP-120003442zbMath0999.60084MaRDI QIDQ4542194
Publication date: 25 November 2002
Published in: Stochastic Analysis and Applications (Search for Journal in Brave)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (2)
A new formula for the busy period of a non-empty multiserver queueing system ⋮ Exact transient solutions of nonempty Markovian queues
Cites Work
- Unnamed Item
- Unnamed Item
- Transient behaviour of an M/M/1/N queue
- The transient solution of M/M/1 queues under (M,N)-policy. A combinatorial approach
- THE JOINT ARRIVAL AND DEPARTURE PROCESS FOR THE M/M/l QUEUE
- Transient solution to the many-server Poisson queue: a simple approach
- Transient behavior of the M/M/1 queue via Laplace transforms
- Further comments on the solution of the M/M/1 queue
- Some New Results for the M/M/1 Queue
- A Simple Formula for the Transient State Probabilities of an M/M/1/∞Queue
- A sample path analysis of the M/M/1 queue
- On a new formula for the transient state probabilities for M/M/1 queues and computational implications
This page was built for publication: The equivalence of the transient behaviour formulae for the single server queue