15-06-2012, 12:41 PM
ENHANCING SEARCH PERFORMANCE IN UNSTRUCTURED P2P NETWORKS BASED ON USER’S COMMON INTEREST
ENHANCING THE SEARCH PERFORMANCE IN UNSTRUCTURED P2P NETWORKS.pptx (Size: 77.92 KB / Downloads: 26)
INTRODUCTION
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
Existing System
Network system classified into two categories. They are structured and unstructured.
The applications share the resources and data in this system is a challenging task. This challenge overcome by random search strategy.
Disadvantages:
Blind Search.
Future reference is not present in routing table.
Proposed system
The statistical patterns over locally shared resources of a peer can be explored to guide the distributed resource discovery process and therefore enhance the overall resource discovery performance in unstructured P2P networks.
Advantages:
Guided Search.
Routing updating table.
MODULES DESCRIPTION
NETWORK CONSTRUCTION:
Construct the dynaminetworktopology.wecan add any number of peers dynamically and construct the connections dynamically.
Peer can easily leave from the network, and share the resources dynamically.
Updating process can do dynamic resource sharing.
ROUTING TABLE UPDATION:
Routing table contain the information about the past successful search results.
It contains name of the peer,address,resource name, and count of the search.