Actions for P2P techniques for decentralized applications [electronic resource]

Email RIS file
Bookmark
Report an Issue

P2P techniques for decentralized applications [electronic resource] / Esther Pacitti, Reza Akbarinia, Manal El-Dick

Author
Pacitti, Esther
Published
San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, [2012]
Copyright Date
©2012
Physical Description
1 electronic text (xiii, 90 pages) : illustrations, digital file
Additional Creators
Akbarinia, Reza and El-Dick, Manal
Access Online

Availability

I Want It
I Want It

Finding items...

Series
Restrictions on Access
Abstract freely available; full-text restricted to subscribers or individual document purchasers.
Contents
1. P2P overlays, query routing, and gossiping -- 1.1 P2P overlays -- 1.1.1 Unstructured -- 1.1.2 Structured -- 1.1.3 Super-peer -- 1.1.4 Comparing P2P overlays -- 1.2 Query routing -- 1.2.1 Query routing in unstructured overlays -- 1.2.2 Query routing in DHTs -- 1.2.3 Query routing in super-peers -- 1.3 Gossip protocols -- 1.4 Replication -- 1.5 Advanced features on P2P overlays -- 1.5.1 Locality-aware overlays -- 1.5.2 Interest-based overlays -- 1.5.3 P2P overlay combination -- 1.6 Conclusion --, 2. Content distribution in P2P systems -- 2.1 Introduction -- 2.2 Insights on traditional content distribution -- 2.2.1 Background on web caching -- 2.2.2 Overview of CDN -- 2.2.3 Requirements and open issues of CDN -- 2.3 P2P content distribution -- 2.3.1 Advanced features used by large-scale P2P CDN -- 2.3.2 P2P CDN solutions -- 2.4 Conclusion --, 3. Recommendation systems -- 3.1 Overview of recommendation -- 3.1.1 Collaborative filtering -- 3.1.2 Content-based filtering -- 3.1.3 Social networks -- 3.2 P2P content management -- 3.2.1 Clustering overlays -- 3.2.2 Short link overlay -- 3.3 P2P recommendation -- 3.3.1 Basic P2P prediction -- 3.3.2 Social P2P prediction systems -- 3.4 Conclusion --, 4. Top-k query processing in P2P systems -- 4.1 General model for top-k queries -- 4.2 Top-k queries in distributed systems -- 4.3 Top-k queries in P2P systems -- 4.3.1 Top-k queries in unstructured overlays -- 4.3.2 Top-k queries in super-peer overlays -- 4.3.3 Top-k queries in DHTs -- 4.4 Conclusion --, and Bibliography -- Authors' biographies.
Summary
As an alternative to traditional client-server systems, Peer-to-Peer (P2P) systems provide major advantages in terms of scalability, autonomy and dynamic behavior of peers, and decentralization of control. Thus, they are well suited for large-scale data sharing in distributed environments. Most of the existing P2P approaches for data sharing rely on either structured networks (e.g., DHTs) for efficient indexing, or unstructured networks for ease of deployment, or some combination. However, these approaches have some limitations, such as lack of freedom for data placement in DHTs, and high latency and high network traffic in unstructured networks. To address these limitations, gossip protocols which are easy to deploy and scale well, can be exploited. In this book, we will give a overview of these different P2P techniques and architectures, discuss their trade-offs and illustrate their use for decentralizing several large-scale data sharing applications.
Subject(s)
Other Subject(s)
ISBN
9781608458233 (electronic bk.)
9781608458226 (pbk.)
Note
Part of: Synthesis digital library of engineering and computer science.
Series from website.
AVAILABLE ONLINE TO AUTHORIZED PSU USERS.
Bibliography Note
Includes bibliographical references (pages 75-88).
Other Forms
Also available in print.
Technical Details
Mode of access: World Wide Web.
System requirements: Adobe Acrobat Reader.
Indexed By
Compendex
INSPEC
Google scholar
Google book search
View MARC record | catkey: 12563899