On a singular feature of critical G/M/1 queues

被引:0
|
作者
Prabhakar, B [1 ]
Bambos, N [1 ]
机构
[1] UNIV CALIF LOS ANGELES,DEPT ELECT ENGN,LOS ANGELES,CA 90024
基金
美国国家科学基金会;
关键词
A key concept in the approach of Loynes and; indeed; in the general stability theory of queueing systems is the notion of finite time coupling between processes (see [1; 7]); Briefly; this has the following meaning. Suppose that X°(t) is the queue-size of a G/G/1 queue at time t > 0 starting with an empty queue at time 0 and that D O is the corresponding departure process. Then; provided the queue is stable (i.e. arrival rate < service rate); Loynes [7]h as shown that X°(.) couples in finite time with a stationary and ergodic process X(.) and that D O couples in finite time with a stationary and ergodic process D. That I Research supported by NSF grants DMI-9216034; NCR-9116268; and a National Young Investigator Award NCR-9258507. * Corresponding author;
D O I
10.1016/0167-6911(96)00019-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we consider a critically loaded G/M/1 queue and contrast its transient behaviour with the transient behaviour of stable (or unstable) G/M/1 queues. We show that the departure process from a critical G/M/1 queue converges weakly to a Poisson process. However, as opposed to the stable (or unstable) case, we show that the departure process of a critical G1/M/1 queue does not couple in finite time with a Poisson process (even though it converges weakly to one). Thus, as the traffic intensity (ratio of arrival to service rates), rho, ranges over (0, infinity), the point rho = 1 represents a singularity with regard to the convergence mode of the departure process.
引用
收藏
页码:239 / 245
页数:7
相关论文
共 50 条
  • [1] Solution for M/G/1 queues
    Schormans, JA
    Pitts, JM
    ELECTRONICS LETTERS, 1997, 33 (25) : 2109 - 2111
  • [2] The age of the arrival process in the G/M/1 and M/G/1 queues
    Moshe Haviv
    Yoav Kerner
    Mathematical Methods of Operations Research, 2011, 73 : 139 - 152
  • [3] The age of the arrival process in the G/M/1 and M/G/1 queues
    Haviv, Moshe
    Kerner, Yoav
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2011, 73 (01) : 139 - 152
  • [4] G/M/1 queues with delayed vacations
    Han, Dong Hwan
    Choi, Doo Il
    Journal of Applied Mathematics and Computing, 1998, 5 (01): : 1 - 11
  • [5] G/M/1 queues with delayed vacations
    Han, Dong Hwan
    Choi, Doo Il
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (01): : 1 - 11
  • [6] On the transient delays of m/g/1 queues
    Wang, CL
    JOURNAL OF APPLIED PROBABILITY, 1999, 36 (03) : 882 - 893
  • [7] G/M/1 queues with delayed vacations
    Dong Hwan Han
    Doo Il Choi
    Korean Journal of Computational & Applied Mathematics, 1998, 5 (1): : 1 - 11
  • [8] Clearing models for M/G/1 queues
    Boxma, OJ
    Perry, D
    Stadje, W
    QUEUEING SYSTEMS, 2001, 38 (03) : 287 - 306
  • [9] Clearing Models for M/G/1 Queues
    Onno J. Boxma
    David Perry
    Wolfgang Stadje
    Queueing Systems, 2001, 38 : 287 - 306
  • [10] DISTRIBUTION-FREE ANALYSIS OF M/G/1 AND G/M/1 QUEUES
    GREENBERG, I
    OPERATIONS RESEARCH, 1973, 21 (02) : 629 - 635