A retrial queueing system with processor sharing
From MaRDI portal
Recommendations
- Performance modeling of cellular systems with finite processor sharing queues in random environment, guard policy and flex retrial users
- On the \(BMAP_1\), \(BMAP_2/PH/g\), \(c\) retrial queueing system
- A retrial queueing system with alternating inter-retrial time distribution
- A retrial BMAP/PH/N system
- \(\text{MAP}_1, \text{MAP}_2/\text{M/}c\) retrial queue with guard channels and its application to cellular networks
Cites work
- Algorithms for the multi-server queue with phase type service
- An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3783337 (Why is no real title available?)
- Independent markov processes in parallel
- Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory
- On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
- Processor sharing: a survey of the mathematical theory
- Queues with marked customers
- Sojourn time distribution in a MAP/M/1 processor-sharing queue
- The Theory of Queuing Systems with Correlated Flows
Cited in
(4)- Performance modeling of cellular systems with finite processor sharing queues in random environment, guard policy and flex retrial users
- Mobile customer model with retrials
- A retrial queue to model a two-relay cooperative wireless system with simultaneous packet reception
- Analysis of retrial queuing system with limited processor sharing discipline and changing effective bandwidth
This page was built for publication: A retrial queueing system with processor sharing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1980496)