The recursive solution of queue length for Geo/G/1 queue with N-policy
From MaRDI portal
Publication:488893
Recommendations
- Analysis of the GI/Geo/1 queue with \(N\)-policy
- Queue size distribution of Geo/G/\(1\) queue under the \(\operatorname{Min}(N,D)\)-policy
- Queue-length distribution and capacity optimum design for a Geo/G/1 queueing system with N-policy and set-up time
- Recursive solution of queue length distribution for queue with single server vacation and variable input rate
- Queue length distribution for \(\mathrm{Geo}/\mathrm{G}/1\) queue with \(\theta\)-entering discipline during multiple adaptive vacations
Cites work
Cited in
(15)- Analysis of the GI/Geo/1 queue with \(N\)-policy
- The queue \(\mathrm{Geo}/\mathrm{G}/1/N + 1\) revisited
- Queue size distribution on a new ND policy \(Geo/G/1\) queue and its computation designs
- System capacity optimization design and optimal threshold \(N^*\) for a \(\mathrm{Geo}/\mathrm{G}/1\) discrete-time queue with single server vacation and under the control of \(\mathrm{Min}(N,V)\)-policy
- Queue size distribution of Geo/G/\(1\) queue under the \(\operatorname{Min}(N,D)\)-policy
- scientific article; zbMATH DE number 5733255 (Why is no real title available?)
- Performance and reliability analysis of a repairable discrete-time Geo/G/\(1\) queue with Bernoulli feedback and randomized policy
- Analysis of a discrete-time \(\mathrm{Geo}^{\lambda_1,\lambda_2}/\mathrm{G}/1\) queue with \(N\)-policy and \(D\)-policy
- Optimal power consumption control of sensor node based on \((N,D)\)-policy discrete-time queues
- An N-policy discrete-time Geo/G/1 queue with modified multiple server vacation
- Analysis of M/G/1 queue with bi-level threshold (m,N)-policy and uninterrupted single vacation
- The recursive solution for \(Geom/G/1(E,SV)\) queue with feedback and single server vacation
- Recursive solution of queue length distribution for queue with single server vacation and variable input rate
- Optimal (r,N)-policy for discrete-time Geo/G /1 queue with different input rate and setup time
- A recursive method for the F-policy G/M/1/K queueing system with an exponential startup time
This page was built for publication: The recursive solution of queue length for \(\mathrm{Geo}/G/1\) queue with \(N\)-policy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488893)