Transient and busy period analysis of the GI/G/1 queue: The method of stages
From MaRDI portal
Publication:1183679
DOI10.1007/BF01159205zbMath0743.60091OpenAlexW4232993953MaRDI QIDQ1183679
Daisuke Nakazato, Dimitris J. Bertsimas
Publication date: 28 June 1992
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01159205
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (9)
Explicit Formulae for the Queue Length Distribution of Batch Arrival Systems ⋮ Predicting the performance of queues -- a data analytic approach ⋮ The Departure Process for Queueing Systems with Batch Arrival of Customers ⋮ Bayesian estimation of finite time ruin probabilities ⋮ Computational Performance of Server Using the Mx/M/1 Queue Model ⋮ The Fourier-series method for inverting transforms of probability distributions ⋮ Busy period analysis of the level dependent \(PH/PH/1/K\) queue ⋮ Robust transient analysis of multi-server queueing systems and feed-forward networks ⋮ Bayesian prediction of the transient behaviour and busy period in short- and long-tailed GI/G/1 queueing systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The busy period of queues which have a matrix-geometric steady state probability vector
- An Analytic Approach to a General Class of G/G/s Queueing Systems
- Transient behavior of the M/M/1 queue via Laplace transforms
- A Simple and Efficient Algorithm to Compute Tail Probabilities from Transforms
- Transient and busy period analysis of the GIG/1 Queue as a Hilbert factorization problem
This page was built for publication: Transient and busy period analysis of the GI/G/1 queue: The method of stages