Coordination-based optimization of path bandwidth allocation for large-scale telecommunication networks

Authors:
Huang Shengye;Ye Wu;Feng Suili;Song Hui
Affiliations:
College of Computer and Communications, Hunan University, Changsha, China, 411000;Department of Electronics and telecommunications, South China University of Technology, Guangzhou, China, 510640;Department of Electronics and telecommunications, South China University of Technology, Guangzhou, China, 510640;Department of Electronics and telecommunications, South China University of Technology, Guangzhou, China, 510640
Venue:
Computer Communications
Year:
2004

Citing 5
Cited 1

On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks

IEEE/ACM Transactions on Networking (TON)
Multiservice call blocking approximations for virtual path based ATM networks with CBR and VBR traffic

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Analysis of an ATM buffer with self-similar ("fractal") input traffic
A heuristic algorithm for allocating virtual path bandwidth in an ATM network

Computer Communications

The Erlang multirate loss model with Batched Poisson arrival processes under the bandwidth reservation policy

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

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.