SOJOURN TIMES IN CLOSED QUEUING-NETWORKS

被引：35

作者：

KELLY, FP ^{[1
]}

POLLETT, PK ^{[1
]}

机构：

[1] UNIV CAMBRIDGE,CAMBRIDGE,ENGLAND

来源：

ADVANCES IN APPLIED PROBABILITY | 1983年 / 15卷 / 03期

关键词：

D O I：

10.2307/1426623

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：638 / 656

页数：19

共 28 条

[1] OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].

BASKETT, F ;

CHANDY, KM ;

MUNTZ, RR ;

PALACIOS, FG .

JOURNAL OF THE ACM, 1975, 22 (02) :248-260

[2]

BOXMA OJ, 1983, J ASS COMPUT MACH

[3] SOME DISTRIBUTIONAL APPROXIMATIONS IN MARKOVIAN QUEUING-NETWORKS [J].

BROWN, TC ;

POLLETT, PK .

ADVANCES IN APPLIED PROBABILITY, 1982, 14 (03) :654-671

[4]

Burke P., 1972, P S COMP COMM NETW T, P419

[5] OUTPUT PROCESS OF A STATIONARY M/M/S QUEUEING SYSTEM [J].

BURKE, PJ .

ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (04) :1144-&

[6] PARAMETRIC ANALYSIS OF QUEUING NETWORKS [J].

CHANDY, KM ;

HERZOG, U ;

WOO, L .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1975, 19 (01) :36-42

[7] PASSAGE TIMES FOR OVERTAKE-FREE PATHS IN GORDON-NEWELL NETWORKS [J].

DADUNA, H .

ADVANCES IN APPLIED PROBABILITY, 1982, 14 (03) :672-686

[8]

Feller W., 1968, INTRO PROBABILITY TH, V1st

[9]

FRANKEN P, 1981, QUEUES POINT PROCESS

[10]

Freedman, 1971, MARKOV CHAINS

← 1 2 3 →