Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Indexing data-oriented overlay networks using belief propagation

Summary: Indexing data-oriented overlay networks using
belief propagation
Danny Bickson1
, Danny Dolev1
and Yair Weiss1
Karl Aberer2
, Manfred Hauswirth2
The Hebrew University of Jerusalem, Israel
2 ´Ecole Polytechnique F´ed´erale de Lausanne, Switzerland
Abstract. In this paper we discuss the problem of data-oriented parti-
tioning in large-scale overlay networks as required by peer-to-peer databases
or peer-to-peer information retrieval. The goal is to partition a large set
of nodes into k partitions with the additional requirement of meeting
certain load-balancing constraints without global knowledge of the net-
work's parameters, i.e., the desired number of partitions and the partition
distribution function are not known in advance and change dynamically
as the network evolves. This key problem in large-scale decentralized
systems has so far received only very limited attention. The novel con-
tributions described in the following are the definition of a distributed


Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne


Collections: Computer Technologies and Information Sciences