03-12-2012, 02:00 PM
Enhancing Search Performance in Unstructured P2P Networks Based on Users’ Common Interest (IEEE)
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. However, the random search strategies adopted by these
networks usually perform poorly with a large network Size. In this paper, we seek to enhance
the search performance in unstructured P2P networks through exploiting users’ common
interest patterns captured within a probability-theoretic framework termed the user interest
model (UIM). A search protocol and a routing table updating protocol are further proposed in
order to expedite the search process through self organizing the P2P network into a small
world. Both theoretical and experimental analyses are conducted and demonstrated the
effectiveness and efficiency of our approach.
Existing System:
Peers in unstructured P2P networks to choose their neighbors and locally shared files, using
Flooding techniques.
In purely unstructured P2P networks such as blind search through flooding mechanisms is
usually explored for resource discovery. To find a file, a peer sends out a query to its neighbors
on the overlay, until the query has traveled a certain radius. Despite its simplicity and
robustness, flooding techniques, in general, do not scale. In large networks, the probability of a
successful search may decrease dramatically without significantly enlarging the flooding radius.
Proposed System:
In order to improve search performance, guided search. The key problem is what information is
actually eligible to guide the search. Used interest-based locality as the general search
guidance. The basic assumption is that if a peer p0 has a particular file required by another
peer p, and then p0 is likely to have other files to be requested by p in the future. According to
previous successful queries, shortcuts from peer p to several peers p0 are established in order
to expedite subsequent search processes.