Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Abstract--Today, most routing problems are solved using Dijkstra's shortest path algorithm. Many efficient implementa-
 

Summary: Abstract--Today, most routing problems are solved using
Dijkstra's shortest path algorithm. Many efficient implementa-
tions of Dijkstra's algorithm exist and can handle large net-
works 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 re-
searched 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 in-
telligent 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 En-
gineering 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 rout-

  

Source: Aloul, Fadi - Department of Computer Engineering, American University of Sharjah

 

Collections: Engineering