Probabilistic dropping in push and pull dissemination over distributed hash tables (Contributo in atti di convegno)

Type
Label
  • Probabilistic dropping in push and pull dissemination over distributed hash tables (Contributo in atti di convegno) (literal)
Anno
  • 2011-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1109/CIT.2011.94 (literal)
Alternative label
  • Carlini E., Ricci L., Coppola M., Genovali L. (2011)
    Probabilistic dropping in push and pull dissemination over distributed hash tables
    in The 11th IEEE International Conference on Computer and Information Technology, CIT 2011, Pafos, Cyprus, 31 August - 2 September 2011
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Carlini E., Ricci L., Coppola M., Genovali L. (literal)
Pagina inizio
  • 47 (literal)
Pagina fine
  • 52 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
  • Area di valutazione 01 - Scienze matematiche e informatiche (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6036590 (literal)
Note
  • Scopu (literal)
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR-ISTI, Pisa, Italy; Department of Computer Science, University of Pisa, Italy; IMT, Institutions, Markets, Technology, Lucca, Italy (literal)
Titolo
  • Probabilistic dropping in push and pull dissemination over distributed hash tables (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-4577-0383-6 (literal)
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 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. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Editore di
Insieme di parole chiave di
data.CNR.it