Decentralized Constraint Satisfaction

03/02/2011
by   K. R. Duffy, et al.
0

We show that several important resource allocation problems in wireless networks fit within the common framework of Constraint Satisfaction Problems (CSPs). Inspired by the requirements of these applications, where variables are located at distinct network devices that may not be able to communicate but may interfere, we define natural criteria that a CSP solver must possess in order to be practical. We term these algorithms decentralized CSP solvers. The best known CSP solvers were designed for centralized problems and do not meet these criteria. We introduce a stochastic decentralized CSP solver and prove that it will find a solution in almost surely finite time, should one exist, also showing it has many practically desirable properties. We benchmark the algorithm's performance on a well-studied class of CSPs, random k-SAT, illustrating that the time the algorithm takes to find a satisfying assignment is competitive with stochastic centralized solvers on problems with order a thousand variables despite its decentralized nature. We demonstrate the solver's practical utility for the problems that motivated its introduction by using it to find a non-interfering channel allocation for a network formed from data from downtown Manhattan.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2014

Fast Set Bounds Propagation Using a BDD-SAT Hybrid

Binary Decision Diagram (BDD) based set bounds propagation is a powerful...
research
09/20/2023

Using deep learning to construct stochastic local search SAT solvers with performance bounds

The Boolean Satisfiability problem (SAT) is the most prototypical NP-com...
research
05/07/2011

Solving Rubik's Cube Using SAT Solvers

Rubik's Cube is an easily-understood puzzle, which is originally called ...
research
01/15/2014

Exploiting Single-Cycle Symmetries in Continuous Constraint Problems

Symmetries in discrete constraint satisfaction problems have been explor...
research
12/08/2022

Quantum-Inspired Approximations to Constraint Satisfaction Problems

Two contrasting algorithmic paradigms for constraint satisfaction proble...
research
08/01/2013

An Enhanced Features Extractor for a Portfolio of Constraint Solvers

Recent research has shown that a single arbitrarily efficient solver can...
research
01/16/2014

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

We offer a new understanding of some aspects of practical SAT-solvers th...

Please sign up or login with your details

Forgot password? Click here to reset