Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime

Simple item page
dc.creatorGramoli, Vincent
dc.creatorKermarrec, Anne-Marie
dc.creatorMostefaoui, Achour
dc.creatorRaynal, Michel
dc.creatorSericola, Bruno
dc.date2008-01-09
dc.date.accessioned2026-07-07T08:53:30Z
dc.date.available2026-07-07T08:53:30Z
dc.descriptionDistributed systems are now both very large and highly dynamic. Peer to peer overlay networks have been proved efficient to cope with this new deal that traditional approaches can no longer accommodate. While the challenge of organizing peers in an overlay network has generated a lot of interest leading to a large number of solutions, maintaining critical data in such a network remains an open issue. In this paper, we are interested in defining the portion of nodes and frequency one has to probe, given the churn observed in the system, in order to achieve a given probability of maintaining the persistence of some critical data. More specifically, we provide a clear result relating the size and the frequency of the probing set along with its proof as well as an analysis of the way of leveraging such an information in a large scale dynamic distributed system.
dc.identifierhttps://arxiv.org/abs/0801.1419
dc.identifierhttp://arxiv.org/abs/0801.1419
dc.identifierDans Proceedings of the Workshop on Reliability in Decentralized Distributed Systems 4278 (2006) 1470--1479
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/145645
dc.subjectDistributed, Parallel, and Cluster Computing
dc.titleCore Persistence in Peer-to-Peer Systems: Relating Size to Lifetime
dc.typetext

Files

Collections

arXiv