QUEUING NETWORKS WITH MULTIPLE CLOSED CHAINS - THEORY AND COMPUTATIONAL ALGORITHMS

被引：133

作者：

REISER, M ^{[1
]}

KOBAYASHI, H ^{[1
]}

机构：

[1] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598

来源：

IBM JOURNAL OF RESEARCH AND DEVELOPMENT | 1975年 / 19卷 / 03期

关键词：

PROBABILITY - Queueing Theory;

D O I：

10.1147/rd.193.0283

中图分类号：

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

学科分类号：

0812 ;

摘要：

A recent result of E. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios is generalized to the case in which customer transitions are characterized by more than one closed Markov chain. Generating functions are used to derive closed-form solutions to stability, normalization constant, and marginal distributions. For such a system with N servers and L chains the solutions are considerably more complicated than those for systems with one subchain only. It is shown how open and closed subchains interact with each other in such systems. Efficient algorithms are then derived from the generating function representation.

引用

页码：283 / 294

页数：12

共 14 条

[1]

ARORA SR, 1971, APR ACM WORKSH SYST, P104

[2]

BASKETT F, 1972, 6TH P ANN IEEE INT C, P205

[3]

BASKETT F, TO BE PUBLISHED

[4]

Box George E. P, 1970, J AM STAT ASS

[5] COMPUTATIONAL ALGORITHMS FOR CLOSED QUEUING NETWORKS WITH EXPONENTIAL SERVERS [J].

BUZEN, JP .

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

[6]

BUZEN JP, 1971, APR P ACM SIGOPS WOR, P82

[7]

CHANDY KM, 1973, 7TH P ANN PRINC C IN, P428

[8]

Cox D. R., 1955, P CAMBRIDGE PHILOS S, V51, P313

[9] JOBSHOP-LIKE QUEUING-SYSTEMS [J].

JACKSON, JR .

MANAGEMENT SCIENCE, 1963, 10 (01) :131-142

[10]

KOBAYASHI H, 1974, 8TH P ANN PRINC C IN

← 1 2 →