The Community for Technology Leaders
2013 ACS International Conference on Computer Systems and Applications (AICCSA) (2005)
Cairo, Egypt
Jan. 3, 2005 to Jan. 6, 2005
ISBN: 0-7803-8735-X
pp: 40-I
M. Nakadori , Dept. of Multimedia Eng., Osaka Univ., Japan
W. Uchida , SCE, Missouri Univ., Kansas, PA, USA
K. Maeda , Lab. d'Informatique pour la Mecanique, Sci. de lngenieur, France
T. Hara , Dept. of Multimedia Eng., Osaka Univ., Japan
S. Nishio , Lab. d'Informatique pour la Mecanique, Sci. de lngenieur, France
ABSTRACT
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.
INDEX TERMS
CITATION
M. Nakadori, W. Uchida, K. Maeda, T. Hara, S. Nishio, "Update propagation based on tree structure in peer-to-peer networks", 2013 ACS International Conference on Computer Systems and Applications (AICCSA), vol. 00, no. , pp. 40-I, 2005, doi:10.1109/AICCSA.2005.1387037
95 ms
(Ver )