Toward a dynamically balanced cluster oriented DHT

نویسندگان

  • José Rufino
  • António Pina
  • Albano Alves
  • José Exposto
چکیده

In this paper, we present a model for a cluster oriented Distributed Hash Table (DHT). It introduces software nodes, virtual nodes and partitions as high level entities that, in conjunction with the definition of a certain number of invariants, provide for the balancement of a DHT across a set of heterogeneous cluster nodes. The model has the following major features: a) the share of the hash table handled by each cluster node is a function of its enrollment level in the DHT; b) the enrollment level of a cluster node in the DHT may change dynamically; c) cluster nodes are allowed to dynamically join or leave the DHT. A preliminary evaluation proved that the quality of the balancement of partitions of the hash table across the cluster, measured by the standard deviation with relation to the ideal average, surpass the one achieved by using another well known approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domus - An Architecture for Cluster-Oriented Distributed Hash Tables

This paper presents a high level description of Domus, an architecture for cluster-oriented Distributed Hash Tables. As a data management layer it supports the concurrent execution of multiple and heterogeneous DHTs, that may be simultaneously accessed by different distributed/parallel client applications. At system level, a global balancement mechanism allows for the (re)distribution of each D...

متن کامل

Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables

Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we support range queries through a balanced tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B-tree design that efficiently stores clustered data while maintainin...

متن کامل

Dynamic and Distributed Reconciliation in P2P-DHT Networks

Optimistic replication can provide high data availability for collaborative applications in large scale distributed systems (grid, P2P, and mobile systems). However, if data reconciliation is performed by a single node, data availability remains an important issue since the reconciler node can fail. Thus, reconciliation should also be distributed and reconciliation data should be replicated. We...

متن کامل

Implementing Range Queries with a Decentralized Balanced Tree Over DHTs

Range queries, retrieving all keys within a given range, is an important add-on for DHTs, as they rely only on exact key matching lookup. In this paper we support range queries by way of a tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B+ tree design that efficiently stores clustered data while maintaining a balanced load on hosts. The ...

متن کامل

Suboptimal Schemes for Atmospheric Data Assimilation Based on the Kalman Filter

This work is directed toward approximating the evolution of forecast error covariances for data assimilation. We study the performance of di erent algorithms based on simpli cation of the standard Kalman lter (KF). These are suboptimal schemes (SOS's) when compared to the KF, which is optimal for linear problems with known statistics. The SOS's considered here are several versions of optimal in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004