By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Watanabe, T. ; Dept. of Multimedia Eng., Osaka Univ, Suita ; Hara, T. ; Kido, Y. ; Nishio, S.

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.

Published in:

Advanced Information Networking and Applications Workshops, 2007, AINAW '07. 21st International Conference on  (Volume:1 )

Date of Conference:

21-23 May 2007