Data replication for mobile computers

Users of mobile computers will soon have online access to a large number of databases via wireless networks. Because of limited bandwidth, wireless communication is more expensive than wire communication. In this paper we present and analyze various static and dynamic data allocation methods. The objective is to optimize the communication cost between a mobile computer and the stationary computer that stores the online database. Analysis is performed in two cost models. One is connection (or time) based, as in cellular telephones, where the user is charged per minute of connection. The other is message based, as in packet radio networks, where the user is charged per message. Our analysis addresses both, the average case and the worst case for determining the best allocation method.

[1]  Lawrence A. Rowe,et al.  Cache consistency and concurrency control in a client/server DBMS architecture , 1991, SIGMOD '91.

[2]  Mahadev Satyanarayanan,et al.  Coda: A Highly Available File System for a Distributed Workstation Environment , 1990, IEEE Trans. Computers.

[3]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[4]  LiKai,et al.  Memory coherence in shared virtual memory systems , 1989 .

[5]  R. H. Katz,et al.  Evaluating the performance of four snooping cache coherency protocols , 1989, ISCA '89.

[6]  James K. Archibald,et al.  Cache coherence protocols: evaluation using a multiprocessor simulation model , 1986, TOCS.

[7]  Derek L. Eager,et al.  Achieving robustness in distributed database systems , 1983, TODS.

[8]  Willy Zwaenepoel,et al.  Adaptive software cache management for distributed shared memory architectures , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[9]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[10]  Ouri Wolfson,et al.  The multicast policy and its relationship to replicated data placement , 1991, TODS.

[11]  Sushil Jajodia,et al.  Distributed algorithms for dynamic replication of data , 1992, PODS.

[12]  Ouri Wolfson,et al.  Object allocation in distributed databases and mobile computers , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

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

[14]  Ouri Wolfson,et al.  A competitive dynamic data replication algorithm , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[15]  Willy Zwaenepoel,et al.  Munin: distributed shared memory based on type-specific memory coherence , 1990, PPOPP '90.

[16]  Joonwon Lee,et al.  Synchronization with multiprocessor caches , 1990, ISCA '90.

[17]  Mostafa H. Ammar,et al.  The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data , 1992, IEEE Trans. Knowl. Data Eng..

[18]  Amos Fiat,et al.  Competitive Paging Algorithms , 1991, J. Algorithms.

[19]  Mostafa H. Ammar,et al.  Multidimensional voting , 1991, TOCS.

[20]  Tomasz Imielinski,et al.  Querying in Highly Mobile Distributed Environments , 1992, VLDB.

[21]  Rafael Alonso,et al.  Query optimization in mobile environments , 1993 .

[22]  Paul Hudak,et al.  Memory coherence in shared virtual memory systems , 1989, TOCS.

[23]  Yuval Rabani,et al.  Competitive algorithms for distributed data management (extended abstract) , 1992, STOC '92.

[24]  Miron Livny,et al.  Distributed Concurrency Control Performance: A Study of Algorithms, Distribution, and Replication , 1988, VLDB.

[25]  Rafael Alonso,et al.  Query Optimization for Energy Efficiency in Mobile Environments , 1993, FMLDO.

[26]  Derek L. Eager,et al.  Disk cache performance for distributed systems , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[27]  Kai Li,et al.  Shared virtual memory on loosely coupled multiprocessors , 1986 .

[28]  David K. Gifford,et al.  Weighted voting for replicated data , 1979, SOSP '79.

[29]  Miron Livny,et al.  Data caching tradeoffs in client-server DBMS architectures , 1991, SIGMOD '91.

[30]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[31]  Tomasz Imielinski,et al.  Replication and mobility , 1992, [1992 Proceedings] Second Workshop on the Management of Replicated Data.

[32]  Yuval Rabani,et al.  Competitive Algorithms for Distributed Data Management , 1995, J. Comput. Syst. Sci..

[33]  Sushil Jajodia,et al.  An algorithm for dynamic data distribution , 1992, [1992 Proceedings] Second Workshop on the Management of Replicated Data.

[34]  Anna R. Karlin,et al.  Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[35]  Divyakant Agrawal,et al.  The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data , 1990, VLDB.

[36]  Randy H. Katz,et al.  Evaluating The Performance Of Four Snooping Cache Coherency Protocols , 1989, The 16th Annual International Symposium on Computer Architecture.