Mathematical problems in the theory of processor-sharing queueing systems (Q1179867)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Mathematical problems in the theory of processor-sharing queueing systems |
scientific article; zbMATH DE number 26614
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Mathematical problems in the theory of processor-sharing queueing systems |
scientific article; zbMATH DE number 26614 |
Statements
Mathematical problems in the theory of processor-sharing queueing systems (English)
0 references
27 June 1992
0 references
This paper reviews problems and models of processor-shared queueing systems and their applications in computer networks. It concentrates on obtaining exact results to the main steady-state performance measures, such as mean sojourn times, average queue-lengths, etc. Some basic methods of investigation are also discussed with special attention to systems with Poisson-arrivals. Some heavy-traffic approximations, and different limit theorems are also treated.
0 references
processor sharing
0 references
limit theorems
0 references
queueing
0 references
performance measures
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.94652206
0 references
0.9116353
0 references
0 references
0.8969018
0 references
0.8961327
0 references
