000 03304nam a22005175i 4500
001 978-3-031-01888-6
003 DE-He213
005 20240730163441.0
007 cr nn 008mamaa
008 220601s2012 sz | s |||| 0|eng d
020 _a9783031018886
_9978-3-031-01888-6
024 7 _a10.1007/978-3-031-01888-6
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
100 1 _aPacitti, Esther.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978608
245 1 0 _aP2P Techniques for Decentralized Applications
_h[electronic resource] /
_cby Esther Pacitti, Reza Akbaranian, Manal El-Dick.
250 _a1st ed. 2012.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2012.
300 _aXIII, 90 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Data Management,
_x2153-5426
505 0 _aP2P Overlays, Query Routing, and Gossiping -- Content Distribution in P2P Systems -- Recommendation Systems -- Top-k Query Processing in P2P Systems.
520 _aAs 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.
650 0 _aComputer networks .
_931572
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 1 4 _aComputer Communication Networks.
_978609
650 2 4 _aData Structures and Information Theory.
_931923
700 1 _aAkbaranian, Reza.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978610
700 1 _aEl-Dick, Manal.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_978611
710 2 _aSpringerLink (Online service)
_978612
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031007606
776 0 8 _iPrinted edition:
_z9783031030161
830 0 _aSynthesis Lectures on Data Management,
_x2153-5426
_978613
856 4 0 _uhttps://doi.org/10.1007/978-3-031-01888-6
912 _aZDB-2-SXSC
942 _cEBK
999 _c84619
_d84619