Publication

Experimental evaluation results of an advanced DHT-based peer-to-peer system

Karl Aberer
2004
Reports

Abstract

P-Grid is a decentralized DHT-based peer-to-peer system with logarithmic search complexity. As it is intended to provide a platform for distributed information management beyond mere file-sharing it supports an update functionality with lazy consistency guarantees, identity management disentangling the DHT from the underlying networking infrastructure, and decentralized load balancing. In this paper we first give a brief overview of the theoretical foundations of P-Grid and the supporting functionalities. Then we highlight some interesting implementation details and present briefly some experimental evaluation results. To our knowledge this is one of the first reports on experimental evaluation results of a structured peer-to-peer system in a real-world networking environment.

Official source

https://infoscience.epfl.ch/entities/publication/856f15cb-1c5d-491e-9330-07a4d1a837af

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
2004
Reports

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/856f15cb-1c5d-491e-9330-07a4d1a837af

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.

Peer-to-peer

Peer-to-peer (P2P) computing or networking is a distributed application architecture that partitions tasks or workloads between peers. Peers are equally privileged, equipotent participants in the network. This forms a peer-to-peer network of nodes. Peers make a portion of their resources, such as processing power, disk storage or network bandwidth, directly available to other network participants, without the need for central coordination by servers or stable hosts.

Distributed operating system

A distributed operating system is system software over a collection of independent software, networked, communicating, and physically separate computational nodes. They handle jobs which are serviced by multiple CPUs. Each individual node holds a specific software subset of the global aggregate operating system. Each subset is a composite of two distinct service provisioners. The first is a ubiquitous minimal kernel, or microkernel, that directly controls that node's hardware.

Related publications (1)

Experimental evaluation results of an advanced DHT-based peer-to-peer system

Chat with Graph Search

On SmallWorld Graphs in Non-uniformly Distributed Key Spaces