Abstract
We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of Distributed CSP (DisCSP) algorithms in a truly distributed setting, we use a discrete-event network simulator, which allows us to model the impact of different network traffic conditions on the performance of the algorithms. We consider two complete DisCSP algorithms: asynchronous backtracking (ABT) and asynchronous weak commitment search (AWC). In our study of different network traffic distributions, we found that, random delays, in some cases combined with a dynamic decentralized restart strategy, can improve the performance of DisCSP algorithms. More interestingly, we also found that the active introduction of message delays by agents can improve performance and robustness, while reducing the overall network load. Finally, our work confirms that AWC performs better than ABT on satisfiable instances. However, on unsatisfiable instances, the performance of AWC is considerably worse than ABT.
Research supported by AFOSR, grant F49620-01-1-0076 (Intelligent Information Systems Institute) and F49620-01-1-0361 (MURI grant on Cooperative Control of Distributed Autonomous Vehicles in Adversarial Environments), CICYT, TIC2001-1577-C03-03 and DARPA, F30602-00-2-0530 (Controlling Computational Cost: Structure, Phase Transitions and Randomization) and F30602-00-2-0558 (Configuring Wireless Transmission and Decentralized Data Processing for Generic Sensor Networks). The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of AFOSR, DARPA, or the U.S. Government.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Béjar, B. Krishnamachari, C. Gomes, and B. Selman. Distributed constraint satisfaction in a wireless sensor tracking system. In Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence, Seattle, Washington, August 2001. http://liawww.epfl.ch/silaghi/procwsijcai01.html.
S.E. Conry, K. Kuwabara, V.R. Lesser, and R.A. Meyer. Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man, and Cybernetics (Special Section on DAI), 21(6):1462–1477, 1991.
M. Crovella and A. Bestavros. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. IEEE Transactions on Networking, 5(6):835–846, December 1997.
C.P. Gomes, B. Selman, and H.A. Kautz. Boosting combinatorial search through randomization. In AAAI/IAAI, pages 431–437, 1998.
M. Junius, M. Büter, D. Pesch, et al. CNCL. Communication Networks Class Library. Aachen University of Technology. 1996.
D. Kirkpatrick and P. Hell. On the complexity of general graph factor problems. SI AM Journal of Computing, 12(3):601–608, 1983.
B. Krishnamachari. Phase Transitions, Structure, and Complexity in Wireless Networks. PhD thesis, Electrical Engineering, Cornell University, Ithaca, NY, May 2002.
B. Krishnamachari, R. Béjar, and S. B. Wicker. Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks. In Hawaii International Conference on System Sciences (HICSS-35), January 2002.
W. Leland, M. Taqqu, W. Willinger, and D. Wilson. On the Self-Similar Nature of Ethernet Traffic (Extended Version). IEEE Transactions on Networking, 2(1):1–15, February 1994.
R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic’ phase transitions’. Nature, 400:133–137, July 1999.
V. Paxson and S. Floyd. Wide area traffic: the failure of Poisson modeling. IEEE/ ACM Transactions on Networking, 3(3):226–244, 1995.
G. Samorodnitsky and M. S. Taqqu. Stable Non-Gaussian Random Processes. Chapman & Hall, 1994.
Sanders and Air Force Research Lab. ANTs challenge problem. http://www.sanders.com/ants/overview-05-09.pdf 2000.
K. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, 21(6): 1446–1461, 1991.
T. Walsh. The interface between P and NP: COL, XOR, NAE, 1-in-k, and Horn SAT. APES Report, APES-37-2002, 2002.
M. Yokoo. Weak-commitment search for solving constraint satisfaction problems. In Proceedings of the 12th Conference on Artificial Intelligence (AAAI-94), pages 313–318, 1994.
M. Yokoo. Asynchronous weak-commiment search for solving distributed constraint satisfaction problems. In Proccedings of the First International Conference on Principles and Practice of Constraint Programming (CP-95), pages 88–102, 1995.
M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In Proccedings of the Twelfth IEEE International Conference on Distributed Computing Systems, pages 614–621, 1992.
M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge Data Engineering, 10(5):673–685, 1998.
M. Yokoo and K. Hirayama. Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 3(2):198–212, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernàndez, C., Béjar, R., Krishnamachari, B., Gomes, C. (2002). Communication and Computation in Distributed CSP Algorithms. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive