• DocumentCode
    1754343
  • Title

    Multi-objective optimization of regenerator placement using Constraint Programming

  • Author

    Rumley, Sébastien ; Gaumier, Christian ; Szymanek, Radoslaw

  • Author_Institution
    Lab. de Telecommun. (TCOM), Ecole Polytech. Fed. de Lausanne (EPFL), Lausanne, Switzerland
  • fYear
    2011
  • fDate
    8-10 Feb. 2011
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    In translucent optical networks, connections bypass most intermediate nodes transparently. However, their signal quality is affected by the traveled distance and/or the bypass operations. Hence, they might require optical-electrical-optical conversions at some intermediate nodes, in order to regenerate the carried signal. In this paper, we evaluate several approaches to deal with connection routing and regenerator placement within a translucent network. We present our Constraint Programming based multi-objective optimization model which accepts three criteria: total routing cost, total number of regeneration operations, and number of nodes performing regeneration. Our results show that this approach provides solutions in a reasonable running time for problem instances of practical interest. We discuss our method in the context of the state-of-the-art and show that optimization based on one criterion only misses the possibility to improve the solution in respect to the other aspects.
  • Keywords
    optical fibre networks; optimisation; connection routing; constraint programming; multiobjective optimization; optical-electrical-optical conversion; regenerator placement; signal quality; translucent optical network; Optical amplifiers; Optical fiber networks; Optical fibers; Optimization; Repeaters; Routing; Constraint-Programming; Optical Network Design; Optimization; Regenerator Placement;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Optical Network Design and Modeling (ONDM), 2011 15th International Conference on
  • Conference_Location
    Bologna
  • Print_ISBN
    978-1-4244-9596-2
  • Electronic_ISBN
    978-3-901882-42-5
  • Type

    conf

  • Filename
    5753387