.png){kind=icon}
Return
Bandwidth efficient string reconciliation using puzzles
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2006.148.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
efficient file synchronization
string reconstruction
rsync
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
5.2K
Citations:
1.1W
Organization
No organization information available
Cited Papers
An Improved Moth-Flame Optimization Algorithm with Adaptation Mechanism to Solve Numerical and Mechanical Engineering Problems.png)
Entropy
OAAI
EntropyIF0
OAAIShareSaveShareSavel -Deprenyl metabolism by the cytochrome P450 system in monkey (Cercopithecus aethiops) liver microsomesXenobiotica
XenobioticaIF0
PREAI
ShareSaveOn the scalability of data synchronization protocols for PDAs and mobile devicesIEEE NETWORKOAAI
IEEE NETWORKIF6.3
OAAIShareSaveShareSave
ShareSave
View more