language: en

Constraint Based Design of ATM Networks, an Experimental Study

Hongzhou Ma, Inderjeet Singh, Jonathan Turner
wucs-97-15 April 97
Department of Computer Science
Campus Box 1045
Washington University
One Brookings Drive St. Louis, MO 63130-4899

Abstract 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 traffic constraints. The best star network gives near optimal result when the traffic is only constrained by source and sink capacity of switches (flat traffic constraints). With localized traffic constraints, the most cost effective network has a structure similar to the MST. The cheapest network has a tree structure when there are only flat traffic constraints, but can have cycles when localized traffic constraints are present.