A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications (Q2494553)
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: A sample path relation for the sojourn times in G/G/1-PS systems and its applications |
scientific article; zbMATH DE number 5036641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications |
scientific article; zbMATH DE number 5036641 |
Statements
A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications (English)
0 references
28 June 2006
0 references
Processor sharing
0 references
Sojourn time
0 references
Waiting time
0 references
Busy period
0 references
Sample path
0 references
First come first served
0 references
Comparative analysis
0 references
Mean sojourn time approximation
0 references
0 references
0 references
0 references
0 references
0 references
0.8249126076698303
0 references
0.8164774179458618
0 references
0.8136640787124634
0 references
0.8127732872962952
0 references
0.8114445209503174
0 references
