Replication in Unstructured Peer-to-Peer Networks with Availability Constraints

@inproceedings{Holder2008ReplicationIU,
  title={Replication in Unstructured Peer-to-Peer Networks with Availability Constraints},
  author={Stefan Holder and Reinhard Wilhelm},
  year={2008}
}
Random walks have been proven a scalable search strategy for unstructured peerto-peer (P2P) networks. In a random walk, a query message is forwarded at each step to a randomly chosen neighbor for a limited number of hops. If random walks are employed as a search strategy, data replication is an important method to increase the probability of successful search. In this context, we investigate the optimization problem to find a replica assignment to peers that satisfies given availability… CONTINUE READING