Publications de Fabius Klemm | EPFL Graph Search

Handling Very Large Numbers of Messages in Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Dejan Kostic, Fabius Klemm

2009

A high-performance distributed hash table for peer-to-peer information retrieval

This thesis describes our research results in the context of peer-to-peer information retrieval (P2P-IR). One goal in P2P-IR is to build a search engine for the World Wide Web (WWW) that runs on up to hundreds of thousands or even millions computers distri ...

EPFL2008

AlvisP2P: Scalable Peer-to-Peer Text Retrieval in a Structured P2P Network

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

In this paper we present the AlvisP2P IR engine, which enables efficient retrieval with multi-keyword queries from a global document collection available in a P2P network. In such a network, each peer publishes its local index and invests a part of its loc ...

2008

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

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

The suitability of peer-to-peer (P2P) approaches for full-text Web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retrieval from very large document collections. In this contribution we formalize ...

IEEE2007

On Routing in Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm, Sarunas Girdzijauskas

There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...

2007

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm, Dejan Kostic

Advanced applications for Distributed Hash Tables (DHTs), such as Peer-to-Peer Information Retrieval, require a DHT to quickly and efficiently process a large number (in the order of millions) of requests. In this paper we study mechanisms to optimize the ...

2007

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

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

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

Congestion Control for Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm

Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, ...

IEEE2006

Beyond term indexing: A P2P framework for Web information retrieval

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

Web search over peer-to-peer (P2P) networks shows promise to become an alternative to the state-of-the-art search engines since P2P overlays offer means for decentralized search across widely-distributed document collections. However, the design of effecti ...

2006

Aggregation of a Term Vocabulary for Peer-to-Peer Information Retrieval: a DHT Stress Test

Karl Aberer, Fabius Klemm

There has been an increasing research interest in developing full-text retrieval based on peer-to-peer (P2P) technology. So far, these research efforts have largely concentrated on efficiently distributing an index. However, ranking of the results retrieve ...

2005