Concept

Blockchain

Related publications (91)

Efficient Peer-to-Peer Belief Propagation

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 redistrib ...

2006

A Peer-to-Peer Architecture for Information Retrieval Across Digital Library Collections

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Fabius Klemm

Peer-to-peer networks have been identified as promising architectural concept for developing search scenarios across digital library collections. Digital libraries typically offer sophisticated search over their local content, however, search methods invol ...

Springer2006

Peer-to-Peer Applications Beyond File Sharing: Overlay Network Requirements and Solutions

In this paper we analyze the functional and non-functional requirements of peer-to-peer (P2P) systems that go beyond the needs of the well explored file-sharing P2P systems. Four basic subcategories are suggested to classify the non-functional requirements ...

2006

Building a peer-to-peer full-text Web search engine with highly discriminative keys

Karl Aberer, Martin Rajman, Vinh Toan Luu, Ivana Podnar, Fabius Klemm

Web search engines designed on top of peer-to-peer (P2P) overlay networks show promise to enable attractive search scenarios operating at a large scale. However the design of effective indexing techniques for extremely large document collections still rais ...

2005

PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Providing reliable group communication is an ever recurring issue in distributed settings. In mobile ad hoc networks, this issue becomes more significant since all nodes act as peers, while the issue gets even more challenging due to highly dynamic and unp ...

2004

An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments

Rodrigo Malta Schmidt, Benoît Garbinato, Fernando Pedone

In this paper, we propose a novel approach for solving the reliable broadcast problem in a probabilistic unreliable model. Our approach consists in first defining the optimality of probabilistic reliable broadcast algorithms and the adaptiveness of algorit ...

2004

Lightweight Probabilistic Broadcast

Rachid Guerraoui, Sidath Handurukande, Patrick Eugster

The growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong r ...

2003

PAN: Providing Reliable Storage in Mobile Ad Hoc Networks with Probabilistic Quorum Systems

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes even more challenging due to highly dynamic and unpredictable topology changes ...

2003

PAN: Providing Reliable Storage in Mobile Ad Hoc Networks with Probabilistic Quorum Systems

Jean-Pierre Hubaux, Patrick Eugster

2003

PILOT: ProbabIlistic Lightweight grOup communication sysTem for Mobile Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

2003

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.