P2P networking and applications
Peer-to-Peer (P2P) networks enable users to directly share digital content (such as audio, video, and text files) as well as real-time data (such as telephony traffic) with other users without depending on a central server. Although originally popularized by unlicensed online music services such as...
| Autor principal: | |
|---|---|
| Otros Autores: | , |
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Amsterdam ; Boston :
Elsevier/Morgan Kaufmann
c2009.
|
| Edición: | 1st edition |
| Colección: | Morgan Kaufmann series in networking.
|
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009627523606719 |
Tabla de Contenidos:
- Front Cover; P2P Networking and Applications; Copyright Page; Dedication Page; Table of Contents; Preface; About the Author; Chapter 1: Introduction; The Rise of P2P File-Sharing Applications; Voice over P2P (VoP2P); P2PTV; P2P Networking and the Internet; P2P Overlays and Network Services; Impact of P2P Traffic on the Internet; Motivation for P2P Applications; P2P from the End User's Perspective; Is P2P = Piracy?; P2P Strengths and Benefits; P2P Open Issues; The P2P Value Proposition; Barrier to Entry; Revenue Models and Revenue Collection; P2P Application Critical Mass; VoP2P; File Sharing
- Chapter 2: Peer-to-Peer ConceptsThe User View; P2P Beyond the Desktop Computer; Overlay View; Overview; Overlay; Graph Properties; Object Storage and Lookup; A Design Space Perspective; A Routing Performance Perspective; Routing Geometries and Resilience; Tradeoff Between Routing State and Path Distance; Churn and Maintaining the Overlay; Locality; For Further Reading; Chapter 3: Unstructured Overlays; Flooding and Expanding Ring; Random Walk; Unstructured Topology Considerations; Types of Unstructured Graphs; Random Graphs; Power-Law Random Graphs; Scale-Free Graphs and Self-Similarity
- Social Networks and the Small-World PhenomenonEarly Systems; Napster; Gnutella; FastTrack; Freenet; Improving on Flooding and Random Walk; Techniques; Metrics; Case Study: Gia; Using Similar Interests Among Peers; Tribler; INGA; Key-Based Routing in Unstructured Topologies; Overview; Local Minima Search; Unstructured Distributed Hash Table; Under the Hood: An Overlay Emulator; OverlayWeaver Routing Layer; Unstructured Overlays in OverlayWeaver; Chapter 4: Structured Overlays: Geometry and Routing; Motivation and Categories; Geometry and Routing; Roadmap for the Chapter
- Logarithmic Degree with Prefix RoutingPRR; Tapestry; P-Grid; Pastry; Other Prefix-Routing Overlays; Chord; DKS(N,k,f); Chord#; Constant Degree; Features of Constant Degree Graphs; Koorde; Ulysses; Cycloid; Content Addressable Network (CAN); Kademlia; O(1)-Hop Routing; Multihop Versus One-Hop; Kelips; OneHop; EpiChord; Analytical Performance Bounds; Measurement Through Simulation; Summary; For Further Reading; Surveys and Frameworks; History of Distributed Hash Tables; Other Structured Overlays; Routing and Geometry in Computer Networks; Chapter 5: Structured Overlays: Maintenance and Dynamics
- Approaches to Overlay MaintenanceActive Maintenance; Opportunistic Maintenance; Logarithmic Degree with Prefix Routing; Ring with Embedded Logarithmic Degree Mesh; Constant Degree; 0(1)-Hop Routing; Stochastic Modeling of Peer Churn; The Network Model; Stochastic Model for Long-Range Connections; Maintenance of Short-Range Connections; Maintenance of Long-Range Connections; Comparison with Existing DHT Overlay; Universal Overlay; Hierarchical Overlays; Chapter 6: Peer-to-Peer in Practice; General Protocol Issues; Unstructured Overlay: Gnutella; BitTorrent; Structured Overlays
- How NAT Effects P2P Connectivity
