Publication

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

Karl Aberer, Magdalena Punceva
2002
Reports

Abstract

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 structures and measure the incurred message load and memory usage for routing tables. Besides these results our experimental setup may also be used as a starting point for defining a standard test and evaluation suite for P2P systems.

Official source

https://infoscience.epfl.ch/entities/publication/8797e60c-40c6-43fa-93ac-16cf76e800b4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Karl Aberer, Magdalena Punceva
2002
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/8797e60c-40c6-43fa-93ac-16cf76e800b4

About this result

Related concepts (32)

Distributed hash table

A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key. The main advantage of a DHT is that nodes can be added or removed with minimum work around re-distributing keys. Keys are unique identifiers which map to particular values, which in turn can be anything from addresses, to documents, to arbitrary data.

Anonymous P2P

An anonymous P2P communication system is a peer-to-peer distributed application in which the nodes, which are used to share resources, or participants are anonymous or pseudonymous. Anonymity of participants is usually achieved by special routing overlay networks that hide the physical location of each node from other participants. Interest in anonymous P2P systems has increased in recent years for many reasons, ranging from the desire to share files without revealing one's network identity and risking litigation to distrust in governments, concerns over mass surveillance and data retention, and lawsuits against bloggers.

Freenet

Freenet is a peer-to-peer platform for censorship-resistant, anonymous communication. It uses a decentralized distributed data store to keep and deliver information, and has a suite of free software for publishing and communicating on the Web without fear of censorship. Both Freenet and some of its associated tools were originally designed by Ian Clarke, who defined Freenet's goal as providing freedom of speech on the Internet with strong anonymity protection.

Related publications (32)

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

Chat with Graph Search

Digital Woodcraft : A Wood-Making Village in the Jorat

PeerSwap: A Peer-Sampler with Randomness Guarantees

Study of the lateral stabilisation of an eight-storey timber structure