Finite capacity single-server queue with Poisson input, general service and delayed renovation
From MaRDI portal
Publication:2079417
Recommendations
- The general renovation as the active queue management mechanism. Some aspects and results
- Queueing systems with renovation
- The queueing system with threshold-based direct and inverse general renovation mechanism
- Two types of single-server queueing systems with threshold-based renovation mechanism
- Characteristics of lost and served packets for retrial queueing system with general renovation and recurrent input flow
Cites work
- A note on scalarizing functions under changing sets of criteria
- Analysis of AQM queues with queue size based packet dropping
- ANALYSIS OF M/G/1 STOCHASTIC CLEARING SYSTEMS
- scientific article; zbMATH DE number 3174016 (Why is no real title available?)
- scientific article; zbMATH DE number 2160603 (Why is no real title available?)
- Late-rejection, a strategy to perform an overflow policy
- Minimizing expected discounted cost in a queueing loss model with discriminating arrivals
- Nonscalarized multiobjective global optimization
- Numerical Methods for Structured Markov Chains
- On the service time in a workload-barrier \(\mathrm{M}/\mathrm{G}/1\) queue with accepted and blocked customers
- Optimality and efficiency. I
- Performance evaluation of an \(M/G/n\)-type queue with bounded capacity and packet dropping
- Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
- Queueing system with processor sharing and limited memory under control of the AQM mechanism
- Queueing systems with renovation
- Queueing Theory
- Queues with delayed feedback
- Queues with dropping functions and autocorrelated arrivals
- Queues with negative arrivals
- Scalarizing vector optimization problems
- Stability analysis of regenerative queueing models. Mathematical methods and applications
- Stationary time characteristics of the GI/M/n/ system with some variants of the generalized renovation discipline
- Stochastic clearing systems
- The \(GI/M/n/\infty \) queuing system with generalized renovation
- The computation of key properties of Markov chains via perturbations
Cited in
(2)
This page was built for publication: Finite capacity single-server queue with Poisson input, general service and delayed renovation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079417)