BLOCKING PROBABILITIES IN LARGE CIRCUIT-SWITCHED NETWORKS

被引：342
作者：
KELLY, FP
机构：
来源：
ADVANCES IN APPLIED PROBABILITY | 1986年 / 18卷 / 02期
关键词：
D O I：
10.2307/1427309
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
引用
收藏
页码：473 / 505
页数：33
相关论文
共 31 条
[1]  
AKINPELU JM, 1983, 10TH INT TEL C
[2]  
APPLEBY M, 1983, BRIT TELECOM J WIN, P4
[3]   INSENSITIVITY OF BLOCKING PROBABILITIES IN A CIRCUIT-SWITCHING NETWORK [J].
BURMAN, DY ;
LEHOCZKY, JP ;
LIM, Y .
JOURNAL OF APPLIED PROBABILITY, 1984, 21 (04) :850-859
[4]   QUEUING-NETWORKS - A SURVEY OF THEIR RANDOM-PROCESSES [J].
DISNEY, RL ;
KONIG, D .
SIAM REVIEW, 1985, 27 (03) :335-403
[5]  
Everitt D. E., 1983, British Telecom Technology Journal, V1, P37
[6]  
Feller W., 1968, INTRO PROBABILITY TH, V1st
[7]   END-TO-END BLOCKING FOR CIRCUIT-SWITCHED NETWORKS - POLYNOMIAL ALGORITHMS FOR SOME SPECIAL CASES [J].
GIRARD, A ;
OUIMET, Y .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) :1269-1273
[8]   DYNAMIC ROUTING AND CALL REPACKING IN CIRCUIT-SWITCHED NETWORKS [J].
GIRARD, A ;
HURTUBISE, S .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) :1290-1294
[9]  
Gnedenko B.V., 1968, THEORY PROBABILITY
[10]  
Gondran M., 1984, GRAPHS ALGORITHMS
1234