{
  "draft": "draft-ietf-roll-trickle-08",
  "doc_id": "RFC6206",
  "title": "The Trickle Algorithm",
  "authors": [
    "P. Levis",
    "T. Clausen",
    "J. Hui",
    "O. Gnawali",
    "J. Ko"
  ],
  "format": [
    "TEXT",
    "HTML"
  ],
  "page_count": "13",
  "pub_status": "PROPOSED STANDARD",
  "status": "PROPOSED STANDARD",
  "source": "Routing Over Low power and Lossy networks",
  "abstract": "The Trickle algorithm allows nodes in a lossy shared medium (e.g., low-power and lossy networks) to exchange information in a highly robust, energy efficient, simple, and scalable manner.  Dynamically adjusting transmission windows allows Trickle to spread new information on the scale of link-layer transmission times while sending only a few messages per hour when information does not change.  A simple suppression mechanism and transmission point selection allow Trickle's communication rate to scale logarithmically with density.  This document describes the Trickle algorithm and considerations in its use. [STANDARDS-TRACK]",
  "pub_date": "March 2011",
  "keywords": [
    "Consistency",
    "Eventual consistency",
    "Low-power",
    "Low power"
  ],
  "obsoletes": [],
  "obsoleted_by": [],
  "updates": [],
  "updated_by": [],
  "see_also": [],
  "doi": "10.17487/RFC6206",
  "errata_url": "https://www.rfc-editor.org/errata/rfc6206"
}