A Hierarchical Loss Network Model For Performance Evaluation

A Hierarchical Loss Network Model For Performance Evaluation

Title : A Hierarchical Loss Network Model For Performance Evaluation
Authors :
Baras, John S.
Liu, Mingyan
Conference : ATIRP 4th Annual Conference pp. 211-215
Date: March 21 - March 23, 2000

In this paper we present a hierarchical loss network model for estimating the end-to-end blocking probabili­ties for large networks. As networks grow in size, nodes tend to form clusters geographically and hierarchical routing schemes are more commonly used. Loss network and reduced load models are often used to approximate end-to-end call blocking probabilities and hence through­put. However so far all work being done in this area is for fiat networks with fiat routing schemes. We aim at developing a more efficient approximation method for networks that have a natural hierarchy and/or when some form of hierarchical routing policy is used. We present two hierarchical models in detail for fixed hier­archical routing and dynamic hierarchical routing poli­cies, respectively, via the notion of network abstraction, route segmentation, traffic segregation and aggregation. Computation is done separately within each cluster (lo­cal) and among clusters (global), and the fixed point is obtained by iteration between local and global computa­tions. We also present numerical results for the first case.

Download Full Paper