Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems

Posted under Parallel Distributed System by admin on Friday 27 May 2011 at 9:26 am

ieee projects 2014-2013,ieee project 2014,ieee project 2013,ieee projects 2013,NS2 Projects

Java Projects,.NET Projects,Matab Projects,application projects,Innovative Projects.

for more demo visit

finalsemprojects.incontact Email: ieeedata@gmail.com Mobile No: (0)96000 95046/47

Technology Used: Java

Parallel and Distributed Systems, 2011

Download Projects 2011 Basepaper

Although anonymizing Peer-to-Peer (P2P) systems often incurs extra traffic costs, many systems try to mask the identities of their users for privacy considerations. Existing anonymity approaches are mainly path-based: peers have to pre-construct an anonymous path before transmission. The overhead of maintaining and updating such paths is significantly high. We propose Rumor Riding (RR), a lightweight and non-path-based mutual anonymity protocol for decentralized P2P systems. Employing a random walk mechanism, RR takes advantage of lower overhead by mainly using the symmetric cryptographic algorithm. We conduct comprehensive trace-driven simulations to evaluate the effectiveness and efficiency of this design, and compare it with previous approaches. We also introduce some early experiences on RR implementations.

ieee projects 2014-2013,ieee project 2014,ieee project 2013,ieee projects 2013,NS2 Projects

Java Projects,.NET Projects,Matab Projects,application projects,Innovative Projects.

for more demo visit

finalsemprojects.incontact Email: ieeedata@gmail.com Mobile No: (0)96000 95046/47

  • 1
  • 1 Star2 Stars3 Stars4 Stars5 Stars (1 votes, average: 5.00 out of 5)
    Loading ... Loading ...

No Comments »

No comments yet.

RSS feed for comments on this post. TrackBack URI

Leave a comment

Theme designed by Latest Wordpress Themes in collaboration with Michael Buble Tour | Lady Antebellum Tour.