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 条
  • [41] Concavity of the conditional mean sojourn time in the M/G/1 processor-sharing queue with batch arrivals
    Kim, Jeongsim
    Kim, Bara
    [J]. QUEUEING SYSTEMS, 2008, 58 (01) : 57 - 64
  • [42] Individually and socially optimal joining rules for an egalitarian processor-sharing queue under different information scenarios
    Yu, Miaomiao
    Tang, Yinghui
    Wu, Wenqing
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 78 : 26 - 32
  • [43] On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
    Brandt, A
    Brandt, M
    [J]. MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 1998, 47 (02) : 181 - 220
  • [44] A Processor-Sharing Scheduling Strategy for NFV Nodes
    Faraci, Giuseppe
    Lombardo, Alfio
    Schembra, Giovanni
    [J]. JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, 2016, 2016
  • [45] Poly-symmetry in processor-sharing systems
    Thomas Bonald
    Céline Comte
    Virag Shah
    Gustavo de Veciana
    [J]. Queueing Systems, 2017, 86 : 327 - 359
  • [46] 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
  • [47] Poly-symmetry in processor-sharing systems
    Bonald, Thomas
    Comte, Celine
    Shah, Virag
    de Veciana, Gustavo
    [J]. QUEUEING SYSTEMS, 2017, 86 (3-4) : 327 - 359
  • [48] Sojourn time asymptotics in processor-sharing queues
    Borst, Sem
    Nunez-Queija, Rudesindo
    Zwart, Bert
    [J]. QUEUEING SYSTEMS, 2006, 53 (1-2) : 31 - 51
  • [49] On the sojourn times for many-queue head-of-the-line Processor-sharing systems with permanent customers
    Andreas Brandt
    Manfred Brandt
    [J]. Mathematical Methods of Operations Research, 1998, 47 : 181 - 220
  • [50] A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
    Andreas Brandt
    Manfred Brandt
    [J]. Queueing Systems, 1999, 32 : 363 - 381