Browse Prior Art Database

Distributed Node Consensus Protocol (RFC7787)

IP.com Disclosure Number: IPCOM000246698D
Original Publication Date: 2016-Apr-01
Included in the Prior Art Database: 2016-Jun-29
Document File: 82 page(s) / 96K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

M. Stenberg: AUTHOR [+2]

Abstract

DNCP is designed to provide a way for each participating node to publish a small set of TLV (Type-Length-Value) tuples (at most 64 KB) and to provide a shared and common view about the data published by every currently bidirectionally reachable DNCP node in a network.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 3% of the total text.

Internet Engineering Task Force (IETF)                       M. Stenberg Request for Comments: 7787                                      S. Barth Category: Standards Track                                    Independent ISSN: 2070-1721                                               April 2016

                   Distributed Node Consensus Protocol

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 is an Internet Standards Track document.

   This document is a product of the Internet Engineering Task Force    (IETF).  It represents the consensus of the IETF community.  It has    received public review and has been approved for publication by the    Internet Engineering Steering Group (IESG).  Further information on    Internet Standards is available in Section 2 of RFC 5741.

   Information about the current status of this document, any errata,    and how to provide feedback on it may be obtained at    http://www.rfc-editor.org/info/rfc7787.

Copyright Notice

   Copyright (c) 2016 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             Standards Track                    [Page 1]
 RFC 7787           Distributed Node Consensus Protocol        April 2016

 Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3

     1.1.  Applicability . . . . . . . . . . . . . . . . . . . . . .   4

   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   6

     2.1.  Requirements Language . . . . . . . . . . . . . . . . . .   8

   3.  Overview  . . . . . . . . . . . . . . . . . . . . . . . . . .   8

   4.  Operation . . . . . . . . . . . . . . . . . . . . . . . . . .   9

     4.1.  Hash Tree . . . . . . . . . . . . . . . . . . . . . . . .   9

       4.1.1.  Calculating Network State and Node Data Hashes ...