Fast PDA synchronization using characteristic polynomial interpolation

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 and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a novel PDA synchronization scheme (CPIsync - characteristic polynomial interpolation-based synchronization) 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 of CPIsync is practical, and that the overall latency is typically much smaller than that of slow sync. Thus, CPIsync has potential for significantly improving synchronization protocols for PDAs and, more generally, for heterogeneous networks of many machines.

[1]  Alon Orlitsky,et al.  Interactive communication: balanced distributions, correlated files, and average-case complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  Ugur Çetintemel,et al.  Support for speculative update propagation and mobility in Deno , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[4]  Mark R. Horton Standard for interchange of USENET messages , 1983, RFC.

[5]  Uzi Vishkin,et al.  Communication complexity of document exchange , 1999, SODA '00.

[6]  Khaled A. S. Abdel-Ghaffar,et al.  An Optimal Strategy for Comparing File Copies , 1994, IEEE Trans. Parallel Distributed Syst..

[7]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

[8]  John J. Metzner,et al.  A general decoding technique applicable to replicated file disagreement location and concatenated code decoding , 1990, IEEE Trans. Inf. Theory.

[9]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[10]  John J. Metzner,et al.  A Parity Structure for Large Remotely Located Replicated Data Files , 1983, IEEE Transactions on Computers.

[11]  Kun-Lung Wu,et al.  Low-Cost Comparison and Diagnosis of Large Remotely Located Files , 1986, Symposium on Reliability in Distributed Software and Database Systems.

[12]  Mark G. Karpovsky,et al.  Data verification and reconciliation with generalized error-control codes , 2003, IEEE Transactions on Information Theory.

[13]  Richard A. Golding,et al.  Weak-consistency group communication and membership , 1992 .

[14]  Mor Harchol-Balter,et al.  Resource discovery in distributed networks , 1999, PODC '99.

[15]  T. Hassard,et al.  Applied Linear Regression , 2005 .

[16]  Mahadev Satyanarayanan,et al.  Disconnected Operation in the Coda File System , 1999, Mobidata.

[17]  Yaron Minsky,et al.  Set reconciliation with nearly optimal communication complexity , 2003, IEEE Trans. Inf. Theory.

[18]  Marvin Theimer,et al.  Managing update conflicts in Bayou, a weakly connected replicated storage system , 1995, SOSP.

[19]  Robbert van Renesse,et al.  GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast , 1997 .

[20]  Hector Garcia-Molina,et al.  Exploiting symmetries for low-cost comparison of file copies , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[21]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[22]  Robert W. Bowdidge,et al.  Low cost comparisons of file copies , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[23]  Peter L. Reiher,et al.  Peer Replication with Selective Control , 1999, MDA.

[24]  Richard J. Lipton,et al.  A Class of Randomized Strategies for Low-Cost Comparison of File Copies , 1991, IEEE Trans. Parallel Distributed Syst..

[25]  Robbert van Renesse,et al.  A Gossip-Style Failure Detection Service , 2009 .

[26]  Kenneth P. Birman,et al.  Probabilistic Broadcast , 1996 .