GI/G/1 PROCESSOR SHARING QUEUE IN HEAVY TRAFFIC

被引：21
作者：
GRISHECHKIN, S
机构：
来源：
ADVANCES IN APPLIED PROBABILITY | 1994年 / 26卷 / 02期
关键词：
RANDOM MEASURES; BRANCHING PROCESSES;
D O I：
10.2307/1427450
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
Consider GI/G/1 processor sharing queues with traffic intensity tending to 1. Using the theory of random measures and the theory of branching processes we investigate the limiting behaviour of the queue length, sojourn time and random measures describing attained and residual processing times of customers present.
引用
收藏
页码：539 / 555
页数：17
相关论文
共 12 条
[1]  
Baccelli F., 1990, Queueing Systems Theory and Applications, V7, P269, DOI 10.1007/BF01154546
[2]  
Billingsley P, 1968, CONVERGENCE PROBABIL
[3]   ON A RELATIONSHIP BETWEEN PROCESSOR-SHARING QUEUES AND CRUMP-MODE-JAGERS BRANCHING-PROCESSES [J].
GRISHECHKIN, S .
ADVANCES IN APPLIED PROBABILITY, 1992, 24 (03) :653-698
[4]   CRUMP MODE JAGERS BRANCHING-PROCESSES AS A METHOD OF INVESTIGATING M/G/1 SYSTEMS WITH PROCESSOR SHARING [J].
GRISHECHKIN, SA .
THEORY OF PROBABILITY AND ITS APPLICATIONS, 1991, 36 (01) :19-35
[5]  
JAGERMAN DL, 1991, STOCH MODELS, V7, P379
[6]   THE GROWTH AND COMPOSITION OF BRANCHING POPULATIONS [J].
JAGERS, P ;
NERMAN, O .
ADVANCES IN APPLIED PROBABILITY, 1984, 16 (02) :221-259
[7]  
Kallenberg O., 1983, RANDOM MEASURES
[8]  
Prokhorov Yu., 1956, THEOR PROBAB APPL, V1, P157, DOI [10.1137/1101016, DOI 10.1137/1101016]
[9]  
Sengupta B., 1992, STOCH MODELS, V8, P35
[10]  
Skorohod A V, 1956, THEOR PROBAB APPL, V1, P289, DOI DOI 10.1137/1101022
12