Routing in Optical and Non-Optical Networks using Boolean Satisfiability

Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks in short runtimes. Despite these advances, it is difficult to incorporate user-specific conditions on the solution when using Dijkstra’s algorithm. Such conditions can include forcing the path to go through a specific node, forcing the path to avoid a specific node, using any combination of inclusion/exclusion of nodes in the path, etc. In this paper, we propose a new approach to solving the shortest path problem using advanced Boolean satisfiability (SAT) techniques. SAT has been heavily researched in the last few years. Significant advances have been proposed and has lead to the development of powerful SAT solvers that can handle very large problems. SAT solvers use intelligent search algorithms that can traverse the search space and efficiently prune parts that contain no solutions. These solvers have recently been used to solve many problems in Engineering and Computer Science. In this paper, we show how to formulate the shortest path problem in non-optical networks as a SAT problem. We also show how to use SAT in finding routing and wavelength assignments in optical networks. Our approach is verified on various network topologies. The results are promising and indicate that using the proposed approach can improve on previous techniques.

[1]  Sharad Malik,et al.  Using configurable computing to accelerate Boolean satisfiability , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Matthew L. Ginsberg,et al.  Inference methods for a pseudo-boolean satisfiability solver , 2002, AAAI/IAAI.

[3]  Xiaowei Yang,et al.  Compact routing on Internet-like graphs , 2003, IEEE INFOCOM 2004.

[4]  Matthew Doar,et al.  A better model for generating test networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[5]  Byrav Ramamurthy,et al.  Wavelength conversion in WDM networking , 1998, IEEE J. Sel. Areas Commun..

[6]  Karem A. Sakallah,et al.  Pueblo: a modern pseudo-Boolean SAT solver , 2005, Design, Automation and Test in Europe.

[7]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[8]  Masahiro Fujita,et al.  Symbolic model checking using SAT procedures instead of BDDs , 1999, DAC '99.

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

[10]  Ahmed Mokhtar,et al.  Adaptive wavelength routing in all-optical networks , 1998, TNET.

[11]  T. Bass,et al.  Internet exterior routing protocol development: problems, issues, and misconceptions , 1997, IEEE Netw..

[12]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[13]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[14]  S. D. Personick.  Evolving toward the next-generation Internet: challenges in the path forward , 2002 .

[15]  Venkatesan Muthukumar,et al.  Alternate path routing algorithm for traffic engineering in the Internet , 2003, Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing.

[16]  Viktor K. Prasanna,et al.  Run-time performance optimization of an FPGA-based deduction engine for SAT solvers , 2001, TODE.

[17]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[18]  Igor L. Markov,et al.  Breaking instance-independent symmetries in exact graph coloring , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[19]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[20]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[21]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..

[22]  Daniel G. Saab,et al.  Satisfiability on reconfigurable hardware , 1997, FPL.

[23]  David Blaauw,et al.  Robust SAT-Based Search Algorithm for Leakage Power Reduction , 2002, PATMOS.

[24]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[25]  Robert K. Brayton,et al.  Using SAT for combinational equivalence checking , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

[26]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[27]  Keith W. Ross,et al.  Computing approximate blocking probabilities for large loss networks with state-dependent routing , 1993, TNET.

[28]  Iouliia Skliarova,et al.  A software/reconfigurable hardware SAT solver , 2004, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[29]  Kai-Yeung Siu,et al.  Fault-Tolerant Routing in the Internet without Flooding , 2000 .

[30]  Francesco Masetti-Placci,et al.  Routing strategies for optical paths in WDM networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[31]  Rob A. Rutenbar,et al.  FPGA routing and routability estimation via Boolean satisfiability , 1997, FPGA '97.

[32]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[33]  Rob A. Rutenbar,et al.  A comparative study of two Boolean formulations of FPGA detailed routing constraints , 2001, IEEE Transactions on Computers.

[34]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[35]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[36]  Anthony S. Acampora,et al.  Benefits of Wavelength Translation in All-Optical Clear-Channel Networks , 1996, IEEE J. Sel. Areas Commun..

[37]  Igor L. Markov,et al.  Generic ILP versus specialized 0-1 ILP: an update , 2002, IEEE/ACM International Conference on Computer Aided Design, 2002. ICCAD 2002..

[38]  Andreas Kuehlmann,et al.  A fast pseudo-Boolean constraint solver , 2003, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[39]  Imrich Chlamtac,et al.  Purely optical networks for terabit communication , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[40]  Moayad Fahim Ali,et al.  Fault diagnosis and logic debugging using Boolean satisfiability , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[41]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.