We provide an algorithm for the VP distribution problem that satisfies nodal constraints on the processing load and blocking constraints for each source-destination pair. The algorithm maximizes the network revenue under the above set of constraints and is independent of the number of traffic classes in the network, the method of representation of networking resources, the admission control policy used in every link and VP, and the network routing scheme. We apply the algorithm to the Xunet ATM testbed and study several of its performance characteristics.
展开▼
