REDUCED LOAD APPROXIMATIONS FOR MULTIRATE LOSS NETWORKS

被引:72
作者
CHUNG, SP [1 ]
ROSS, KW [1 ]
机构
[1] UNIV PENN,DEPT SYST,PHILADELPHIA,PA 19104
基金
美国国家科学基金会;
关键词
D O I
10.1109/26.231966
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider a class of loss networks where each connection specifies a route and a bandwidth requirement. If sufficient bandwidth is not available in one of the links along the route, the connection is blocked and lost. Three schemes are considered for approximating blocking probabilities in the network. For a specific star topology, two of these schemes give blocking probabilities that are very close to the exact values under light, moderate, and heavy traffic. The approximations are shown to be asymptotically correct in a natural limiting regime. The implied costs and their relation to revenue sensitivity are also determined for the approximation schemes. The approximate revenue sensitivities are again very close to the exact values for the specific star topology.
引用
收藏
页码:1222 / 1231
页数:10
相关论文
共 25 条
[1]  
CHUNG SP, 1990, THESIS U PENNSYLVANI
[2]  
Cooper R. B., 1964, ANAL ALTERNATE ROUTI
[3]   CONGESTION PROBABILITIES IN A CIRCUIT-SWITCHED INTEGRATED SERVICES NETWORK [J].
DZIONG, Z ;
ROBERTS, JW .
PERFORMANCE EVALUATION, 1987, 7 (04) :267-284
[4]  
HARVEY C, 1979, 9 INT TEL C
[5]  
HUI JY, 1988, IEEE J SELECT AREAS, V6
[6]   IMPLIED COSTS IN LOSS NETWORKS [J].
HUNT, PJ .
ADVANCES IN APPLIED PROBABILITY, 1989, 21 (03) :661-680
[7]  
HUNT PJ, 1989, ADV APPL PROBAB, V21, P500
[8]  
KATZ S, 1967, 5TH P INT TEL C NEW
[9]   BLOCKING IN A SHARED RESOURCE ENVIRONMENT [J].
KAUFMAN, JS .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (10) :1474-1481