P2PSP (Peer-to-Peer “Straightforward” Protocol)

Cristobal Medina-López, J. A. M. Naranjo,
L. G. Casado and Vicente González-Ruiz
Universidad de Almería

July 6, 2015
1 Introduction
2 Some networking facts
3 P2P architectures
4 The Peer-To-Peer Straightforward Protocol
 4.1 Main P2PSP characteristics
 4.2 Data partitioning
 4.3 Basic entities
 4.4 IMS (IP Multicast Set of rules)
 4.5 DBS (Data Broadcasting Set of rules)
 4.6 ACS (Adaptive Chunk-rate Set of rules)
 4.7 LRS (Lost chunks Recovery Set of rules)
 4.8 EMS (End-point Masquerading Set of rules)
 4.9 NTS (NAT Traversal Set of rules)
 4.10 MCS (Multi-Channel Set of rules)
 4.11 The Content Integrity Set of rules
 4.12 The Data Privacy Set of rules
 4.13 The Peer-list Compression Set of rules
5 A mathematical analysis of the P2PSP
6 Definitions
 6.1 Splitter delivery period
 6.2 Steady-state performance
 Network degree
 Bit rates
 Protocol overhead
 Network diameter
 Network delay
 Block rate
 Buffering delay
 Client delay
 Start-up delay
 6.3 Chunk lost-rate produced by churn and unwarned-churn
 6.4 Flash crowd dealing (maybe included in the previous section?)
 6.5 Maximun free-riding ratio
 6.6 DoS impact?
 6.7 Scalability
 6.8 Are peers synchronized?
7 Configurations
 7.1 Trusted peers
 7.2 Super-peers
 7.3 Premium peers
 7.4 QoS preservation
 7.5 Clustering in private networks
 7.6 Dealing with symmetric NATs
 7.7 Building large P2PSP overlays
 7.8 Streaming of 3D video
 7.9 Simulcast of single-layer media
 7.10 Streaming of scalable content
 7.11 Streaming of multiple descripted content
 7.12 Interactive temporal random access (video-on-demand)
8 Summary