A Trace Label Based Consistency Maintenance Algorithm in Unstructured P2P Systems

Replication is an effective way to improve the scalability, fault-tolerance, and availability as well as to reduce the query responding time in P2P system. With the P2P applications transferring from read-only static files sharing to read-write dynamical files interacting, maintaining consistency between frequently-updated files and their replicas is a fundamental reliability requirement for P2P system. This paper presents a trace label based consistency maintenance algorithm. It modifies the message datagram by attaching the address list of peers to which message has been sent. This can help to tell the duplicated message from the source peer by the aid of the attached address list in message datagram. Considering that the address list can become longer with the update time lapsing and the degree of P2P increasing, this paper presents a new Bloom Filter denoting the address list algorithm. The Bloom Filter can succinctly present the address list and simplify the query actions in the list by “OR” operations. The experimental results show that the new trace label based consistency maintenance algorithm can largely reduce the number of the duplicated messages. Moreover, the higher the degree of P2P, the more reduction of the number of duplicated messages and bandwidth utilization. The idea of consistency maintenance in this paper can also be applied to sensor network and other ad hoc networks.

[1]  Wang Qing.  An Infrastructure for Attribute Addressable P2P Network: Barnet , 2003 .

[2]  Scott Shenker,et al.  Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.

[3]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[4]  Karl Aberer,et al.  Updates in highly unreliable, replicated peer-to-peer systems , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[5]  Krithi Ramamritham,et al.  Consistency maintenance in peer-to-peer file sharing networks , 2003, Proceedings the Third IEEE Workshop on Internet Applications. WIAPP 2003.

[6]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[7]  Xin Chen,et al.  SCOPE: scalable consistency maintenance in structured P2P systems , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[9]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[10]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[11]  Dafang Zhang,et al.  Basket Bloom Filters for Membership Queries , 2005, TENCON 2005 - 2005 IEEE Region 10 Conference.

[12]  Sajal K. Das,et al.  Update propagation through replica chain in decentralized and unstructured P2P systems , 2004 .

[13]  Aruna Seneviratne,et al.  The cost of application-level broadcast in a fully decentralized peer-to-peer network , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[14]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[15]  David Wetherall,et al.  Forwarding without loops in Icarus , 2002, 2002 IEEE Open Architectures and Network Programming Proceedings. OPENARCH 2002 (Cat. No.02EX571).

[16]  Mohan Kumar,et al.  Update propagation through replica chain in decentralized and unstructured P2P systems , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[17]  Wang Huai.  A Rumor-Spreading Analog on Unstructured P2P Broadcast Mechanism , 2004 .

[18]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.