Peer-to-Peer Streaming Peer Protocol (PPSPP)
draft-ietf-ppsp-peer-protocol-01

The information below is for an old version of the document
Document Type Active Internet-Draft (ppsp WG)
Last updated 2012-03-29 (latest revision 2012-01-29)
Stream IETF
Intended RFC status Proposed Standard
Formats pdf htmlized bibtex
Reviews
Stream WG state WG Document
Document shepherd None
IESG IESG state AD is watching
Consensus Boilerplate Unknown
Telechat date
Responsible AD Martin Stiemerling
Send notices to ppsp-chairs@tools.ietf.org, draft-ietf-ppsp-peer-protocol@tools.ietf.org
PPSP                                                           A. Bakker
Internet-Draft                                                  TU Delft

Expires: August 2, 2012                                 January 30, 2012

        Peer-to-Peer Streaming Peer Protocol (PPSPP)
            <draft-ietf-ppsp-peer-protocol-01.txt>

Abstract

   The Peer-to-Peer Streaming Peer Protocol (PPSPP) is a peer-to-peer
   based transport protocol for content dissemination. It can be used
   for streaming on-demand and live video content, as well as
   conventional downloading. In PPSPP, the clients consuming the content
   participate in the dissemination by forwarding the content to other
   clients via a mesh-like structure.  It is a generic protocol which
   can run directly on top of UDP, TCP, or as a RTP profile. Features of
   PPSPP are short time-till-playback and extensibility. Hence, it can
   use different mechanisms to prevent freeriding, and work with
   different peer discovery schemes (centralized trackers or Distributed
   Hash Tables). Depending on the underlying transport protocol, PPSPP
   can also use different congestion control algorithms, such as LEDBAT,
   and offer transparent NAT traversal. Finally, PPSPP maintains only a
   small amount of state per peer and detects malicious modification of
   content. This documents describes PPSPP and how it satisfies the
   requirements for the IETF Peer-to-Peer Streaming Protocol (PPSP)
   Working Group's peer protocol.

Status of this memo

   This Internet-Draft is submitted to IETF in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF), its areas, and its working groups.  Note that
   other groups may also distribute working documents as Internet-
   Drafts.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   The list of current Internet-Drafts can be accessed at
   http://www.ietf.org/ietf/1id-abstracts.txt.

   The list of Internet-Draft Shadow Directories can be accessed at
 

A. Bakker                Expires August 2, 2012                 [Page 1]
Internet-Draft                   PPSPP                  January 30, 2012

   http://www.ietf.org/shadow.html.

   Copyright (c) 2012 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  3
     1.1. Purpose . . . . . . . . . . . . . . . . . . . . . . . . . .  3
     1.2. Conventions Used in This Document . . . . . . . . . . . . .  4
     1.3. Terminology . . . . . . . . . . . . . . . . . . . . . . . .  5
   2. Overall Operation . . . . . . . . . . . . . . . . . . . . . . .  6
     2.1. Joining a Swarm . . . . . . . . . . . . . . . . . . . . . .  6
     2.2. Exchanging Chunks . . . . . . . . . . . . . . . . . . . . .  6
     2.3. Leaving a Swarm . . . . . . . . . . . . . . . . . . . . . .  7
   3. Messages  . . . . . . . . . . . . . . . . . . . . . . . . . . .  7
     3.1. HANDSHAKE . . . . . . . . . . . . . . . . . . . . . . . . .  8
     3.3. HAVE  . . . . . . . . . . . . . . . . . . . . . . . . . . .  8
       3.3.1. Bin Numbers . . . . . . . . . . . . . . . . . . . . . .  8
       3.3.2. HAVE Message  . . . . . . . . . . . . . . . . . . . . .  9
     3.4. ACK . . . . . . . . . . . . . . . . . . . . . . . . . . . .  9
     3.5. DATA and HASH . . . . . . . . . . . . . . . . . . . . . . . 10
       3.5.1. Merkle Hash Tree  . . . . . . . . . . . . . . . . . . . 10
       3.5.2. Content Integrity Verification  . . . . . . . . . . . . 11
       3.5.3. The Atomic Datagram Principle . . . . . . . . . . . . . 12
       3.5.4. DATA and HASH Messages  . . . . . . . . . . . . . . . . 12
       3.5.5. Overhead  . . . . . . . . . . . . . . . . . . . . . . . 13
     3.6. HINT  . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
     3.7. Peer Address Exchange and NAT Hole Punching . . . . . . . . 14
       3.7.1 PEX_REQ and PEX_RES Messages . . . . . . . . . . . . . . 14
       3.7.2 Hole Punching via PPSPP Messages . . . . . . . . . . . . 14
Show full document text