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

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

2008-01-09

arxiv.org/abs/0801.1419v1

Dans Proceedings of the Workshop on Reliability in Decentralized Distributed Systems 4278 (2006) 1470--1479

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670091