By Topic

Performance analysis for hierarchical multirate loss networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ben-Jye Chang ; Dept. of Comput. Sci. & Inf. Eng., Chaoyang Univ. of Technol., Taichung, Taiwan ; Ren-Hung Hwang

The reduced load approximation technique has been extensively applied to flat networks, but the feasibility of applying it to hierarchical network model has seldom been described. Hierarchical routing is essential for large networks such as the Internet inter/intra-domain routing hierarchy and the Private Network to Node Interface (PNNI) standard. Therefore, this paper proposes an efficient and accurate analytical model for evaluating the performance of hierarchical networks with multiple classes of traffic. A performance analysis model with considering multiple classes of traffic, the complexity of analytical and explosion of computation will be extremely increased, and hence, result in inaccurate analytical. The issue of multiple classes of traffic has to be addressed in performance analysis model. In this paper, we first study the reduced load approximation model for loss networks, and then propose a novel performance evaluation model for large networks with multirate hierarchical routing. The hierarchical evaluation model is based on decomposing a hierarchical route into several analytic hierarchical segments. Once the blockings of these hierarchical segments are accurately determined, the blocking of the hierarchical path can be estimated accurately from these segments blocking. Numerical results indicate that the proposed hierarchical reduced load approximation yields quite accurate blocking probabilities as compared to that of simulation results. Furthermore, the accuracy of the proposed hierarchical reduced load approximation heuristic is independent of the blocking or the offered traffic load. Finally, we also draw some remarks on the convergence of the reduced load based approximation analysis model.

Published in:

IEEE/ACM Transactions on Networking  (Volume:12 ,  Issue: 1 )