RFC 6206
The Trickle Algorithm, March 2011
- Canonical URL:
- https://www.rfc-editor.org/rfc/rfc6206.txt
- File formats:


- Status:
- PROPOSED STANDARD
- Authors:
- P. Levis
T. Clausen
J. Hui
O. Gnawali
J. Ko - Stream:
- IETF
- Source:
- roll (rtg)
DOI: 10.17487/RFC6206
Discuss this RFC: Send questions or comments to roll@ietf.org
Other actions: Find Errata (if any) | Submit Errata | Find IPR Disclosures from the IETF
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]
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 4844.