.png){kind=icon}
.png){kind=icon}
返回
Optimizing the Trickle Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2015.2408339.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Trickle Algorithm has enjoyed much popularity and widespread use as a basic network primitive ensuring low-cost data consistency in lossy networks. Trickle is shaped by the so-called short-listen problem, hence the imposition of a listen-only period. Such a period allows Trickle to robustly address the short-listen problem at the expense of increased latency. In this letter, we introduce a simple yet powerful optimization to Trickle that can dramatically decrease Trickle's latency with virtually no additional overhead to its scalability and robustness. Extensive simulation and testbed experiments are reported here, yielding greater than a factor of 10 decrease in propagation time.
Keyword:
The Trickle algorithm
low-power and lossy networks
RPL
MPL
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。