ANALYTIC APPROXIMATION OF BLOCKING PROBABILITIES IN CIRCUIT SWITCHED COMMUNICATION NETWORKS

被引:9
作者
DESCHAMPS, PJ
机构
[1] Department of Economics, University of Birmingham, Birmingham
关键词
D O I
10.1109/TCOM.1979.1094422
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A method inspired from S. Katz's service evaluation algorithm [6] is presented. The new algorithm is recursive, rather than iterative, in nature, and especially suited for networks that do not contain cycles. It also introduces two new features which take existing theoretical results into account, and as such corresponds more closely to the current state of traffic theory. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.
引用
收藏
页码:603 / 606
页数:4
相关论文
共 9 条
[1]  
BENES VE, 1976, MATH THEORY CONNECTI
[2]  
Cooper R. B., 1972, INTRO QUEUEING THEOR
[3]  
DESCHAMPS PJ, 1976, 2ND BEST PRICING VAR
[4]  
EISENBERG M, 1977, BELL SYSTEM TECHNICA, V56, P1405
[5]  
JENSEN A, MOES PRINCIPLE ECONO
[6]  
KATZ S, 1967, 5TH INT TEL C
[7]  
KORTANEK K, 1977, LINEAR PROGRAMMING S
[8]   TRAFFIC ENGINEERING TECHNIQUES FOR DETERMINING TRUNK REQUIREMENTS IN ALTERNATE ROUTING TRUNK NETWORKS [J].
TRUITT, CJ .
BELL SYSTEM TECHNICAL JOURNAL, 1954, 33 (02) :277-302
[9]   THEORIES FOR TOLL TRAFFIC ENGINEERING IN THE USA [J].
WILKINSON, RI .
BELL SYSTEM TECHNICAL JOURNAL, 1956, 35 (02) :421-+