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 条
  • [1] On LLR routing in circuit-switched networks
    Chang, HL
    Hwang, RN
    TWELFTH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN-12), PROCEEDINGS, 1998, : 456 - 461
  • [2] On LLR routing in circuit-switched networks
    Chang, HL
    Hwang, RH
    INFORMATION NETWORKING IN ASIA, 2001, 3 : 37 - 50
  • [3] On LLR routing in circuit-switched networks
    Hwang, RH
    Chang, HL
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2001, E84B (05) : 1397 - 1405
  • [4] Dynamic routing in circuit-switched networks
    Ericsson Rev (Engl Ed), 4 (169-177):
  • [5] On LLR routing in circuit-switched networks
    Hwang, R.-H.
    Chang, H.-L.
    2001, Institute of Electronics, Information and Communication, Engineers, IEICE (E85-B)
  • [6] Achieving bounded blocking in circuit-switched networks
    Zhang-Shen, Rui
    Kodialam, Murali
    Lakshman, I. V.
    25TH IEEE INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-7, PROCEEDINGS IEEE INFOCOM 2006, 2006, : 2027 - 2035
  • [7] BLOCKING PROBABILITIES IN LARGE CIRCUIT-SWITCHED NETWORKS
    KELLY, FP
    ADVANCES IN APPLIED PROBABILITY, 1986, 18 (02) : 473 - 505
  • [8] LIMITING DISTRIBUTION OF THE BLOCKING PROBABILITY FOR CIRCUIT-SWITCHED NETWORKS
    PEYRAVI, H
    KHAN, K
    FARRELL, PA
    COMPUTERS & ELECTRICAL ENGINEERING, 1993, 19 (03) : 231 - 244
  • [9] A mutual alternative routing model for circuit-switched networks
    Duggan, P
    ELECTRONICS & COMMUNICATION ENGINEERING JOURNAL, 1996, 8 (04): : 183 - 190
  • [10] DYNAMIC ROUTING AND CALL REPACKING IN CIRCUIT-SWITCHED NETWORKS
    GIRARD, A
    HURTUBISE, S
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1983, 31 (12) : 1290 - 1294
12345