Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
Elements of information theory
Elements of information theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Operation-based update propagation in a mobile file system
ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Algorithmic complexity of recursive and inductive algorithms
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
| Hi-index | 0.00 |
Wide-area wireless mobile computing environments present interesting challenges for the problem of file synchronization between laptop computers and servers in backbone networks. Wide-area wireless networks are bandwidth-constrained and expensive, thereby making it difficult to synchronize the files in an eager fashion. The problem of file synchronization for laptop computers has been actively studied for more than a decade, and one of the most intriguing questions has been "how little communication is sufficient for file synchronization?" Technically, this is equivalent to the question: "what is the communication complexity for file synchronization?" This article proves the undecidability of the communication complexity for update propagation in a replicated file system if one is willing to transmit operation-based updates.