Publication

Principles of Query-Adaptive Optimal Replication in DHTs

Karl Aberer
2004
Reports

Abstract

This paper focuses on replication in DHT based structured overlay networks, and presents a theoretical framework for optimal replication in such networks with respect to query frequency. In particular, we determine the optimal replication factor for query-adaptive load balancing, and a topology specific placement strategy for an important class of DHT networks. We also provide a taxonomy of replication strategies in existing systems, discussing them with respect to this optimal scheme, and sketch further issues relevant for implementing this scheme in DHT networks. a.. keywords: Query-adaptivity, Optimal replication, Load-balancing, Distributed Hash Tables

Official source

https://infoscience.epfl.ch/entities/publication/6836a05e-0ddb-46d0-af8a-b17443274150

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/6836a05e-0ddb-46d0-af8a-b17443274150

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.

Overlay network

An overlay network is a computer network that is layered on top of another network. Nodes in the overlay network can be thought of as being connected by virtual or logical links, each of which corresponds to a path, perhaps through many physical links, in the underlying network. For example, distributed systems such as peer-to-peer networks and client–server applications are overlay networks because their nodes run on top of the Internet.

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.

Related publications (8)

Principles of Query-Adaptive Optimal Replication in DHTs

Chat with Graph Search

A note on the data-driven capacity of P2P networks

Efficient processing of XPath queries with structured overlay networks

On SmallWorld Graphs in Non-uniformly Distributed Key Spaces