Sonet Network Design Problems

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). The...

Full description

Bibliographic Details
Main Authors: Marie Pelleau, Pascal Van Hentenryck, Charlotte Truchet
Format: Article
Language:English
Published: Open Publishing Association 2009-10-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/0910.1255v1
id doaj-e504cbabbe2a432bac71ac332872e73f
record_format Article
spelling doaj-e504cbabbe2a432bac71ac332872e73f2020-11-24T22:07:17ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-10-015Proc. LSCS 2009819510.4204/EPTCS.5.7Sonet Network Design ProblemsMarie PelleauPascal Van HentenryckCharlotte TruchetThis 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. http://arxiv.org/pdf/0910.1255v1
collection DOAJ
language English
format Article
sources DOAJ
author Marie Pelleau
Pascal Van Hentenryck
Charlotte Truchet
spellingShingle Marie Pelleau
Pascal Van Hentenryck
Charlotte Truchet
Sonet Network Design Problems
Electronic Proceedings in Theoretical Computer Science
author_facet Marie Pelleau
Pascal Van Hentenryck
Charlotte Truchet
author_sort Marie Pelleau
title Sonet Network Design Problems
title_short Sonet Network Design Problems
title_full Sonet Network Design Problems
title_fullStr Sonet Network Design Problems
title_full_unstemmed Sonet Network Design Problems
title_sort sonet network design problems
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2009-10-01
description 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.
url http://arxiv.org/pdf/0910.1255v1
work_keys_str_mv AT mariepelleau sonetnetworkdesignproblems
AT pascalvanhentenryck sonetnetworkdesignproblems
AT charlottetruchet sonetnetworkdesignproblems
_version_ 1725821142892019712