<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-roll-trickle" target="https://datatracker.ietf.org/doc/html/draft-ietf-roll-trickle-08">
   <front>
      <title>The Trickle Algorithm</title>
      <author initials="P." surname="Levis" fullname="P Levis">
         <organization>Stanford University</organization>
      </author>
      <author initials="T. H." surname="Clausen" fullname="Thomas H. Clausen">
         <organization>LIX, Ecole Polytechnique</organization>
      </author>
      <author initials="O." surname="Gnawali" fullname="Omprakash Gnawali">
         <organization>Stanford University</organization>
      </author>
      <author initials="J." surname="Hui" fullname="Jonathan Hui">
         <organization>Arch Rock Corporation</organization>
      </author>
      <author initials="J." surname="Ko" fullname="JeongGil Ko">
         <organization>Johns Hopkins University</organization>
      </author>
      <date month="January" day="10" year="2011" />
      <abstract>
	 <t>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&#x27;s communication rate to scale logarithmically with density.  This document describes the Trickle algorithm and considerations in its use. [STANDARDS-TRACK]
	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-roll-trickle-08" />
   
</reference>
