A perturbation method for solving some queues with processor sharing discipline
Three models for queues with processor sharing are considered. (1) an M/M/1 queue in a certain random environment, (2) two-node cyclic queues where the other queue is a standard many-server queue, and (3) a two-node network with one finite and one infinite class of customers and the other queue having infinitely many servers. Performance vectors \(u=(u_ i)\) are defined as the moments of the sojourn time of a customer arriving when the system is in some state i upon arrival, and are shown to satisfy second-order difference equations (in some cases the coefficients must be computed by Neuts' matrix- geometric method). The difference equation can then be solved by standard perturbation analysis, using power series expansions in a parameter \(\lambda\).
- scientific article; zbMATH DE number 370528
- Processor-sharing queues: Some progress in analysis
- On differential equations arising in the theory of processor sharing queues
- scientific article; zbMATH DE number 2215668
- Stability of a Processor-Sharing Queue with Varying Throughput
- scientific article; zbMATH DE number 3880405
- Mathematical problems in the theory of processor-sharing queueing systems
- Analysis of the queuing systems with processor sharing service discipline and random serving rate coefficients
- Large deviations and the generalized processor sharing scheduling for a multiple-queue system
- A single server queue with gated processor-sharing discipline
- Mathematical problems in the theory of processor-sharing queueing systems
- Processor sharing for two queues with vastly different rates
- Perturbation analysis of the M/M/1 queue in a markovian environment via the matrix-geometric method
- scientific article; zbMATH DE number 370528 (Why is no real title available?)
- scientific article; zbMATH DE number 2215668 (Why is no real title available?)
- Power series approximations for two-class generalized processor sharing systems
- Singular perturbation for a two-class processor-sharing queue with impatience
This page was built for publication: A perturbation method for solving some queues with processor sharing discipline
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3825898)