Probabilistic Dropping in Push and Pull Dissemination over Distributed Hash Tables (original) (raw)

2011 IEEE 11th International Conference on Computer and Information Technology, 2011

Abstract

Abstract 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 ...

Laura Ricci hasn't uploaded this paper.

Let Laura know you want this paper to be uploaded.

Ask for this paper to be uploaded.