Document - Probabilistic dropping in push and pull dissemination over distributed hash tables

2011

Conference article Restricted

Probabilistic dropping in push and pull dissemination over distributed hash tables

Carlini E., Coppola M, Ricci L.

Distributed hash tables Distributed system Information dissemination

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.

Source: The 11th IEEE International Conference on Computer and Information Technology, CIT 2011, pp. 47–52, Pafos, Cyprus, 31 August - 2 September 2011

Publisher: IEEE Computer Society, Los Alamitos, CA, USA

Metrics

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:206169,
	title = {Probabilistic dropping in push and pull dissemination over distributed hash tables},
	author = {Carlini E. and Coppola M and Ricci L.},
	publisher = {IEEE Computer Society, Los Alamitos, CA, USA},
	doi = {10.1109/cit.2011.94},
	booktitle = {The 11th IEEE International Conference on Computer and Information Technology, CIT 2011, pp. 47–52, Pafos, Cyprus, 31 August - 2 September 2011},
	year = {2011}
}