A diameter based method for virtual path layout in ATM networks

• Published in: Proceedings of the International IFIP-IEEE Conference on Broadband Communications, Global Infrastructure for the Information Age pp. 501 - 512
• Main Authors: Wong, J.P., Pankaj, R.K.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 1996
• Subjects: Asynchronous transfer mode; Clustering algorithms; Clustering methods; Costs; Delay; Educational institutions; Intelligent networks; Network topology; Routing; Telecommunication traffic
• DOI: 10.1109/ICBC.1996.887819
• ISBN: 9780412759703; 0412759705

ATM networks use virtual paths (VPs) to route information from source to destination. By using VPs, the call set up and switching costs can be reduced. In this paper, we consider the problem of selecting where VPs should be placed. We propose an algorithm that is based on reducing the network diameter. The performance of this diameter method is compared with another heuristic that uses a clustering algorithm. Using simulation, it is shown that the Diameter method performs better than the Clustering method in reducing the average connection cost.