Constraint based design of ATM networks, an experimental study

This paper describes an experimental study of constraint-based network design. We used a novel network design tool, implemented in Java, to design representative networks joining major U.S. cities. The cost of three topologies: Best Star, Minimum Spanning Tree (MST), and Delaunay Triangulation, are compared, with and without localized tra c constraints. The best star network gives near optimal result when the tra c is only constrained by source and sink capacity of switches ( at tra c constraints). With localized tra c constraints, the most cost e ective network has a structure similar to the MST. The cheapest network has a tree structure when there are only at tra c constraints, but can have cycles when localized tra c constraints are present. Constraint Based Design of ATM Networks, an Experimental Study Hongzhou Ma Inderjeet Singh Jonathan Turner hma@dworkin.wustl.edu inder@dworkin.wustl.edu jst@arl.wustl.edu