Publication

Storing and Indexing Spatial Data in P2P Systems

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

Semantic Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

In a handful of years only, Peer-to-Peer (P2P) systems have become an integral part of the Internet. After a few key successes related to music-sharing (e.g., Napster or Gnutella), they rapidly developed and are nowadays firmly established in various conte ...

2005

Denial-of-service resilience in peer-to-peer file sharing systems

Willy Zwaenepoel, Dan Mihai Dumitriu

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immun ...

2005

Building trust-aware P2P systems

Zoran Despotovic

This thesis is concerned with enabling e-commerce applications in decentralized environments, P2P networks in particular. The work goes along the following two dimensions: P2P reputation systems design and building P2P e-commerce services and applications. ...

EPFL2005

On SmallWorld Graphs in Non-uniformly Distributed Key Spaces

Karl Aberer, Anwitaman Datta, Sarunas Girdzijauskas

In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world model [6] we extend the model of building “routing-efficient” small-world graph ...

2005

Towards a Foundation Model for Peer-to-Peer Web Information

Karl Aberer, Jie Wu

We find that there lacks a formal algebraic framework in the research area of P2P information retrieval. Such a formal framework is indispensable and pivotal. On the one hand, no solid theoretical foundation can explain why the results of many ad-hoc comme ...

2004

Lazy Parameter Passing

Patrick Eugster

Peer-to-peer (P2P) systems are strongly decentralized and asynchronous distributed settings involving a potentially large number of hosts. A common programing model for P2P infrastructures is that of a distributed hashtable (DHT), though which peers share ...

2003

The Quest for Balancing Peer Load in Structured Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

Structured peer-to-peer (P2P) systems are considered as the next generation application backbone on the Internet. An important problem of these systems is load balancing in the presence of non-uniform data distributions. In this paper we propose a complete ...

2003

Self-organized construction of distributed access structures: A comparative evaluation of P-Grid and FreeNet

Karl Aberer, Manfred Hauswirth

This paper provides a quantative comparison of the efficiency of the self-organized construction processes of the P-Grid and FreeNet peer-to-peer systems. Starting from a defined, realistic network topology we simulate the construction of their access stru ...

2003

Updates in Highly Unreliable, Replicated Peer-to-Peer Systems

Karl Aberer, Manfred Hauswirth, Anwitaman Datta

In this paper we study the problem of updates in truly decentralised and self-organising systems such as pure P2P systems. We assume low online probabilities of the peers (

2003

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