A path bandwidth allocation scheme for hierarchical telecommunication networks

Abstract

This paper presents a model for large-scale hierarchical networks which leads to an almost optimal path bandwidth (PB) allocation, under constraints posed by the installed bandwidth in the transmission links of the network. The PB allocation procedure consists of three phases. In the first phase, a suitable decomposition of the whole network takes place, in which the hierarchical network is split to a set of sub-networks of just one level. In the second phase, the optimization algorithm developed for one-level telecommunication networks is applied to each subnetwork to define the optimal PB allocation. The optimization criterion is to minimize the worst call blocking probability (CBP) of all switching pairs of the sub-network. In the third phase, composition of the sub-networks takes place in a successive way which leads to the final PB allocation. As the hierarchical network is built up from optimized sub-networks, it is considered that it has an almost optimal PB allocation. The proposed PB allocation scheme is explained by means of an example.