No abstract

In this paper, we propose a routing protocol which ensures route anonymity, for the user. Amongst all suboptimal paths between source and destination, path for data transfer is chosen randomly at each intermediate node. Route anonymity becomes essential for preventing attacks like traffic monitoring. Bayesian approach has been employed for route discovery phase of the protocol. The protocol is simulated using NCTUNS network simulator. The robustness of our protocol is evaluated against known security attacks.

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.