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

The information below is for an old version of the document
Document Type Active Internet-Draft (homenet WG)
Last updated 2015-05-06 (latest revision 2015-04-24)
Stream IETF
Intended RFC status Proposed Standard
Formats plain text pdf html bibtex
Additional URLs
- Mailing list discussion
Stream WG state In WG Last Call
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to homenet-chairs@ietf.org, draft-ietf-homenet-dncp@ietf.org, draft-ietf-homenet-dncp.shepherd@ietf.org, draft-ietf-homenet-dncp.ad@ietf.org
Homenet Working Group                                        M. Stenberg
Internet-Draft
Intended status: Standards Track                                S. Barth
Expires: October 26, 2015
                                                          April 24, 2015

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

Abstract

   This document describes the Distributed Node Consensus Protocol
   (DNCP), a generic state synchronization protocol which uses Trickle
   and Merkle trees.  DNCP is transport agnostic and leaves some of the
   details to be specified in profiles, which define actual
   implementable DNCP based protocols.

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 October 26, 2015.

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

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

   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Requirements Language . . . . . . . . . . . . . . . . . . . .   3
   3.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   3
   4.  Data Model  . . . . . . . . . . . . . . . . . . . . . . . . .   5
   5.  Operation . . . . . . . . . . . . . . . . . . . . . . . . . .   6
     5.1.  Trickle-Driven Status Updates . . . . . . . . . . . . . .   7
     5.2.  Processing of Received TLVs . . . . . . . . . . . . . . .   7
     5.3.  Adding and Removing Peers . . . . . . . . . . . . . . . .   9
     5.4.  Purging Unreachable Nodes . . . . . . . . . . . . . . . .   9
   6.  Optional Extensions . . . . . . . . . . . . . . . . . . . . .   9
     6.1.  Keep-Alives . . . . . . . . . . . . . . . . . . . . . . .   9
       6.1.1.  Data Model Additions  . . . . . . . . . . . . . . . .  10
       6.1.2.  Per-Endpoint Periodic Keep-Alives . . . . . . . . . .  10
       6.1.3.  Per-Peer Periodic Keep-Alives . . . . . . . . . . . .  10
       6.1.4.  Received TLV Processing Additions . . . . . . . . . .  11
       6.1.5.  Neighbor Removal  . . . . . . . . . . . . . . . . . .  11
     6.2.  Support For Dense Broadcast Links . . . . . . . . . . . .  11
     6.3.  Node Data Fragmentation . . . . . . . . . . . . . . . . .  12
   7.  Type-Length-Value Objects . . . . . . . . . . . . . . . . . .  12
     7.1.  Request TLVs  . . . . . . . . . . . . . . . . . . . . . .  13
       7.1.1.  Request Network State TLV . . . . . . . . . . . . . .  13
       7.1.2.  Request Node State TLV  . . . . . . . . . . . . . . .  13
     7.2.  Data TLVs . . . . . . . . . . . . . . . . . . . . . . . .  14
       7.2.1.  Node Endpoint TLV . . . . . . . . . . . . . . . . . .  14
       7.2.2.  Network State TLV . . . . . . . . . . . . . . . . . .  14
       7.2.3.  Node State TLV  . . . . . . . . . . . . . . . . . . .  14
       7.2.4.  Custom TLV  . . . . . . . . . . . . . . . . . . . . .  15
     7.3.  Data TLVs within Node State TLV . . . . . . . . . . . . .  16
       7.3.1.  Fragment Count TLV  . . . . . . . . . . . . . . . . .  16
       7.3.2.  Neighbor TLV  . . . . . . . . . . . . . . . . . . . .  16
       7.3.3.  Keep-Alive Interval TLV . . . . . . . . . . . . . . .  17
   8.  Security and Trust Management . . . . . . . . . . . . . . . .  18
     8.1.  Pre-Shared Key Based Trust Method . . . . . . . . . . . .  18
     8.2.  PKI Based Trust Method  . . . . . . . . . . . . . . . . .  18
     8.3.  Certificate Based Trust Consensus Method  . . . . . . . .  18
       8.3.1.  Trust Verdicts  . . . . . . . . . . . . . . . . . . .  18
       8.3.2.  Trust Cache . . . . . . . . . . . . . . . . . . . . .  19
       8.3.3.  Announcement of Verdicts  . . . . . . . . . . . . . .  20
Show full document text