An Enhanced Cooperative Caching in Wireless P2P Networks

1

Team Members

S.ARULMANI R.K.KARTHIKEYAN

S.KATHIRVEL K.KAVINRAJ

Guided By Mr.K.PRAKASH.,M.E

ABSTRACT

We propose a novel asymmetric cooperative cache approach, where the data requests are transmitted to the cache layer on every node, but the data replies are only transmitted to the cache layer at the intermediate nodes that need to cache the data.

This solution not only reduces the overhead of copying data between the user space and the kernel space, it also allows data pipelines to reduce the end-to-end delay.

2

INTRODUCTION

Cooperative cache can improve the system performance in wireless p2p networks such as ad-hoc networks and mesh networks.

We present our design and implementation of cooperative cache in wireless p2p networks, and propose solutions to find the best place to cache the data.

3

EXISTING SYSTEM

4

PROPOSED SYSTEM

SYSTEM REQUIREMENT

Software requirementsLanguage : java, swingBack end tool: SQL SERVER 2000Operating system: windows 98 and more.

Hardware requirements Processor : intel pentium iii processor Random memory: 128mb

Hard disk :20gb  

6

7

MODULE

PEER CONSTRUCTION

In this module we design a loosely connected P2P network. We use P to denote a single peer in the network. P denotes the set of all peers in the network.

The main type of resource, namely, a data file, is represented by f. For every peer

p, Fp is used to represent the group of files shared by p. In order to conduct distributed search over the P2P network, every peer p

maintains locally a list of neighbor peers.

8

SEARCH PROCESS

9

CACHE PROCESS

10

MAINTAIN SOURCE DETAILS

In this module the routing table consists of peer name, file location, no of times visited information’s. Whenever the peer request, a particular file the search history will maintaining

the routing table entry such as peer name, file location, and increase the file count value of number of times file visited history. This updation process continues for each searching history in the networks.

11

SEQUENCE DIAGRAM

12

USE CASE DIAGRAM

13

DATA FLOW DIAGRAM

14

ARCHITECTURE DIAGRAM

Source peerData temporarily stored in cache of neighbors

Search the needed file source

Data server

DHT

Download Peer

Send file request

LOGIN FORM

16

REGISTRATION FORM

17

NODE FORM

18

USER FORM

DATA BASE FORM

20

OUTPUT FORM

21

CONCLUSION

In this paper, we presented our design and implementation of cooperative cache in wireless P2P networks, and proposed solutions to find the best place to cache the data.

This solution not only reduces the overhead of copying data between the user space and the kernel space, but also allows data pipeline to reduce the end-to-end delay. We have developed a prototype to demonstrate the advantage of the asymmetric approach.

22

REFERENCE

[1].Cooperative Caching in Wireless P2P Networks: Design, Implementation, and Evaluation Jing Zhao, Student Member, IEEE, Ping Zhang, Guohong Cao, Senior Member, IEEE, and Chita R. Das, Fellow, IEEE

[2].R. Agu ¨ ero and J.P. Campo, “Adding Multiple Interface Support in NS-2,” Jan. 2007.

[3].B. Barr, J. Bicket,D.Dantas, B.Du, T.Kim, B. Zhou, and E. Sirer, “On the Need for System-Level Suppport for Ad Hoc and Sensor Networks,” ACMOperating System Rev., vol. 36, no. 2, pp. 1-5, Apr. 2002.

[4].J. Bicket, D. Aguayo, S. Biswas, and R. Morris, “Architecture and Evaluation of an Unplanned 802.11b Mesh Network,” Proc. ACM MobiCom, 2005.

23

24