A low-cost design of next generation SONET/SDH networks with multiple constraints

This study investigates the problem of ring-node assignment in a multiservice SDH/SONET optical network design with network capacity constraint. The problem is characterized as a graph-partitioning problem, and a heuristic algorithm based on constraints programming satisfaction technology is proposed. The algorithm is tested in OPNET simulation environment using different network models derived from a hypothetical case study of an optical network design for Bellville area in Cape Tow, South Africa. Data are collected for analysis from the simulation, and the number and the capacity of nodes and ring are the control variables under investigation. Simulation results for the different network model under uniform and non-uniform traffic demands are reported. The algorithm is able to return a solution with a performance measure that is close to optimal.