PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Carlini E., Ricci L., Coppola M., Genovali L. Probabilistic dropping in push and pull dissemination over distributed hash tables. In: CIT 2011 - The 11th IEEE International Conference on Computer and Information Technology (Pafos, Cyprus, 31 August - 2 September 2011). Proceedings, pp. 47 - 52. IEEE, 2011.
 
 
Abstract
(English)
Dynamic information management via Distributed Hash Tables (DHT) is an important problem which revolves around the trade-off between data freshness and the overhead due to information updates. We propose two different algorithms based on information pull and information push models, that enable dynamic information dissemination with low overhead over a DHT. We exploit the concept of popularity of specific items, which is evaluated by performing a real-time analysis of the query distribution, and allows to decrease a significant fraction of messages without impairing the query resolution process. We have measured the overhead savings and compared the performance of the two approaches by extensive simulations using real workload traces.
URL: http://ieeexplore.ieee.org/search/srchabstract.jsp?tp=&arnumber=6036590&openedRefinements%3D*%26filter%3DAND%28NOT%284283010803%29%29%26searchField%3DSearch+All%26queryText%3DProbabilistic+dropping+in+push+and+pull+dissemination+over+distributed+hash+tabl
DOI: 10.1109/CIT.2011.94
Subject Distributed hash tables
Information dissemination
Distributed system
C.4 C.2.4


Icona documento 1) Download Document PDF
Icona documento 2) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional