The maximum mean time to blocking routing in circuit-switched networks

Author

Chan, Kit-Man ; Yum, Tak-Shing Peter

Author_Institution

Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong

Volume

12

Issue

2

fYear

1994

fDate

2/1/1994 12:00:00 AM

Firstpage

313

Lastpage

321

Abstract

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

Keywords

approximation theory; circuit switching; performance evaluation; probability; telecommunication network routing; telephone networks; telephone traffic; approximations; asymmetric traffic rates; blocking probability; busy status; call-by-call computer simulation; circuit-switched networks; instantaneous trunk group occupancy; maximum mean time to blocking; nonuniform trunk group sizes; performance evaluation; state-dependent adaptive routing; telephone network; throughput-blocking performance; time-dependent adaptive routing; traffic rate; Circuits; Intelligent networks; Particle measurements; Routing; Size measurement; Switches; Telecommunication computing; Telecommunication traffic; Telephony; Time measurement;

fLanguage

English

Journal_Title

Selected Areas in Communications, IEEE Journal on

Publisher

ieee

ISSN

0733-8716

Type

jour

DOI

10.1109/49.272882

Filename

272882