Bandwidth Allocation for Virtual Paths in ATM Networks with Dynamic Routing

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

10 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)626-636
Journal / PublicationIEICE Transactions on Communications
VolumeE83-B
Issue number3
Publication statusPublished - 2000

Abstract

SUMMARY The Virtual Path (VP) concept in ATM networks simplifies network structure, traffic control and resource management. For VP formulation, a VP can carry traffic of the same type (the separate scheme) or of different types (the unified scheme). For VP adjustment, a certain amount of bandwidth can be dynamically assigned (reserved) to VPs, where the amount (the bandwidth incrémental/décrémentai size) is a predetermined system parameter. In this paper, we study Least Loaded Pathbased dynamic routing schemes with various residual bandwidth definitions under different bandwidth allocation (VP formulation and adjustment) schemes. In particular, we evaluate the call blocking probability and VP set-up processing load with varying (bandwidth) incremental sizes. Also, We investigate numerically how the use of VP trades the blocking probability with the processing load. It is found that the unified scheme could outperform the separate scheme in certain incremental sizes. Moreover, we propose two ways to reduce the processing load without increasing the blocking probability. Using these methods, the separate scheme always outperforms the unified scheme.

Research Area(s)

  • Atm networks, Bandwidth allocation, Dynamic routing, Virtual paths, Vp adjustment