Sojourn time tails in the single server queue with heavy-tailed service times
Sojourn time tails in the single server queue with heavy-tailed service times
About this item
Full title
Author / Creator
Publisher
Boston: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
Boston: Springer US
Subjects
More information
Scope and Contents
Contents
We consider the
GI
/
GI
/1 queue with regularly varying service requirement distribution of index −
α
. It is well known that, in the
M
/
G
/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1−
α
, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is reg...
Alternative Titles
Full title
Sojourn time tails in the single server queue with heavy-tailed service times
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1671364194
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1671364194
Other Identifiers
ISSN
0257-0130
E-ISSN
1572-9443
DOI
10.1007/s11134-011-9229-y