A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues
From MaRDI portal
Publication:1339074
DOI10.1007/BF01158700zbMath0806.60085MaRDI QIDQ1339074
Publication date: 12 February 1995
Published in: Queueing Systems (Search for Journal in Brave)
iterative algorithm; Laplace-Stieltjes transform; queue length distribution; queues with state-dependent services
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Analysis of \(GI/M(n)/1/N\) queue with state-dependent multiple working vacations, Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\), Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\), A preemptive discrete-time priority buffer system with partial buffer sharing, A queueing model for optimal control of partial buffer sharing in ATM, Duality relations for queues with arrival and service control, \(M(n)/G/1/N\) queues with generalized vacations, Studying an overload system using rotation, Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of the state probabilities in M/G/1 queues with state dependent input and state dependent service
- A recursive method to compute the steady state probabilities of the machine interference model: (M/G/1)/\(K\)
- Queues Subject to Service Interruption
- The System Point Method in Exponential Queues: A Level Crossing Approach
- A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes
- The G/M/m queue with finite waiting room
- On a Single-Server Finite Queuing Model with State-Dependent Arrival and Service Processes
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
