The Trickle Algorithm
draft-levis-roll-trickle-00

Document Type Replaced Internet-Draft (individual)
Last updated 2013-02-19 (latest revision 2010-02-25)
Replaced by draft-ietf-roll-trickle
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-ietf-roll-trickle
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-levis-roll-trickle-00.txt

Abstract

The Trickle algorithm allows wireless nodes 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 nechanism and transmission point selection allows Trickle's communication rate to scale logarithmically with density. This document describes Trickle and considerations in its use.

Authors

Levis P (pal@cs.stanford.edu)
Thomas Clausen (T.Clausen@computer.org)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)