Distributed Node Consensus Protocol
draft-ietf-homenet-dncp-11

The information below is for an old version of the document
Document Type Active Internet-Draft (homenet WG)
Last updated 2015-10-22 (latest revision 2015-10-14)
Stream IETF
Intended RFC status Proposed Standard
Formats plain text pdf html bibtex
Stream WG state Submitted to IESG for Publication
Document shepherd Mark Townsley
Shepherd write-up Show (last changed 2015-06-05)
IESG IESG state IESG Evaluation - Defer::Revised I-D Needed
Consensus Boilerplate Yes
Telechat date
Needs a YES. Needs 6 more YES or NO OBJECTION positions to pass.
Responsible AD Terry Manderson
Send notices to (None)
IANA IANA review state IANA OK - Actions Needed
IANA action state None
Homenet Working Group                                        M. Stenberg
Internet-Draft                                                  S. Barth
Intended status: Standards Track                             Independent
Expires: April 16, 2016                                 October 14, 2015

                  Distributed Node Consensus Protocol
                       draft-ietf-homenet-dncp-11

Abstract

   This document describes the Distributed Node Consensus Protocol
   (DNCP), a generic state synchronization protocol that uses the
   Trickle algorithm and hash trees.  DNCP is an abstract protocol, and
   must be combined with a specific profile to make a complete
   implementable protocol.

Status of This Memo

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

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://datatracker.ietf.org/drafts/current/.

   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."

   This Internet-Draft will expire on April 16, 2016.

Copyright Notice

   Copyright (c) 2015 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.

Stenberg & Barth         Expires April 16, 2016                 [Page 1]
Internet-Draft     Distributed Node Consensus Protocol      October 2015

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Applicability . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   5
     2.1.  Requirements Language . . . . . . . . . . . . . . . . . .   7
   3.  Overview  . . . . . . . . . . . . . . . . . . . . . . . . . .   7
   4.  Operation . . . . . . . . . . . . . . . . . . . . . . . . . .   8
     4.1.  Hash Tree . . . . . . . . . . . . . . . . . . . . . . . .   8
       4.1.1.  Calculating network state and node data hashes  . . .   8
       4.1.2.  Updating network state and node data hashes . . . . .   9
     4.2.  Data Transport  . . . . . . . . . . . . . . . . . . . . .   9
     4.3.  Trickle-Driven Status Updates . . . . . . . . . . . . . .  10
     4.4.  Processing of Received TLVs . . . . . . . . . . . . . . .  11
     4.5.  Discovering, Adding and Removing Peers  . . . . . . . . .  14
     4.6.  Data Liveliness Validation  . . . . . . . . . . . . . . .  15
   5.  Data Model  . . . . . . . . . . . . . . . . . . . . . . . . .  16
   6.  Optional Extensions . . . . . . . . . . . . . . . . . . . . .  17
     6.1.  Keep-Alives . . . . . . . . . . . . . . . . . . . . . . .  18
       6.1.1.  Data Model Additions  . . . . . . . . . . . . . . . .  18
       6.1.2.  Per-Endpoint Periodic Keep-Alives . . . . . . . . . .  19
       6.1.3.  Per-Peer Periodic Keep-Alives . . . . . . . . . . . .  19
       6.1.4.  Received TLV Processing Additions . . . . . . . . . .  19
       6.1.5.  Peer Removal  . . . . . . . . . . . . . . . . . . . .  19
     6.2.  Support For Dense Multicast-Enabled Links . . . . . . . .  20
   7.  Type-Length-Value Objects . . . . . . . . . . . . . . . . . .  21
     7.1.  Request TLVs  . . . . . . . . . . . . . . . . . . . . . .  22
       7.1.1.  Request Network State TLV . . . . . . . . . . . . . .  22
       7.1.2.  Request Node State TLV  . . . . . . . . . . . . . . .  22
     7.2.  Data TLVs . . . . . . . . . . . . . . . . . . . . . . . .  22
       7.2.1.  Node Endpoint TLV . . . . . . . . . . . . . . . . . .  22
       7.2.2.  Network State TLV . . . . . . . . . . . . . . . . . .  23
       7.2.3.  Node State TLV  . . . . . . . . . . . . . . . . . . .  23
     7.3.  Data TLVs within Node State TLV . . . . . . . . . . . . .  24
       7.3.1.  Peer TLV  . . . . . . . . . . . . . . . . . . . . . .  24
       7.3.2.  Keep-Alive Interval TLV . . . . . . . . . . . . . . .  25
   8.  Security and Trust Management . . . . . . . . . . . . . . . .  25
     8.1.  Pre-Shared Key Based Trust Method . . . . . . . . . . . .  25
     8.2.  PKI Based Trust Method  . . . . . . . . . . . . . . . . .  26
     8.3.  Certificate Based Trust Consensus Method  . . . . . . . .  26
Show full document text