Publication

GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists principles

Publications associées (60)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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

Gossip-Based Peer Sampling

Rachid Guerraoui, Anne-Marie Kermarrec

Gossip-based communication protocols are appealing in large-scale distributed applications such as information dissemination, aggregation, and overlay topology management. This paper factors out a fundamental mechanism at the heart of all these protocols: ...

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

Authentication-free fault-tolerant peer-to-peer service provisioning

Karl Aberer, Wojciech Galuba, Zoran Despotovic

The correct functioning of a peer-to-peer network relies on cooperative behavior of peers as service providers. Current approaches to detection and deterrence of non-cooperative behavior, such as reputation systems, rely on (1) global sharing of observatio ...

Springer2007

SoS: self-organizing substrates

Anwitaman Datta

Large-scale networked systems often, both by design or chance exhibit self-organizing properties. Understanding self-organization using tools from cybernetics, particularly modeling them as Markov processes is a first step towards a formal framework which ...

EPFL2006

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

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

The challenges of merging two similar structured overlays: A tale of two networks

Karl Aberer, Anwitaman Datta

Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network partitioning or (more likely) because different groups of peers build such o ...

Springer2006

Cost-Aware Processing of Similarity Queries in Structured Overlays

Manfred Hauswirth, Roman Schmidt

Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the same schema and value representations and data quality problems due to spelling ...

2006

Similarity Queries on Structured Data in Structured Overlays

Manfred Hauswirth, Roman Schmidt

Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, but data heterogeneities often demand for more complex query types, particular ...

2006