A heuristic algorithm for allocating virtual path bandwidth in an ATM network

  • Authors:
  • T.-H Cheng;Y.-K Sze;C.-W Tan

  • Affiliations:
  • Network Technology Research Centre, Block S2, School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore;Software Development Centre, Motorola, Singapore, Singapore;Network Technology Research Centre, Block S2, School of Electrical and Electronic Engineering, Nanyang Technological University, Nanyang Avenue, Singapore 639798, Singapore

  • Venue:
  • Computer Communications
  • Year:
  • 1999

Quantified Score

Hi-index 0.24

Visualization

Abstract

This article presents a heuristic algorithm for allocating bandwidth to the virtual paths (VPs) in an asynchronous transfer mode network. Given the network topology, link capacity, routes of VPs and offered traffic, the proposed algorithm is able to determine how bandwidth shall be allocated to the VPs such that the highest call blocking probability of all source-destination pairs is minimised. Based on the results obtained, we conclude that the proposed algorithm is suitable for multi-hourly control of VP bandwidth allocation and that knowledge of the optimal allocation for the previous bandwidth allocation epoch can be capitalised to improve the performance of the proposed algorithm.