Fluid approximations for a processor-sharing queue

被引:28
|
作者
Chen, H [1 ]
Kella, O
Weiss, G
机构
[1] Hong Kong Univ Sci & Technol, Dept Ind Engn & Engn Management, Kowloon, Hong Kong
[2] Univ British Columbia, Fac Commerce & Business Adm, Vancouver, BC V6T 1Z2, Canada
[3] Hebrew Univ Jerusalem, Dept Stat, IL-91905 Jerusalem, Israel
[4] Univ Haifa, Dept Stat, IL-31905 Haifa, Israel
关键词
GI/G/1; queue; processor-sharing discipline; fluid approximation; functional strong law of large numbers;
D O I
10.1023/A:1019105929766
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper a fluid approximation, also known as a functional strong law of large numbers (FSLLN) for a GI/G/1 queue under a processor-sharing service discipline is established and its properties are analysed. The fluid limit depends on the arrival rate, the service time distribution of the initial customers, and the service time distribution of the arriving customers. This is in contrast to the known result for the GI/G/1 queue under a FIFO service discipline, where the fluid limit is piecewise linear and depends on the service time distribution only through its mean. The piecewise linear form of the limit can be recovered by an equilibrium type choice of the initial service distribution.
引用
收藏
页码:99 / 125
页数:27
相关论文
共 50 条
  • [1] Fluid approximations for a processor-sharing queue
    Hong Chen
    Offer Kella
    Gideon Weiss
    [J]. Queueing Systems, 1997, 27 : 99 - 125
  • [2] MONOTONICITY IN THE LIMITED PROCESSOR-SHARING QUEUE
    Nuyens, Misja
    van der Weij, Wemke
    [J]. STOCHASTIC MODELS, 2009, 25 (03) : 408 - 419
  • [3] STABILITY OF A PROCESSOR-SHARING QUEUE WITH VARYING THROUGHPUT
    Moyal, Pascal
    [J]. JOURNAL OF APPLIED PROBABILITY, 2008, 45 (04) : 953 - 962
  • [4] Queue-length distribution for the discriminatory processor-sharing queue
    Rege, KM
    Sengupta, B
    [J]. OPERATIONS RESEARCH, 1996, 44 (04) : 653 - 657
  • [5] On the ASTA property in a feedback processor-sharing queue
    Mitrani, I
    Robert, P
    [J]. PERFORMANCE EVALUATION, 2004, 58 (01) : 81 - 85
  • [6] The M/G/1 processor-sharing queue with disasters
    Li, Quan-Lin
    Lin, Chuang
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2006, 51 (6-7) : 987 - 998
  • [7] A NOTE ON THE PROCESSOR-SHARING QUEUE IN A QUASI-REVERSIBLE NETWORK
    TSOUCAS, P
    WALRAND, J
    [J]. ADVANCES IN APPLIED PROBABILITY, 1983, 15 (02) : 468 - 469
  • [8] Slowdown in the M/M/1 discriminatory processor-sharing queue
    Cheung, Sing-Kong
    Kim, Bara
    Kim, Jeongsim
    [J]. PERFORMANCE EVALUATION, 2008, 65 (08) : 586 - 605
  • [9] Average rate in a M/M/1 processor-sharing queue
    Chen, N
    Jordan, S
    [J]. ACC: PROCEEDINGS OF THE 2005 AMERICAN CONTROL CONFERENCE, VOLS 1-7, 2005, : 2359 - 2364
  • [10] A NEW APPROACH TO THE M/G/1 PROCESSOR-SHARING QUEUE
    SCHASSBERGER, R
    [J]. ADVANCES IN APPLIED PROBABILITY, 1984, 16 (01) : 202 - 213