Enhancing Search Performance in SocioNet for Unstructured P2P Networks

Abstract

Peer-to-Peer (P2P) networks establish loosely coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. In recent year‟s peer to peer system have been evolved in all kind of areas. Unstructured peer to peer has been preferred for most of the application to share file among them. But searching, or locating a peer or file in unstructured peer-to-peer system is a tedious process. That is the existing flooding mechanism reduces the efficiency of unstructured p2p networks. To avoid this we have to implement an efficient routing technique. SocioNet, a social-based overlay that clusters peers based on their preference relationships as a small-world network. In SocioNet, peers mimic how people form a social network and how they query, by preference, their friends or acquaintances. This SocioNet combines with the advantage of cluster based intelligent searching (CIS) algorithm provides that an efficient routing in unstructured P2P. The system clusters peers according to the preference relationship. In the SocioNet the cluster-based searching scheme is used that intelligently forward queries on the maximum independent sets (MIS) of networks. In each cluster the cluster head is being selected, these cluster heads form a MIS and are connected through gateway nodes. Between clusters, CHs intelligently forward queries via gateways to the best neighbor CHs that are most likely to return query results.