.png){kind=icon}
返回
Bandwidth efficient string reconciliation using puzzles
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2006.148.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Of considerable interest in recent years has been the problem of exchanging correlated data with minimum communication. We thus consider the problem of exchanging two similar strings held by different hosts. Our approach involves transforming a string into a multiset of substrings that are reconciled efficiently using known multiset reconciliation algorithms, and then put back together on a remote host using tools from graph theory. We present analyses, experiments, and results to show that the communication complexity of our approach for high-entropy data compares favorably to existing algorithms including rsync, a widely-used string reconciliation engine. We also quantify the trade-off between communication and the computation complexity of our approach.
Keyword:
efficient file synchronization
string reconstruction
rsync
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
暂无机构信息
引用论文
An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems.png)
Entropy
OAAI
EntropyIF0
OAAI分享收藏l -Deprenyl metabolism by the cytochrome P450 system in monkey (Cercopithecus aethiops) liver microsomesXenobiotica
XenobioticaIF0
PREAI
分享收藏On the scalability of data synchronization protocols for PDAs and mobile devicesIEEE NETWORKOAAI
IEEE NETWORKIF6.3
OAAI分享收藏
查看更多内容