Creating and maintaining replicas in unstructured peer-to-peer systems

dc.contributor.authorLeontiadis, E.en
dc.contributor.authorDimakopoulos, V. V.en
dc.contributor.authorPitoura, E.en
dc.date.accessioned2015-11-24T17:01:20Z
dc.date.available2015-11-24T17:01:20Z
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10908
dc.rightsDefault Licence-
dc.titleCreating and maintaining replicas in unstructured peer-to-peer systemsen
heal.abstractIn peer-to-peer systems, replication is an important issue as it improves search performance and data availability. It has been shown that optimal replication is attained when the number of replicas per item is proportional to the square root of their popularity. In this paper, we focus on updates in the case of optimal replication. In particular, we propose a new practical strategy for achieving square root replication called pull-then-push replication (PtP). With PtP, after a successful search, the requesting node enters a replicate-push phase where it transmits copies of the item to its neighbors. We show that updating the replicas can be significantly improved through an update-push phase where the node that created the copies propagates any updates it has received using similar parameters as in replicate-push. Our experimental results show that replicate-push coupled with an update-push strategy achieves good replica placement and consistency with small message overhead.en
heal.accesscampus-
heal.fullTextAvailabilityTRUE-
heal.journalNameEuro-Par 2006 Parallel Processingen
heal.journalTypepeer reviewed-
heal.languageen-
heal.publicationDate2006-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.typejournalArticle-
heal.type.elΆρθρο Περιοδικούel
heal.type.enJournal articleen

Αρχεία

Φάκελος/Πακέτο αδειών

Προβολή: 1 - 1 of 1
Φόρτωση...
Μικρογραφία εικόνας
Ονομα:
license.txt
Μέγεθος:
1.74 KB
Μορφότυπο:
Item-specific license agreed upon to submission
Περιγραφή: