Analysis of the M/M/1 queue with processor sharing via spectral theory (Q5959269): Difference between revisions
From MaRDI portal
Created a new Item |
Add wikidata reference. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1013913827667 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1544480245 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56771047 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:03, 16 December 2024
scientific article; zbMATH DE number 1723290
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Analysis of the M/M/1 queue with processor sharing via spectral theory |
scientific article; zbMATH DE number 1723290 |
Statements
Analysis of the M/M/1 queue with processor sharing via spectral theory (English)
0 references
26 March 2002
0 references
It is shown that the computation of the distribution of the sojourn time of an arbitrary customer in an M/M/1 system with processor sharing discipline (abbr. M/M/1 PS system) can be formulated as a spectral problem for a self-adjoint operator. This approach allows to improve existing results for this system in two directions. First, the orthogonal structure underlying the M/M/ PS system is revealed. Second, an integral representation of the distribution of the sojourn time of a customer entering the system while \(n\) customers are in service is obtained.
0 references
M/M/1
0 references
processor sharing
0 references
sojourn time
0 references
asymptotic
0 references
spectral theory
0 references
orthogonal polynomials
0 references
