Guo Liang-Min, Yang Shou-Bao, Wang Shu-Ling, Zhang Rui, Niu Xian-Long. Replication Consistency Maintenance Mechanism Based on Physical-location and Bloom-filter for Unstructured P2P Network[J]. Journal of Electronics & Information Technology, 2011, 33(4): 1012-1016. doi: 10.3724/SP.J.1146.2010.00712
Citation:
Guo Liang-Min, Yang Shou-Bao, Wang Shu-Ling, Zhang Rui, Niu Xian-Long. Replication Consistency Maintenance Mechanism Based on Physical-location and Bloom-filter for Unstructured P2P Network[J]. Journal of Electronics & Information Technology, 2011, 33(4): 1012-1016. doi: 10.3724/SP.J.1146.2010.00712
Guo Liang-Min, Yang Shou-Bao, Wang Shu-Ling, Zhang Rui, Niu Xian-Long. Replication Consistency Maintenance Mechanism Based on Physical-location and Bloom-filter for Unstructured P2P Network[J]. Journal of Electronics & Information Technology, 2011, 33(4): 1012-1016. doi: 10.3724/SP.J.1146.2010.00712
Citation:
Guo Liang-Min, Yang Shou-Bao, Wang Shu-Ling, Zhang Rui, Niu Xian-Long. Replication Consistency Maintenance Mechanism Based on Physical-location and Bloom-filter for Unstructured P2P Network[J]. Journal of Electronics & Information Technology, 2011, 33(4): 1012-1016. doi: 10.3724/SP.J.1146.2010.00712
Having an effective consistency maintenance mechanism is one of keys to guarantee P2P systems running in good condition. In unstructured P2P systems, message transmission is mainly by neighbors so that many redundant messages are produced. Moreover, time cost is increased due to logical-location and underlying physical-location of peer mismatching. To reduce consistency maintenance cost, this paper presents a replication consistency maintenance mechanism based on physical-location and Bloom-filter. According to their physical-location using community partition in complex networks, it partitions peers into clusters, where physical-location among peers is closer and updating is done. And it uses double-deck Bloom-filter and redundancy secondary neighbor to improve transmitting method of updating-message. The experimental results show this new mechanism can reduce updating-message redundancy and time cost of consistency maintenance.
Ganesh A J, Kermarrec A M, and Massouli L. Peer-to-Peer membership management for gossip-based protocols [J].IEEE Transactions on Computers.2003, 52(2):139-149[5]李振宇, 谢高岗, 李忠诚. PATCOM基于分割树的无结构P2P系统一致性维护方法[J].计算机学报.2007, 30(9):1500-1510[9]Shen Hai-ying. IRM: integrated file replication and consistency maintenance in P2P systems [J].IEEE Transactions on Parallel and Distributed Systems.2010, 21(1):100-113[10]谢鲲, 张大方, 谢高岗, 文吉刚. 基于轨迹标签的无结构P2P副本一致性维护算法[J].软件学报.2007, 18(1):105-116[11]Xie Kun, Zhang Da-fang, Xie Gao-gang, and Wen Ji-gang. A trace label based consistency maintenance algorithm in unstructured P2P systems [J].Journal of Software.2007, 18(1):105-116[12]Hara T and Madria S K. Consistency management strategies for data replication in mobile Ad hoc networks [J].IEEE Transactions on Mobile Computing.2009, 8(7):950-967[16]Bloom B. Space/ time trade-off in hash coding with allowable errors [J].Communication of the ACM.1970, 13(7):422-426
DownLoad: