Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
Weak-consistency group communication and membership
Weak-consistency group communication and membership
Managing update conflicts in Bayou, a weakly connected replicated storage system
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Summary cache: a scalable wide-area web cache sharing protocol
IEEE/ACM Transactions on Networking (TON)
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Database System Concepts
An Optimal Strategy for Comparing File Copies
IEEE Transactions on Parallel and Distributed Systems
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
Set Reconciliation with Nearly Optimal Communication Complexity
Set Reconciliation with Nearly Optimal Communication Complexity
Support for Speculative Update Propagation and Mobility in Deno
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Data verification and reconciliation with generalized error-control codes
IEEE Transactions on Information Theory
On the scalability of data synchronization protocols for PDAs and mobile devices
IEEE Network: The Magazine of Global Internetworking
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
DeltaCast: efficient file reconciliation in wireless broadcast systems
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Processing Letters
Clustering coefficient queries on massive dynamic social networks
WAIM'10 Proceedings of the 11th international conference on Web-age information management
SigMatch: fast and scalable multi-pattern matching
Proceedings of the VLDB Endowment
A flexible graph pattern matching framework via indexing
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Improved sketching of hamming distance with error correcting
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
| Hi-index | 0.00 |
Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as "slow sync" for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage, latency, and energy consumption since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync) predicated upon recent information-theoretic research. The salient property of this scheme is that its communication complexity depends on the number of differences between the PDA and PC, and is essentially independent of the overall number of records. Moreover, our implementation shows that the computational complexity and energy consumption of CPIsync is practical and that the overall latency is typically much smaller than that of slow sync or alternative synchronization approaches based on Bloom filters. Thus, CPIsync has potential for significantly improving synchronization protocols for PDAs and, more generally, for heterogeneous networks of many machines.