Abstract
Some
recent studies have shown that cooperative cache can improve the system
performance in wireless P2P networks such as ad hoc networks and mesh networks.
However, all these studies are at a very high level, leaving many design and implementation
issues unanswered. In this paper, 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. 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. We also study the
effects of different MAC layers, such as 802.11-based ad hoc networks and
multi-interface-multichannel-based mesh networks, on the performance of cooperative
cache. Our results show that the asymmetric approach outperforms the symmetric
approach in traditional 802.11-based ad hoc networks by removing most of the
processing overhead. In mesh networks, the asymmetric approach can
significantly reduce the data access delay compared to the symmetric approach
due to data pipelines.
Existing
System:
In Existing
System, a wireless P2P network may consist of several source peers and a group
of downloading peers. Each officer has a relatively powerful data center, and
the downloading peers need to access the data centers to get needed files. And
suppose the source is very long distance from downloading peers means the download
process taking much more time. The neighboring peers tend to have similar
downloading process and thus share common interests. If one peer has accessed a
data item from the data center, at that time another peer download the same file
means it make delay.
Proposed System:
In Proposed
System, 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. 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. cooperative caching , which allows the sharing
and coordination of cached data among multiple nodes, has been applied to
improve the system performance in wireless P2P networks.
System Requirements:
SOFTWARE REQUIREMENTS
n Language : Java, swing
n
Back End
Tool: SQL SERVER 2000
n Operating System: Windows 98 and more.
HARDWARE REQUIREMENTS
n Processor : Intel Pentium III
Processor
n Random Memory: 128MB
n Hard Disk :20GB
No comments:
Post a Comment