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
(Redirected from Publication:1149698)
Cites work
- scientific article; zbMATH DE number 3647910 (Why is no real title available?)
- scientific article; zbMATH DE number 3174015 (Why is no real title available?)
- scientific article; zbMATH DE number 3174016 (Why is no real title available?)
- scientific article; zbMATH DE number 3338194 (Why is no real title available?)
- A NUMERICAL METHOD FOR THE STEADY-STATE PROBABILITIES OF A G1/G/C QUEUING SYSTEM IN A GENERAL CLASS
- 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
- 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
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)
