{
  "number": 6206,
  "title": "The Trickle Algorithm",
  "authors": [
    "P. Levis",
    "T. Clausen",
    "J. Hui",
    "O. Gnawali",
    "J. Ko"
  ],
  "published": "2011-03",
  "status": "Proposed Standard",
  "stream": "IETF",
  "area": "rtg",
  "working_group": "roll",
  "pages": 13,
  "formats": [
    "TXT",
    "HTML"
  ],
  "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]",
  "keywords": [
    "Consistency",
    "Eventual consistency",
    "Low-power",
    "Low power"
  ],
  "draft": "draft-ietf-roll-trickle-08",
  "doi": "10.17487/RFC6206",
  "urls": {
    "html": "https://rfc.dk/rfc6206/",
    "text": "https://rfc.dk/rfc6206.txt",
    "rfc_editor": "https://www.rfc-editor.org/rfc/rfc6206",
    "datatracker": "https://datatracker.ietf.org/doc/rfc6206/"
  },
  "text_modified": "2011-03-29T08:40:10Z"
}