Efficient Peer-to-Peer Belief Propagation

  • Roman Schmidt
  • Karl Aberer
Conference paper

DOI: 10.1007/11914853_31

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4275)
Cite this paper as:
Schmidt R., Aberer K. (2006) Efficient Peer-to-Peer Belief Propagation. In: Meersman R., Tari Z. (eds) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. OTM 2006. Lecture Notes in Computer Science, vol 4275. Springer, Berlin, Heidelberg

Abstract

In this paper, we will present an efficient approach for distributed inference. We use belief propagation’s message-passing algorithm on top of a DHT storing a Bayesian network. Nodes in the DHT run a variant of the spring relaxation algorithm to redistribute the Bayesian network among them. Thereafter correlated data is stored close to each other reducing the message cost for inference. We simulated our approach in Matlab and show the message reduction and the achieved load balance for random, tree-shaped, and scale-free Bayesian networks of different sizes.

As possible application, we envision a distributed software knowledge base maintaining encountered software bugs under users’ system configurations together with possible solutions for other users having similar problems. Users would not only be able to repair their system but also to foresee possible problems if they would install software updates or new applications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Roman Schmidt
    • 1
  • Karl Aberer
    • 1
  1. 1.School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL)LausanneSwitzerland

Personalised recommendations