A NOTE ON CYCLE TIMES IN TREE-LIKE QUEUING-NETWORKS

被引:11
作者
HARRISON, PG
机构
关键词
D O I
10.2307/1427233
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:216 / 219
页数:4
相关论文
共 8 条
[1]   COMPUTATIONAL ALGORITHMS FOR CLOSED QUEUING NETWORKS WITH EXPONENTIAL SERVERS [J].
BUZEN, JP .
COMMUNICATIONS OF THE ACM, 1973, 16 (09) :527-531
[2]   THE CYCLE TIME DISTRIBUTION OF EXPONENTIAL CYCLIC QUEUES [J].
CHOW, WM .
JOURNAL OF THE ACM, 1980, 27 (02) :281-286
[3]   PASSAGE TIMES FOR OVERTAKE-FREE PATHS IN GORDON-NEWELL NETWORKS [J].
DADUNA, H .
ADVANCES IN APPLIED PROBABILITY, 1982, 14 (03) :672-686
[4]   CLOSED QUEUING SYSTEMS WITH EXPONENTIAL SERVERS [J].
GORDON, WJ ;
NEWELL, GF .
OPERATIONS RESEARCH, 1967, 15 (02) :254-&
[5]  
HARRISON PG, 1979, 7950 IMP COLL RES RE
[6]   SOJOURN TIMES IN CLOSED QUEUING-NETWORKS [J].
KELLY, FP ;
POLLETT, PK .
ADVANCES IN APPLIED PROBABILITY, 1983, 15 (03) :638-656
[7]   THE TIME FOR A ROUND TRIP IN A CYCLE OF EXPONENTIAL QUEUES [J].
SCHASSBERGER, R ;
DADUNA, H .
JOURNAL OF THE ACM, 1983, 30 (01) :146-150
[8]   SOJOURN TIMES AND THE OVERTAKING CONDITION IN JACKSONIAN NETWORKS [J].
WALRAND, J ;
VARAIYA, P .
ADVANCES IN APPLIED PROBABILITY, 1980, 12 (04) :1000-1018