Constraint satisfaction, packet routing, and the lovasz local lemma.
David G. HarrisAravind SrinivasanPublished in: STOC (2013)
Keyphrases
- constraint satisfaction
- packet switching
- packet transmission
- switched networks
- ip traffic
- network layer
- constraint satisfaction problems
- packet forwarding
- node density
- ip networks
- heuristic search
- intermediate nodes
- destination node
- routing table
- routing algorithm
- routing protocol
- constraint programming
- constraint propagation
- network topology
- product configuration
- constraint relaxation
- ad hoc networks
- phase transition
- relaxation labeling
- routing problem
- combinatorial problems
- internet traffic
- backtrack search
- probabilistic reasoning
- sat solvers
- constraint optimization
- packet loss
- russian doll search
- ip addresses
- np hard
- search space
- constraint networks
- np complete
- wireless sensor networks
- robust fault detection
- neural network