Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Query-Adaptive Partial Distributed Hash Table for Peer-to-Peer Systems
 

Summary: A Query-Adaptive Partial Distributed Hash Table for
Peer-to-Peer Systems
Fabius Klemm, Anwitaman Datta, Karl Aberer
School of Computer and Communication Sciences
Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland
{Fabius.Klemm, Anwitaman.Datta, Karl.Aberer}@epfl.ch
Abstract. The two main approaches to find data in peer-to-peer (P2P) systems
are unstructured networks using flooding and structured networks using a dis-
tributed index. A distributed index is usually built over all keys that are stored
in the network whether they are queried or not. Indexing all keys is no longer
feasible when indexing metadata, as the key space becomes very large. Here we
need a query-adaptive approach that indexes only keys worth indexing, i.e. keys
that are queried at least with a certain frequency. In this paper we study the cost
of indexing and propose a query-adaptive partial distributed hash table (PDHT)
that does not keep all keys in the index. We model and analyze a scenario to
show that query-adaptive partial indexing outperforms pure flooding and "in-
dex-everything" strategies. Furthermore, our scheme is able to automatically
adjust the index to changing query frequencies and distributions.
Keywords: peer-to-peer (P2P), partial distributed hash table (PDHT), query-
adaptive indexing, metadata.

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences