Please use this identifier to cite or link to this item:
|Title:||pDomus: a prototype for cluster-oriented distributed hash tables|
Distributed hash tables
|Publisher:||IEEE Computer Society|
|Citation:||Rufino, José, Pina, António; Alves, Albano; Exposto, José (2007) - pDomus: a prototype for cluster-oriented distributed hash tables. In 15th Euromicro International Conference on Parallel, Distributed and Network-based Processing. Naples, Italy. p.97-104.|
|Abstract:||The Domus architecture for distributed hash tables (DHTs) is specially designed to support the concurrent deployment of multiple and heterogeneous DHTs, in a dynamic shared-all cluster environment. The execution model is compatible with the simultaneous access of several distributed/parallel client applications to the same or different running DHTs. Support to distributed routing and storage is dynamically configurable per node, as a function of applications requirements, node base resources and the overall cluster communication, memory and storage usage. pDomus is a prototype of Domus that creates an environment where to evaluate the model embedded concepts and planned features. In this paper, we present a series of experiments conduced to obtain figures of merit i) for the performance of basic dictionary operations, and ii) for the storage overhead resulting from several storage technologies. We also formulate a ranking formula that takes into account access patterns of clients to DHTs, to objectively select the most adequate storage technology, as a valuable metric for a wide range of application scenarios. Finally, we also evaluate client applications and services scalability, for a select dictionary operation. Results of the overall evaluation are promising and a motivation for further work|
|Appears in Collections:||IC - Publicações em Proceedings Indexadas ao ISI/Scopus|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.