RFC 6206: The Trickle Algorithm
Philip Levis, Thomas Clausen, Jonathan Hui, Omprakash Gnawali, and JeongGil Ko
Published in Internet Engineering Task Force (IETF), Request for Comments: 6206, March 2011.
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.
Paper (30KB)
BibTeX entry
@inproceedings{rfc6206, author = "Philip Levis and Thomas Clausen and Jonathan Hui and Omprakash Gnawali and JeongGil Ko", title = "{RFC 6206: The Trickle Algorithm}", booktitle = "{Internet Engineering Task Force (IETF), Request for Comments: 6206}", year = {2011}, month = {March} }