Randomized Protocol for Duplicate Elimination in Peer-to-Peer Storage System
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
mechanical engineering crazy
Active In SP

Posts: 226
Joined: Jul 2009
28-08-2009, 02:04 AM

Randomized Protocol for Duplicate Elimination in Peer-to-Peer Storage System

PEER-TO-PEER systems have emerged as cost-effective alternatives for scalable data sharing, backup, and archival storage. Peers contribute data and storage and, in return, gain access to data at other peers. Effective storage management is an important issue in the deployment of such systems. Data replication and caching are key enabling techniques for scalability, performance, and availability. In this context, an important problem relates to pruning unwanted copies of data efficiently and safely. Attempts at aggressive replication may lead to significant overheads associated with thrashing in resource constrained environments. Even if replication at peers is controlled, as in systems such as Samsara, the network as a whole must provide mechanisms for eliminating replicas that are not accessed, while leaving a minimum number of replicas in the network to satisfy availability constraints.
In this paper, we investigate the problem of eliminating duplicate data items in peer-to-peer systems. We examine this issue in the context of unstructured networks, where no assumptions can be made about the relationship between an object and the peers at which it resides. Unstructured networks differ from their structured counter-parts in several important respects. Structured networks provide a simple primitive for locating an object which relies on a distributed hash table (DHT) abstraction. The associated lookup techniques provide bounds on the number of hops as a function of the number of peers. These bounds are achieved by establishing and maintaining a well-defined overlay topology. In networks with a high transient population, the overhead associated with this may be significant. In contrast to structured peer-to-peer networks, unstructured networks are resilient to node failures and incur low overhead on node arrivals and departures. These characteristics make unstructured networks attractive for use in highly transient networks, where peers do not have significant resources. Unfortunately, the issue of object location, which is central to the problem of identifying redundant copies, is significantly more complex in this environment.
The primary focus of this paper is on systems where peers are cooperative and non malicious. Peers divide their storage into two spaces: a private and a public space. The private space contains the peerâ„¢s data and is not subject to duplicate elimination. The public space holds data from other peers and is subject to duplicate elimination. We can view the public space as back up storage or a cache to facilitate availability and performance, respectively.

Processor : Any Processor above 500 Mhz.
Ram : 128Mb.
Hard Disk : 10 Gb.
Compact Disk : 650 Mb.
Input device : Standard Keyboard and Mouse.
Output device : VGA and High Resolution Monitor.

Operating System : Windows 2000 server Family.
Techniques : JDK 1.5
Data Bases : Microsoft SQL Server
External Tool : JFree Chart
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Tagged Pages: randomized protocols for duplicate elimination, randomized protocols, randomized protocols for duplicate elimination in peer to peer storage systems ppt, randomized protocol, randomized protocal, randomized protocols for duplicate elimination in peer to peer storage systems literature survey, randomized protocols for duplicate elimination in peer to peer storage systems mathematical background,
Popular Searches: peer window chat application, duplicate pictures, randomized protocols, airtel postpaid invoice duplicate copy, duplicate video in large database coding, peer to peer karaoke, a distributed cycle minimization protocol for peer to peer networks,

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing PPT project girl 1 987 21-10-2015, 01:52 PM
Last Post: Guest
Last Post: sujivijay
  Wireless Sensor Network Security model using Zero Knowledge Protocol project uploader 1 1,018 28-02-2014, 01:44 AM
Last Post: mspadmini19
  Efficient and Robust Detection of Duplicate Videos in a Large Database Report seminar projects maker 0 432 24-09-2013, 12:47 PM
Last Post: seminar projects maker
  Trust Based Secured Adhoc on Demand Distance Vector Routing Protocol for Mobile pdf study tips 0 418 27-08-2013, 02:18 PM
Last Post: study tips
  Toward publicly auditable secure cloud data storage services Abstract study tips 0 320 16-08-2013, 04:59 PM
Last Post: study tips
  Enabling Public Auditability and Data Dynamics for Storage Security Abstract study tips 0 274 16-08-2013, 04:58 PM
Last Post: study tips
  A Secure Erasure Code-Based Cloud Storage System with Secure Data Forwarding Abstract study tips 0 345 16-08-2013, 04:57 PM
Last Post: study tips
  Proxy Re-Encryption Scheme For Cloud Storage System PPT study tips 0 395 10-05-2013, 04:28 PM
Last Post: study tips
  distributed cache updating for the dynamic source routing protocol project report tiger 3 2,053 17-04-2013, 10:40 AM
Last Post: Guest