A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications (Q2494553): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11134-006-6264-1 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11134-006-6264-1 / rank | |||
Normal rank | |||
Latest revision as of 00:40, 19 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications |
scientific article |
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
