Technical Report CS0798

We develop methods for designing the layout of virtual paths on a given ATM network. We define precise measures for determining if a given layout uses the network efficiently, does not over-utilize the routing tables, and provides short setup time for every connection request. We then present a scheme for designing the layout of virtual paths for relatively simple networks (rings, meshes) and extend the results to a wider class of networks (general trees). We conclude by presenting a different technique, which is not as efficient but may be applied to a general network.