Coordination-based optimization of path bandwidth allocation for large-scale telecommunication networks
In this paper, the authors propose a new optimization method of path bandwidth allocation for large-scale telecommunication networks. By using the decomposition-coordination method to get an optimal solution of path bandwidth allocation for large-scale communication networks, a big network is divided into small and inter-connected sub-networks. The path bandwidth allocation procedure is composed of three phases. Firstly, the large-scale network is divided into small sub-networks; then, a decomposition-coordination procedure is imposed to allocate path bandwidths between nodes within each sub-network and to find the bottleneck subnet of the whole network and to evaluate the worst call blocking probability of it; finally, path bandwidths of source-destination pairs between different sub-networks are computed out by successive use of an ordinary optimization algorithm. Comparing with existing algorithms, our results show that the Decomposition Coordination Large-scale Path Bandwidth Management (DCLPBM) algorithm can get results with high accuracy and both spatial and time complexities are reduced. As the coordination procedure in our model is quite simple, the DCLPBM can be converted to a distributed computing version easily. This is fascinating from a point of view of managing the network in a real network environment. (C) 2003 Elsevier B.V. All rights reserved.
path bandwidth allocation decomposition-coordination distributed computing atm