Scalable Tree-Based Consistency Maintenance in Heterogeneous P2P File Sharing Systems

Recently, the sharing of editable files has been widely used in many applications such as online storage and collaborative file editing. In this paper, we propose a consistency maintenance scheme for such a file sharing in heterogeneous P2P systems. The key idea of the proposed scheme is to construct a static tree for each shared file to efficiently propagate the update information to all peers holding a file replica. More concretely, each tree is constructed in such a way that each path connecting a node to the root contains at most one long-distance link while bounding the total number of links on the path as small as possible. The performance of the scheme is evaluated by simulation. The simulation result indicates that the proposed scheme reduces the latency of SMART proposed by Nakashima and Fujita by 35%, and completes the propagation of update information within one second even if the number of replicas is 5000.