A perturbation method for solving some queues with processor sharing discipline (Q3825898)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4100352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A perturbation method for solving some queues with processor sharing discipline |
scientific article; zbMATH DE number 4100352 |
Statements
A perturbation method for solving some queues with processor sharing discipline (English)
0 references
1989
0 references
queues with processor sharing
0 references
random environment
0 references
two-node network
0 references
sojourn time
0 references
Neuts' matrix-geometric method
0 references
perturbation analysis
0 references
0.89870334
0 references
0.89698577
0 references
0.8915631
0 references
0.8901871
0 references
0.88607574
0 references
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\).
0 references