THE MAXIMUM MEAN TIME TO BLOCKING ROUTING IN CIRCUIT-SWITCHED NETWORKS

被引：5
|
作者：
CHAN, KM
YUM, TSP
机构：
[1] Department of Information Engineering, the Chinese University of Hong Kong
来源：
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS | 1994年 / 12卷 / 02期
关键词：
Communication channels (information theory) - Computational methods - Critical path analysis - Hierarchical systems - Standards - Switching circuits - Telecommunication networks - Telecommunication services - Telecommunication traffic;
D O I：
10.1109/49.272882
中图分类号：
TM [电工技术]; TN [电子技术、通信技术];
学科分类号：
0808 ; 0809 ;
摘要：
The Maximum Mean Time to Blocking (MTB) Routing is a state- and time-dependent adaptive routing scheme. In this scheme, overflowed calls are routed to an alternate path having the longest mean time to blocking. The mean time to blocking of a link is a function of the trunk group size, the traffic rate, and the instantaneous trunk group occupancy and is a particularly suitable measure of the busy status of links in networks with nonuniform trunk group sizes and asymmetric traffic rates. The computation of the mean time to blocking of a path is very demanding and two approximations are proposed. A comparative performance evaluation through a call-by-call computer simulation shows that the MTB routing can give a superior throughput-blocking performance.
引用
收藏
页码：313 / 321
页数：9
相关论文
共 50 条
12345