SOJOURN TIMES AND THE OVERTAKING CONDITION IN JACKSONIAN NETWORKS

被引:44
作者
WALRAND, J [1 ]
VARAIYA, P [1 ]
机构
[1] UNIV CALIF BERKELEY,ELECTR RES LAB,BERKELEY,CA 94720
关键词
D O I
10.2307/1426753
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
引用
收藏
页码:1000 / 1018
页数:19
相关论文
共 11 条
[1]   OPEN, CLOSED, AND MIXED NETWORKS OF QUEUES WITH DIFFERENT CLASSES OF CUSTOMERS [J].
BASKETT, F ;
CHANDY, KM ;
MUNTZ, RR ;
PALACIOS, FG .
JOURNAL OF THE ACM, 1975, 22 (02) :248-260
[2]   DEPENDENCE OF SOJOURN TIMES IN TANDEM M/M/S QUEUES [J].
BURKE, PJ .
OPERATIONS RESEARCH, 1969, 17 (04) :754-&
[3]  
BURKE PJ, 1973, P S COMPUTER COMMUNI, P419
[4]  
LEMOINE A, 1979, TOTAL SOJOURN TIME A
[5]  
MEYER PA, 1971, SEMINAIRE PROBABILIT, P177
[6]  
MEYER PA, 1967, LECTURE NOTES MATH, V26
[7]   WAITING-TIMES WHEN QUEUES ARE IN TANDEM [J].
REICH, E .
ANNALS OF MATHEMATICAL STATISTICS, 1957, 28 (03) :768-773
[8]   NOTE ON QUEUES TANDEM [J].
REICH, E .
ANNALS OF MATHEMATICAL STATISTICS, 1963, 34 (01) :338-&
[9]  
SEVCIK KC, 1978, 307 RAPP RECH
[10]  
WALRAND J, UNPUBLISHED