An Update Propagation Strategy for Delay Reduction and Node Failure Tolerance in Peer-to-Peer Networks

Abstract

Recently, there has been increasing interest in research on data sharing in peer-to-peer networks. In our previous work, we proposed a novel update propagation strategy that creates an n-ary tree, whose root is the owner of the original data while the other nodes are peers holding its replicas, and propagates the update information according to the tree. In this paper, we extend our previous strategy to further reduce the delay for update propagation and to tolerate peers' failure. To achieve this, in the extended strategy, peers participating in the tree record the information of their ancestors and children in the tree and reconstruct the tree using that information when some peers in the tree fail.

Exploiting Cloud Computing and Web Services to Achieve Data Consistency, Availability, and Partition Tolerance in the Large-Scale Pervasive Systems

“…In the tree-based hierarchical strategy [50,51], the updates propagation relies on an N-ary tree. The root of this tree represents the owner of the data and the other nodes (i.e., residing in the tree's levels) store replicas of these data.…”

A New Optimistic Replication Strategy For Large-Scale Mobile Distributed Database Systems

“…An n-ary tree based updates propagation strategy [25,27,28] assumed an environment where update information is immediately sent to all peers holding replicas when an update occurs. The proposed strategy creates an n-ary tree, whose root is the owner of the original data while the other nodes are peers holding its replicas, and propagates the update information according to the tree.…”