SOLUTION OF QUEUING PROBLEMS BY A RECURSIVE TECHNIQUE

被引：48

作者：

HERZOG, U

WOO, L

CHANDY, KM

机构：

[1] UNIV STUTTGART,STUTTGART,FED REP GER

[2] UNIV TEXAS,AUSTIN,TX 78712

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

来源：

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

关键词：

D O I：

10.1147/rd.193.0295

中图分类号：

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

学科分类号：

0812 ;

摘要：

A recursive method for efficient computational analysis of a wide class of queueing problems is presented. Interarrival and service times are described by multidimensional Markovian processes while arrival and service rates are allowed to be state dependent.

引用

页码：295 / 300

页数：6

共 9 条

[1]

BROCKMEYER E, 1960, ACTA POLYTECHNICA SC

[2] SINGLE-SERVER FINITE QUEUING MODEL WITH STATE-DEPENDENT ARRIVAL AND SERVICE PROCESSES [J].

COURTOIS, PJ ;

GEORGES, J .

OPERATIONS RESEARCH, 1971, 19 (02) :424-&

[3]

Cox D., 1965, THEORY STOCHASTIC PR, DOI 10.1201/9780203719152

[4]

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

[5]

Feller W., 1957, INTRO PROBABILITY TH, V1

[6] STOCHASTIC PROCESSES OCCURRING IN THE THEORY OF QUEUES AND THEIR ANALYSIS BY THE METHOD OF THE IMBEDDED MARKOV CHAIN [J].

KENDALL, DG .

ANNALS OF MATHEMATICAL STATISTICS, 1953, 24 (03) :338-354

[7]

LINDLEY DV, 1952, P CAMBRIDGE PHIL S 2, V48

[8]

NEUTS MF, 1971, SINGLE SERVER QUEUE

[9]

[No title captured]

← 1 →