pFusion For Internet-Scale Content-Based Search and Retrieval

ALL DEPT, C#.NET, CSE, ECE, EEE, HOW TO, IEEE CSE Projects, IEEE ECE PROJECTS, IEEE EEE PROJECTS, IEEE IT PROJECTS, IEEE PROJECTS, IT, mca, MINI PROJECTS, OTHER PROJECTS, VB PROJECTS, DOWNLOADS,

 pFusion For Internet-Scale Content-Based Search and  Retrieval

 

 

Abstract

The emerging Peer-to-Peer (P2P) model has become a very powerful and attractive paradigm for developing Internet-scale systems for sharing resources, including files and documents. The distributed nature of these systems, where nodes are typically located across different networks and domains, inherently hinders the efficient retrieval of information. In this project, we consider the effects of topologically aware overlay construction techniques on efficient P2P keyword search algorithms. We present the Peer Fusion (pFusion) architecture that aims to efficiently integrate heterogeneous information that is geographically scattered on peers of different networks. Our approach builds on work in unstructured P2P systems and uses only local knowledge.

Existing system

          If you want to share the video file to your friend means, you must upload that file to some website (You tube), after that only your friends share your video file from that website. This is our normal searching and sharing files through Internet.

A peer finding another peer to connect to establishes a connection. Each peer exchanges active peer and their addresses. When a connection has been established, the user can then search for files. When a search has been submitted, it connects to all nodes on its connection list. The results are then displayed and a connection is made. So it takes more time to search. This is our first generation of peer-to-peer network search.

Proposed system

Search is a fundamental part of any complete system for distributing files and resources. The current move toward peer-to-peer systems for file distribution affords us the opportunity to improve search substantially in internet.

Here we are going to use DDNO Topology that is locating nodes in the same domain without any global knowledge. It is used to perform a Random Walk and improved Search, which tells a node towards which direction to move. In DDNO Topology, BFS Algorithm used for searching.

Hardware Requirements

1       SYSTEM             : Pentium IV 2.4 MHz

2       HARD DISK        : 40 GB

3       FLOPPY DRIVE  : 1.44 MB

4       MONITOR           : 15 VGA colour

5       MOUSE               : Logitech.

6       RAM                    : 256 MB

7       KEYBOARD       : 110 keys enhanced.

Software Requirements

1       Operating system           :- Windows XP Professional

2       Front End             :- Microsoft Visual Studio .Net 2003

3       Coding Language :- Visual C# .Net

ALL DEPT, more C#.NET, CSE, ECE, EEE, HOW TO, IEEE CSE Projects, IEEE ECE PROJECTS, IEEE EEE PROJECTS, IEEE IT PROJECTS, IEEE PROJECTS, IT, mca, MINI PROJECTS, OTHER PROJECTS, VB PROJECTS, DOWNLOADS,