Path Layout in ATM Networks
O. Gerstel, Shmuel Zaks · McGill-Queen's University Press eBooks · 1995
Models and design methods are developed for the layout of virtual paths in ATM networks. We define exact measures for determining whether a given layout uses the network efficiently, does not over-utilize the routing tables, and guarantees short setup time for every connection request. We then present schemes for designing the layout of virtual paths for relatively simple networks (chains, rings and meshes) and extend the results to the dass of tree networks, and discass the optimality of these schemes.