On Relocation Decision Policies of Mobile Databases

Recently, mobile computing has received much attention from database community. Sharing information among mobile users is one of the most challenging issues in mobile computing due to user mobility. Replication is a promising technique to this issue. However, adopting replication into mobile computing is a non-trivial task, since we are still facing other problems such as the lack in disk capacity and wireless network bandwidth used by mobile users. We have proposed a dynamic replica allocation strategy called User Majority Replica Allocation (UMRA) that is well suited to the modern architecture of mobile computing environment while avoiding such problems mentioned above. In this paper, we propose two relocation decision policies for UMRA and we provide a cost analysis for them. We also provide a cost analysis for another replica allocation strategy called Static Replica Allocation (SRA) for a comparison purpose. key words: mobile Computing, databases, replication, evaluation

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

[2]  Gerald Q. Maguire,et al.  A mobile virtual-distributed system architecture for supporting wireless mobile computing and communications , 1995, MobiCom '95.

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

[4]  Mostafa H. Ammar,et al.  Performance Characterization of Quorum-Consensus Algorithms for Replicated Data , 1989, IEEE Trans. Software Eng..

[5]  Darrell D. E. Long,et al.  Efficient dynamic voting algorithms , 1988, Proceedings. Fourth International Conference on Data Engineering.

[6]  Sushil Jajodia,et al.  Dynamic voting algorithms for maintaining the consistency of a replicated database , 1990, TODS.

[7]  A. Prasad Sistla,et al.  Data replication for mobile computers , 1994, SIGMOD '94.

[8]  Tomasz Imielinski,et al.  Mobile Wireless Computing: Solutions and Challenges in Data Management , 1993 .

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

[10]  Dennis Shasha,et al.  The dangers of replication and a solution , 1996, SIGMOD '96.

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

[12]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.

[13]  Rafael Alonso,et al.  Database system issues in nomadic computing , 1993, SIGMOD Conference.

[14]  Michael Rabinovich,et al.  A performance study of general grid structures for replicated data , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

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

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

[17]  Evaggelia Pitoura,et al.  Data Management for Mobile Computing , 1997, The Kluwer International Series on Advances in Database Systems.

[18]  Dan Duchamp,et al.  Service interface and replica management algorithm for mobile file system clients , 1991, [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems.

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