The core activity of any P2P system is File Sharing. In any system where many peers are connected, several replicas of same file may be present but the challenge, especially in an unstructured p2p overlay, is to make sure that there exist certain copies of the latest version for performing any read / write operation. We propose to achieve this using Voting Algorithm over any unstructured p2p (in our case, we chose GIA protocol). Voting algorithm assigns votes to each replica, based upon certain properties like its bandwidth or reliability etc of the node containing that replica. Any read/ write is allowed to be performed only if the requesting process is able to cross the minimum threshold (read / write quorum). We propose our framework through examples and simulations over OverSim Simulator.
Jain, Rusheel and Hota, Chittaranjan
International Journal of Computer and Communication Technology: Vol. 5:
3, Article 11.
Available at: https://www.interscience.in/ijcct/vol5/iss3/11