PASSAGE TIMES FOR OVERTAKE-FREE PATHS IN GORDON-NEWELL NETWORKS

被引：25

作者：

DADUNA, H

机构：

来源：

关键词：

D O I：

10.2307/1426680

中图分类号：

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

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

引用

页码：672 / 686

页数：15

共 9 条

BASKETT, F ;

CHANDY, KM ;

MUNTZ, RR ;

PALACIOS, FG .

[2]

CHOW WM, 1981, J ASSOC COMPUT MACH, V27, P281

[3]

Kelly F. P., 1979, REVERSIBILITY STOCHA

[4]

LEMOINE A, 1979, TOTAL SOJOURN TIME A

[5]

MELAMED B, 1979, SOJOURN TIMES QUEUEI

[6] WAITING-TIMES WHEN QUEUES ARE IN TANDEM [J].

REICH, E .

ANNALS OF MATHEMATICAL STATISTICS, 1957, 28 (03) :768-773

[7] NOTE ON QUEUES TANDEM [J].

REICH, E .

ANNALS OF MATHEMATICAL STATISTICS, 1963, 34 (01) :338-&

[8]

SCHASSBERGER R, 1980, TIME ROUND TRIP CYCL

WALRAND, J ;

VARAIYA, P .