Sonet Network Design Problems

Marie Pelleau
(Université de Nantes)
Pascal Van Hentenryck
(Brown University)
Charlotte Truchet
(Université de Nantes)

This paper presents a new method and a constraint-based objective function to solve two problems related to the design of optical telecommunication networks, namely the Synchronous Optical Network Ring Assignment Problem (SRAP) and the Intra-ring Synchronous Optical Network Design Problem (IDP). These network topology problems can be represented as a graph partitioning with capacity constraints as shown in previous works. We present here a new objective function and a new local search algorithm to solve these problems. Experiments conducted in Comet allow us to compare our method to previous ones and show that we obtain better results.

In Yves Deville and Christine Solnon: Proceedings 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2009), Lisbon, Portugal, 20 September 2009, Electronic Proceedings in Theoretical Computer Science 5, pp. 81–95.
Published: 8th October 2009.

ArXived at: https://dx.doi.org/10.4204/EPTCS.5.7 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org