Image from Google Jackets

P2P Techniques for Decentralized Applications / by Esther Pacitti, Reza Akbaranian, Manal El-Dick

By: Pacitti, Esther, autor
Contributor(s): Akbaranian, Reza, autor | El-Dick, Manal, autor
Material type: materialTypeLabelE-bookSeries: (Synthesis Lectures on Data Management, 2153-5426).Publisher: Cham : Springer International Publishing, 2012Edition: 1st edition 2012.Description: 1 recurso en línea (XIII, 90 páginas).ISBN: 9783031018886.Other title: Peer-to-peer Techniques for Decentralized Applications.Subject: Arquitectura de redes informáticas | Intercambio electrónico de datos | Aplicaciones informáticasOnline resources: Acceso a este recurso digital (usuarios Universidad Europea de Madrid)Digital Resources
Contents:
P2P Overlays, Query Routing, and Gossiping -- Content Distribution in P2P Systems -- Recommendation Systems -- Top-k Query Processing in P2P Systems.
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 an overview of these different P2P techniques and architectures, discuss their trade-offs, and illustrate their use for decentralizing several large-scale data sharing applications. Table of Contents: P2P Overlays, Query Routing, and Gossiping / Content Distribution in P2P Systems / Recommendation Systems / Top-k Query Processing in P2P Systems.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
LIBRO-E NO PRÉSTAMO LIBRO-E NO PRÉSTAMO Madrid Digital Acceso Electrónico (UEM) Ciencias e Ingeniería TK5105.525 2012 EB (Browse shelf(Opens below)) Acceso electrónico eBook.01112039
Total holds: 0

P2P Overlays, Query Routing, and Gossiping -- Content Distribution in P2P Systems -- Recommendation Systems -- Top-k Query Processing in P2P Systems.

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 an overview of these different P2P techniques and architectures, discuss their trade-offs, and illustrate their use for decentralizing several large-scale data sharing applications. Table of Contents: P2P Overlays, Query Routing, and Gossiping / Content Distribution in P2P Systems / Recommendation Systems / Top-k Query Processing in P2P Systems.

There are no comments on this title.

to post a comment.
Share