Sonet Network Design Problems
Marie Pelleau, Pascal Van Hentenryck, Charlotte Truchet

TL;DR
This paper introduces a new method and objective function for designing optical telecommunication networks, specifically addressing SRAP and IDP problems, with improved results demonstrated through experiments.
Contribution
A novel constraint-based objective function and local search algorithm for optical network design problems, outperforming previous methods.
Findings
Better network design solutions in experiments
Enhanced algorithm efficiency and effectiveness
Improved network topology optimization
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
