For Project Enquiry +91 9791 044 044

AN EFFICIENT AND TRUSTWORTHY P2P AND SOCIAL

NETWORK INTEGRATED FILE SHARING SYSTEM

ABSTRACT

          As a network computing systems refers to the Efficient and trustworthy file querying is important to the overall performance of peer-to-peer (P2P) file sharing systems. Emerging methods are beginning to address this challenge by exploiting online social networks (OSNs). However, current OSN-based methods simply cluster common-interest nodes for high efficiency or limit the interaction between social friends for high trustworthiness, which provides limited enhancement or contradicts the open and free service goal of P2P systems. Little research has been undertaken to fully and cooperatively leverage OSNs with integrated consideration of proximity and interest. In this work, we analyze a BitTorrent file sharing trace, which proves the necessity of proximity- and interest-aware clustering. Based on the trace study and OSN properties, we propose a social network integrated P2P file sharing system with enhanced efficiency and trustworthiness  to fully and cooperatively leverage the common-interest, proximity-close, and trust properties of OSNfriends. uses a hierarchical distributed hash table (DHT) to cluster common-interest nodes, then further cluster proximity-close nodes into a subcluster, and connects the nodes in a subcluster with social links. Thus, when queries travel along trustable social links, they also gain higher probability of being successfully resolved by proximity-close nodes, and it simultaneously enhances efficiency and trustworthiness. The results of trace-driven experiments on the real-world PlanetLab testbed demonstrate the higher efficiency, trustworthiness, and dynamism-resilience of SOCNET compared with other systems. Experimental results also confirm the effectiveness of the proposed strategies to improve SOCNET performance.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING CONCEPT:- In the Existing system node can know the previous routing path and avoids forwarding the query to a node already in existing path to avoid routing loop. Also, if a node’s recorded best candidate for sub-interest departed, it still can choose the next best candidate. This resolves the problems of candidate unavailability and remaining path invalidation caused by node departures in the previous sub-interest guided search algorithm.	PROPOSED CONCEPT:- We further propose different strategies to guide nodes to forward a file query to friends that are more trustworthy and more likely to resolve the queries or forward the query to file holders. We also propose follower- and cluster-based file replication algorithms to enhance file search efficiency.
EXISTING ALGORITHM:- Guided search algorithm.	PROPOSED ALGORITHM:- Cluster-based file replication algorithms
ALGORITHM DEFNITION:- Guided search algorithm in terms of both success rate and efficiency. We then further improve it to deal with node dynamism.	ALGORITHM DEFNITION:- Cluster-based file replication algorithms to enhance file search efficiency. The results of trace-driven experiments on the real-world Planet Lab tested demonstrate the higher efficiency, trustworthiness, and dynamism-resilience of SOCNET compared with other systems.
DRAWBACKS:-           P2P are inefficient when the messages to be authenticated are short. Given that file replication are relatively long can be performed computationally secure and speed P2Ps in the literature of cryptography.	ADVANTAGES:- file replication are relatively short, addition and modular multiplication can be performed faster than existing computationally secure P2P This methodology is more simplicity and efficiency than regular P2P.