Tail asymptotics for processor-sharing queues

被引：24
|
作者：
Guillemin, F
Robert, P
Zwart, B
机构：
[1] France Telecom R&D, F-22300 Lannion, France
[2] INRIA, F-78153 Le Chesnay, France
[3] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
来源：
ADVANCES IN APPLIED PROBABILITY | 2004年 / 36卷 / 02期
关键词：
heavy tail; processor sharing; reduced-load approximation;
D O I：
10.1239/aap/1086957584
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
The basic queueing system considered in this paper is the: M/G/I processor-sharing queue with or without impatience and with finite or infinite capacity. Under some mild assumptions, a criterion for the validity of the reduced-service-rate approximation is established when service times are heavy tailed. This result is applied to various models based on M/G/I processor-sharing queues.
引用
收藏
页码：525 / 543
页数：19
相关论文
共 50 条
  • [1] Sojourn time asymptotics in processor-sharing queues
    Borst, Sem
    Nunez-Queija, Rudesindo
    Zwart, Bert
    [J]. QUEUEING SYSTEMS, 2006, 53 (1-2) : 31 - 51
  • [2] Sojourn time asymptotics in processor-sharing queues
    Sem Borst
    Rudesindo Núñez-Queija
    Bert Zwart
    [J]. Queueing Systems, 2006, 53 : 31 - 51
  • [3] Tail asymptotics for discriminatory processor-sharing queues with heavy-tailed service requirements
    Borst, S
    van Ooteghem, D
    Zwart, B
    [J]. PERFORMANCE EVALUATION, 2005, 61 (2-3) : 281 - 298
  • [4] Tail behavior of conditional sojourn times in Processor-Sharing queues
    Egorova, Regina
    Zwart, Bert
    [J]. QUEUEING SYSTEMS, 2007, 55 (02) : 107 - 121
  • [5] Tail behavior of conditional sojourn times in Processor-Sharing queues
    Regina Egorova
    Bert Zwart
    [J]. Queueing Systems, 2007, 55 : 107 - 121
  • [6] Throughput in processor-sharing queues
    Chen, Na
    Jordan, Scott
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (02) : 299 - 305
  • [7] Violation probability in processor-sharing queues
    Chen, Na
    Jordan, Scott
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2008, 53 (08) : 1956 - 1961
  • [8] CONDITIONAL SOJOURN TIMES OF PROCESSOR-SHARING QUEUES
    Lee, Wei-Yi
    Wang, Chia-Li
    [J]. PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 2013, 27 (01) : 99 - 114
  • [9] Fluid limits for processor-sharing queues with impatience
    Gromoll, H. Christian
    Robert, Philippe
    Zwart, Bert
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 2008, 33 (02) : 375 - 402
  • [10] Sojourn times in finite-capacity processor-sharing queues
    Borst, S
    Boxma, O
    Hegde, N
    [J]. 2005 NEXT GENERATION INTERNET NETWORKS, 2005, : 53 - 60
12345