Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Deno: A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments
IEEE Transactions on Computers
Epidemic Algorithms for Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Adaptive Replication in Peer-to-Peer Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Peer-to-peer File-sharing over Mobile Ad hoc Networks
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
A file discovery control scheme for P2P file sharing applications in wireless mobile environments
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
| Hi-index | 0.00 |
Peer-to-peer (P2P) file sharing systems often replicate files to multiple nodes. File replication is beneficial in the sense that it can achieve good query latency, load balance, and reliability. However, it introduces another problem of maintaining mutual consistency among replica when a file is updated. The new file has to be propagated to all of its replica. In this paper, we propose an update propagation algorithm for P2P file sharing over wireless mobile networks (MONET). Compared to the previous algorithms proposed in wired P2P file sharing systems, our algorithm has low communication overhead. It also guarantees safe delivery of updates even when the underlying network is unreliable. This means that our algorithm is well matched to the characteristics of MONET such as limited battery power of mobile nodes, lower network reliability, and frequent disconnection of mobile nodes.