RECURSIVE COMPUTATION OF STEADY-STATE PROBABILITIES IN PRIORITY-QUEUES

被引：9

作者：

CIDON, I ^{[1
]}

SIDI, M ^{[1
]}

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,IL-32000 HAIFA,ISRAEL

来源：

OPERATIONS RESEARCH LETTERS | 1990年 / 9卷 / 04期

关键词：

priority queues; recursive computation; steady-state probabilities;

D O I：

10.1016/0167-6377(90)90069-H

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Exact recursive formulas are derived for the state probabilities in priority queueing systems (preemptive and non-preemptive). The derivation is based only on the general structure of the generating function involved, and thus is simpler and more general than previous methods. Furthermore, applications of the method to other queueing systems are discussed. © 1990.

引用

页码：249 / 256

页数：8

共 12 条

[1]

GAIL HR, 1987, 3RD P INT C DAT COMM, P341

[2]

Gross D, 1985, FUNDAMENTALS QUEUING, V3rd

[3] AN INVERSION TECHNIQUE FOR THE LAPLACE TRANSFORM [J].

JAGERMAN, DL .

BELL SYSTEM TECHNICAL JOURNAL, 1982, 61 (08) :1995-2002

[4]

JAGERMAN DL, UNPUB OBTAINING COEF

[5]

Jaiswal N.K., 1968, PRIORITY QUEUES

[6] STATE PROBABILITIES OF M/M/1 PRIORITY QUEUES [J].

MARKS, BI .

OPERATIONS RESEARCH, 1973, 21 (04) :974-987

[7]

MILLER DG, 1982, APPLIED PROBABILITY, P207

[8] COMPUTATION OF STEADY-STATE PROBABILITIES FOR M-M-1 PRIORITY-QUEUES [J].

MILLER, DR .

OPERATIONS RESEARCH, 1981, 29 (05) :945-958

[9] PRIORITY-QUEUES [J].

MILLER, RG .

ANNALS OF MATHEMATICAL STATISTICS, 1960, 31 (01) :86-103

[10] 2 DISCRETE-TIME QUEUES IN TANDEM [J].

MORRISON, JA .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1979, 27 (03) :563-573

← 1 2 →