Please use this identifier to cite or link to this item:
|Title:||Heuristic algorithm for virtual path based ATM networks||Authors:||Kumaran Veerayah.||Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
|Issue Date:||1999||Abstract:||This report evaluates the performance of a heuristic algorithm for dynamic allocation of virtual path (VP) bandwidth in an ATM network. A new VP concept, where the VPs are used to provide logical direct connections between any two switching nodes through intermediate cross-connect nodes in the network, is introduced. Each ATM switch is connected to every other ATM switch by multiple pairs of VPs. Each directed ATM switch pair, known as demand pair, is offered with multiple classes of traffic with different bandwidth requirement.||URI:||http://hdl.handle.net/10356/13258||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.