Message delay and Asynchronous DisCSP search

Distributed constraint satisfaction problems (DisCSPs) are composed of agents, each holding its own variables, that are connected by constraints to variables of other agents. Due to the distributed nature of the problem, message delay can have unexpected effects on the behavior of distributed search algorithms on DisCSPs. This has been shown in experimental studies of asynchronous backtracking algorithms [1, 9]. To evaluate the impact of message delay on the run of DisCSP search algorithms, a model for distributed performance measures is presented. The model counts the number of non concurrent constraints checks, to arrive at a solution, as a non concurrent measure of distributed computation. A simpler version measures distributed computation cost by the number of non-concurrent steps of computation. An algorithm for computing these distributed measures of computational effort is described. The realization of the model for measuring performance of distributed search algorithms is a simulator which includes the cost of message delays. The performance of two asynchronous search algorithms is measured on randomly generated instances of DisCSPs with delayed messages. The Asynchronous Weak Commitment (AWC) algorithm and Asynchronous Backtracking (ABT ). The intrinsic reordering process of AWC dictates a need for a more complex count of non-concurrent steps of computation. The improved counting algorithm is also needed for Dynamic ordered ABT . The delay of messages is found to have a strong negative effect on AWC and a smaller effect on dynamically ordered ABT .

[1]  Amnon Meisels,et al.  Concurrent Dynamic Backtracking for Distributed CSPs , 2004, CP.

[2]  Makoto Yokoo,et al.  The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results , 2000, CP.

[3]  Ehud Gudes,et al.  Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs) , 1996, CP.

[4]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[5]  Patrick Prosser,et al.  An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[6]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[7]  Boi Faltings,et al.  Asynchronous aggregation and consistency in distributed constraint satisfaction , 2005, Artif. Intell..

[8]  Martin E. Dyer,et al.  Locating the Phase Transition in Binary Constraint Satisfaction Problems , 1996, Artif. Intell..

[9]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[10]  Amnon Meisels,et al.  Dynamic Ordering for Asynchronous Backtracking on DisCSPs , 2005, Constraints.

[11]  Carmel Domshlak,et al.  Sensor networks and distributed CSP: communication, computation and complexity , 2005, Artif. Intell..

[12]  Christian Bessiere,et al.  Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..

[13]  Amnon Meisels,et al.  Synchronous vs Asynchronous search on DisCSPs , 2003 .

[14]  Amnon Meisels,et al.  Comparing performance of distributed constraints process ing algorithms , 2002 .

[15]  Makoto Yokoo,et al.  Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems , 1995, CP.