The Trickle Algorithm
RFC 6206, “The Trickle Algorithm”, is a Proposed Standard document published in March 2011 by P. Levis, T. Clausen, J. Hui, O. Gnawali, J. Ko. The canonical text is published by the RFC Editor.
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]
What “Proposed Standard” means
An entry-level standards-track specification: stable, peer-reviewed and a solid basis for implementation, though it may still evolve before becoming an Internet Standard.
The canonical text of RFC 6206 is hosted at rfc-editor.org. Available in TXT,HTML.
- RFC 6205 Generalized Labels for Lambda-Switch-Capable Label Switching Routers
- RFC 6207 The Media Types application/mods+xml, application/mads+xml, application/mets+xml, application/marcxml+xml, and application/sru+xml
- RFC 6204 Basic Requirements for IPv6 Customer Edge Routers
- RFC 6208 Cloud Data Management Interface Media Types
- RFC 6203 IMAP4 Extension for Fuzzy Search
- RFC 6209 Addition of the ARIA Cipher Suites to Transport Layer Security
- RFC 6202 Known Issues and Best Practices for the Use of Long Polling and Streaming in Bidirectional HTTP
- RFC 6210 Experiment: Hash Functions with Parameters in the Cryptographic Message Syntax and S/MIME