Title :
The decomposition of a blocking model for connection-oriented networks
Author :
Li, C.Y. ; Wai, P.K.A. ; Li, Victor O K
Author_Institution :
Dept. of Electron. & Inf. Eng., Hong Kong Polytech. Univ., China
fDate :
6/1/2004 12:00:00 AM
Abstract :
Two general-purpose decomposition methods to calculate the blocking probabilities of connection-oriented networks are presented. The methods are based on either the call status or the link status of the networks, and can significantly reduce the required computational times. A heuristic is presented to simplify the application of the proposed decomposition methods on networks with irregular topologies. Numerical examples are given to demonstrate the applications of the proposed methods.
Keywords :
circuit switching; computational complexity; network topology; telecommunication network routing; telecommunication traffic; blocking model; blocking probabilities; circuit switched networks; computational time; connection-oriented networks; decomposition method; network call status; network link status; network traffic; Approximation methods; Asynchronous transfer mode; Circuits; Computational efficiency; Computational modeling; Computer networks; Monte Carlo methods; Network topology; Telecommunication traffic; Traffic control; Blocking probability; Monte Carlo summation; circuit-switched networks; connection-oriented networks; decomposition methods;
Journal_Title :
Networking, IEEE/ACM Transactions on
DOI :
10.1109/TNET.2004.828937
