By Topic

Update propagation based on tree structure 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

5 Author(s)
Hara, T. ; Dept. of Multimedia Eng., Osaka Univ., Japan ; Nakadori, M. ; Uchida, W. ; Maeda, K.
more authors

Summary form only given. Recently, there has been increasing interest in research of data sharing in peer-to-peer networks. In this paper, we propose a new update propagation strategy that achieves not only load balancing but also delay reduction, where the update information is immediately notified to all peers holding the replicas when the update occurs. The proposed strategy creates an n-ary tree whose root is the owner of the original data and the other nodes are peers holding its replicas, and propagates the update information according to the trees. Moreover, we verify the effectiveness of the proposed strategy by simulation experiments.

Published in:

Computer Systems and Applications, 2005. The 3rd ACS/IEEE International Conference on

Date of Conference: