A perturbation method for solving some queues with processor sharing discipline

From MaRDI portal





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\).











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)