Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Update Propagation through Replica Chain in Decentralized and Unstructured P2P Systems
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
High availability, scalable storage, dynamic peer networks: pick two
HOTOS'03 Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9
Message transmission techniques for low traffic P2P services
International Journal of Communication Systems - Secure communications and data management in ubiquitous services
A gradient topology for master-slave replication in peer-to-peer environments
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
An ant colony model based replica consistency maintenance strategy in unstructured P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
With the growth of P2P file sharing systems, people are no longer satisfied with the sharing of the read-only and static files, and thus the systems with mutually writable and dynamic files have emerged, resulting in the replica inconsistency problem. To maintain the replica consistency, too many update messages need to be redundantly propagated due to the lack of the sharing of globally updated path information in the existing strategies. To address this problem, we propose an optimized strategy for update path selection, which makes the nodes share the update path information by using clone, variation and crossover operations for the update paths. We also present a repeated update strategy to cope with the churn problem so as to maintain replica consistency as far as possible even if some nodes temporarily leave the network. The simulation results show that our strategy can significantly reduce the number of the redundant update messages without lowering the message coverage, thus improving the availability of the unstructured P2P networks.