SIMPLE RELATIONSHIPS AMONG MOMENTS OF QUEUE LENGTHS IN PRODUCT FORM QUEUING-NETWORKS

被引：7

作者：

DESOUZAESILVA, E ^{[1
]}

MUNTZ, RR ^{[1
]}

机构：

[1] UNIV CALIF LOS ANGELES,DEPT COMP SCI,LOS ANGELES,CA 90024

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1988年 / 37卷 / 09期

关键词：

D O I：

10.1109/12.2264

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：1125 / 1129

页数：5

共 16 条

[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] COMPUTATIONAL ALGORITHMS FOR CLOSED QUEUING NETWORKS WITH EXPONENTIAL SERVERS [J].

BUZEN, JP .

COMMUNICATIONS OF THE ACM, 1973, 16 (09) :527-531

[3] RECAL - A NEW EFFICIENT ALGORITHM FOR THE EXACT ANALYSIS OF MULTIPLE-CHAIN CLOSED QUEUING-NETWORKS [J].

CONWAY, AE ;

GEORGANAS, ND .

JOURNAL OF THE ACM, 1986, 33 (04) :768-791

[4]

CONWAY AE, IN PRESS IEEE T COMP

[5]

GOYAL A, 1986, JUL P FTCS 16, P84

[6]

GOYAL A, IN PRESS ANN OPER RE

[7] MOMENT FORMULAS FOR A CLASS OF MIXED MULTI-JOB-TYPE QUEUING-NETWORKS [J].

HEFFES, H .

BELL SYSTEM TECHNICAL JOURNAL, 1982, 61 (05) :709-745

[8]

KENEVAN JR, DEC PERF 84 P, P361

[9] OPTIMAL ROUTING IN CLOSED QUEUING-NETWORKS [J].

KOBAYASHI, H ;

GERLA, M .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1983, 1 (04) :294-310

[10]

Lavenberg S.S., 1983, COMPUTER PERFORMANCE

← 1 2 →