Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
PIGGYBACK META-DATA PROPAGATION IN DISTRIBUTED HASH Erik Buchmann, Sven Apel, Gunter Saake
 

Summary: PIGGYBACK META-DATA PROPAGATION IN DISTRIBUTED HASH
TABLES
Erik Buchmann, Sven Apel, Gunter Saake
University of Magdeburg, Germany
{buchmann|apel|saake}@iti.cs.uni-magdeburg.de
Keywords: Peer-to-Peer data structures, meta-data propagation, Mixin Layers, Aspect-oriented Programming.
Abstract: Distributed Hashtables (DHT) are intended to provide Internet-scale data management. By following the
peer-to-peer paradigm, DHT consist of independent peers and operate without central coordinators. Conse-
quentially, global knowledge is not available and any information have to be exchanged by local interactions
between the peers. Beneath data management operations, a lot of meta-data have to be exchanged between the
nodes, e.g., status updates, feedback for reputation management or application-specific information. Because
of the large scale of the DHT, it would be expensive to disseminate meta-data by peculiar messages. In this
article we investigate in a lazy dissemination protocol that piggybacks attachments to messages the peers send
out anyhow. We present a software engineering approach based on mixin layers and aspect-oriented program-
ming to cope with the extremely differing application-specific requirements. The applicability of our protocol
is confirmed by means of experiments with a CAN implementation.
1 INTRODUCTION
Distributed hashtables (DHT) are able to manage
huge sets of (key,value)-pairs and cope with very
high numbers of parallel transactions. DHTs are a

  

Source: Apel, Sven - Fakultät für Informatik und Mathematik, Universität Passau

 

Collections: Computer Technologies and Information Sciences