Solving the Routing and Wavelength Assignment problem with conflict-driven ASP solvers

The Routing and Wavelength Assignment (RWA) problem is an optical networking problem that aims to improve data transmission by eliminating optoelectronic conversions through the network. The RWA problem is in the set of NP-complete problems and thus, it is also an interesting problem from a computational point of view. It can be solved in different flavors, being the Static Lightpath Establishment (SLE) the one studied in this work.In this work we define different Answer Set Programming (ASP) encodings for the RWA–SLE problem and study their performance when solving the problem with a state-of-the-art conflict-driven ASP solver: clasp. We investigate the relation between the performance of the ASP encodings and two different characteristics of the encodings: the number of nogoods and loop nogoods generated during search and a new measure for their tightness that we introduce. We also compare the performance of our ASP encodings with the best performing pseudo-Boolean encoding that we presented in a previous work.

[1]  Fadi A. Aloul,et al.  Routing in Optical and Non-Optical Networks using Boolean Satisfiability , 2007, J. Commun..

[2]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[3]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[4]  Ramón Béjar,et al.  Towards an Efficient Use of Resources in All-Optical Networks , 2011, CCIA.

[5]  Wolfgang Faber,et al.  The DLV system for knowledge representation and reasoning , 2002, TOCL.

[6]  Jennifer Yates,et al.  Wavelength converters in dynamically-reconfigurable WDM networks , 1999, IEEE Communications Surveys & Tutorials.

[7]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[8]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[9]  Asuman E. Ozdaglar,et al.  Routing and wavelength assignment in optical networks , 2003, TNET.

[10]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[11]  Miroslaw Truszczynski,et al.  The Second Answer Set Programming Competition , 2009, LPNMR.

[12]  Brigitte Jaumard,et al.  Comparison of ILP formulations for the RWA problem , 2007, Opt. Switch. Netw..

[13]  Ulrich Killat,et al.  An Exact ILP Formulation for Optimal Wavelength Converter Usage and Placement in WDM Networks , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[14]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[15]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[16]  Chitta Baral.  Using Answer Set Programming for Knowledge Representation and Reasoning: Future Directions , 2008, ICLP.

[17]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[18]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[19]  Mario Alviano,et al.  The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track , 2011, LPNMR.

[20]  Martin Gebser,et al.  clasp : A Conflict-Driven Answer Set Solver , 2007, LPNMR.

[21]  Miroslaw Truszczynski,et al.  The First Answer Set Programming System Competition , 2007, LPNMR.

[22]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[23]  Sunil P. Khatri,et al.  A Boolean satisfiability based solution to the routing and wavelength assignment problem in optical telecommunication networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.