Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times
From MaRDI portal
Publication:1149698
DOI10.1007/BF01719856zbMATH Open0454.60076OpenAlexW4253001882MaRDI QIDQ1149698FDOQ1149698
Authors: Henk Tijms, M. H. van Hoorn 
Publication date: 1981
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01719856
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS
- Regenerative processes in the theory of queues, with applications to the alternating-priority queue
- The Steady-State Queueing Time Distribution for the M/G/1 Finite Capacity Queue
- Title not available (Why is that?)
- A Simple Proof of the Equivalence of the Limiting Distributions of the Continuous-Time and the Embedded Process of the Queue Size in the M/G/1 Queue
Cited In (5)
- Asymptotic expansions for waiting time probabilities in an \(M/G/1\) queue with long-tailed service time
- Analysis of finite-buffer state-dependent bulk queues
- Computation of the state probabilities in M/G/1 queues with state dependent input and state dependent service
- The SPP/G/1 queue: A single server queue with a switched Poisson process as input process
- Reliability analysis of a parallel system with exponential life times and phase type repairs
This page was built for publication: Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149698)
