Publication

A self-organizing access structure for P2P information systems

Related publications (50)

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.

di-jest: Autonomic neighbour management for worm resilience in p2p systems

Micaël Paquier

Internet worms pose a serious and ongoing threat to system security, often resulting in significant service downtime and disruption. In recent years peer-to-peer (p2p) networks have become a target for the deployment of worms as their high connectivity all ...

2008

LSH At Large - Distributed KNN Search in High Dimensions

Karl Aberer, Sebastian Michel, Parisa Haghani

We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay ne ...

2008

Message Passing in Semantic Peer-to-Peer Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

Peer-to-Peer (P2P) systems rely on machine-to-machine ad-hoc communications to offer services to a community. Contrary to the classical client-server architecture, P2P systems consider all peers, i.e., all nodes participating in the network, as being equal ...

2007

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

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

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

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

2007

Optimal Scheduling of Peer-to-Peer File Dissemination

Jochen Mundinger

Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Internet. The key idea is to divide the file into many equally-sized parts and then ...

2007

On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube

P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer pop- ulation dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the split maintena ...

GI2007

A Survey of Semantic Based Peer-to-Peer Systems

This paper makes a step in identifying the state of the art in semantic P2P systems. On one hand, lot of research in the P2P systems community has focused on fault-tolerance and scalability, resulting in numberous algorithms, systems such as Chord, Pastry ...

2007

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