Conference Proceedings

Design of ATM virtual path connection networks with service separation

A Arvidsson, J de Kock, A Krzesinski, P Taylor

IEEE International Workshop on Modeling Analysis and Simulation of Computer and Telecommunication Systems Proceedings | IEEE COMPUTER SOC | Published : 2000

Abstract

We present an efficient algorithm to compute an optimal service separated virtual path connection network (VPCN) consisting of several logical subnetworks, one for each service class. The algorithm implements a bandwidth market where each VPC computes the prices at which it is willing to buy and sell bandwidth. These prices determine the allocation of bandwidth to virtual path connections (VPCs) in a series of transactions. After each transaction the VPCN is adjusted, bandwidth supplies and prices are adjusted and the algorithm computes the next bandwidth transaction. We apply our algorithm and another method to design an optimal service separated VPCN for a small network consisting of 10 no..

View full abstract

University of Melbourne Researchers