This Article 
 Bibliographic References 
 Add to: 
Replica Placement Algorithms for Mobile Transaction Systems
July 2006 (vol. 18 no. 7)
pp. 954-970
In distributed mobile systems, communication cost and disconnections are major concerns. In this paper, we address replica placement issues to achieve improved performance for systems supporting mobile transactions. We focus on handling correlated data objects and disconnections. Frequently, requests and/or transactions issued by mobile clients may access multiple data objects and should be considered together in terms of replica allocation. We discuss the replication cost model for correlated data objects and show that the problem of finding an optimal solution is NP. We further adjust the replication cost model for disconnections. A heuristic "expansion-shrinking” algorithm is developed to efficiently make replica placement decisions. The algorithm obtains near optimal solutions for the correlated data model and yields significant performance gains when disconnection is considered. Experimental studies show that the heuristic expansion-shrinking algorithm significantly outperforms the general frequency-based replication schemes.

[1] D. Agrawal, A. El Abbadi, and R.C. Steinke, “Epidemic Algorithms in Replicated Databases,” Proc. 16th ACM Symp. Principles of Database Systems (PODS '97), 1997.
[2] A. Bestavros and C. Cunha, “Server-Initiated Document Dissemination for the WWW,” IEEE Data Eng. Bull., vol. 19, no. 3, Sept. 1996.
[3] S. Ceri, S.B. Navathe, and G. Wiederhold, “Distribution Design of Logical Database Schemes,” IEEE Trans. Software Eng., vol. 9, no. 4, 1983.
[4] I. Chen, N. Phan, and I. Yen, “Algorithms for Supporting Disconnected Write Operations for Wireless Web Access in Mobile Client-Server Environments,” IEEE Trans. Mobile Computing, vol. 1, no. 1, Jan.-Mar. 2002.
[5] M. Dunham, A. Helal, and S. Balakrishnan, “A Mobile Transaction Model that Captures both the Data and Movement Behavior,” ACM/Baltzer J. Special Topics in Mobile Networks and Applications, vol. 2, 1997.
[6] J. Gray, P. Helland, P. O'Neil, and D. Shasha, “The Dangers of Replication and a Solution,” Proc. 1996 ACM SIGMOD Int'l Conf. Management of Data, 1996.
[7] M. Gupta, M. Tu, L. Khan, and I. Yen, “A Study of the Model and Algorithms for Handling Location-Dependent Continuous Queries,” Knowledge and Information Systems, vol. 8, no. 4, 2005.
[8] T. Hara, “Effective Replica Allocation in Ad Hoc Networks for Improving Data Accessibility,” Proc. IEEE Infocom Conf., vol. 3, pp. 1568-1576, 2001.
[9] T. Hara, “Replica Allocation Methods in Ad Hoc Networks with Data Update,” Mobile Networks and Applications, vol. 8, pp. 343-354, 2003.
[10] J. Holliday, D. Agrawal, and D. Abbadi, “Partial Replication Using Epidemic Communication,” Proc. 22nd Int'l Conf. Distributed Computing Systems, 2002.
[11] J. Holliday, D. Agrawal, and D. Abbadi, “Disconnection Modes for Mobile Databases,” Wireless Networks, no. 8, 2002.
[12] Y. Huang, P. Sistla, and O. Wolfson, “Data Replication for Mobile Computers,” Proc. ACM SIGMOD Conf., 1994.
[13] IEEE 802.11, Wireless Local Area Networks, http://grouper., 2006.
[14] J. Jing, O. Bukhres, and A. Elmagarmid, “Distributed Lock Management for Mobile Transactions,” Proc. 15th Int'l Conf. Distributed Computing Systems, 1995.
[15] J.J. Kistler and M. Satyanarayanan, “Disconnected Operation in the Coda File System,” ACM Trans. Computer Systems, vol. 10, no. 1, Feb. 1992.
[16] D. Kossmann, “The State of the Art in Distributed Query Processing,” ACM Computing Surveys (CSUR), vol. 32, no. 4, Dec. 2000.
[17] V. Kumar, M. Dunham, and A. Seydim, “TCOT-A Time Out-Based Mobile Transaction Commitment Protocol,” IEEE Trans. Computers, vol. 51, no. 10, Oct. 2002.
[18] V. Lee, S. Son, and E. Chan, “On Transaction Processing with Partial Validation and Timestamp Ordering in Mobile Broadcast Environments,” IEEE Trans. Computers, vol. 51, no. 10, Oct. 2002.
[19] C. Lindemann and O.P. Waldhorst, “Exploiting Epidemic Data Dissemination or Consistency Lookup Operations in Mobile Applications,” ACM J. Mobile Computing and Comm. Rev., vol. 8, no. 2, 2004.
[20] Z. Lu and K.S. McKinley, “Partial Collection Replication versus Cache for Information Retrieval Systems,” Proc.. ACM Int'l Conf. Research and Development in Information Retrieval, July 2000.
[21] S.K. Madria and B.K. Bhargava, “A Transaction Model to Improve Data Availability in Mobile Computing,” Proc. Distributed and Parallel Databases, 2001.
[22] S. Mazumdar, M. Pietrzvk, and P. Chrvsanthis, “Caching Constraint Mobile Data,” Proc. Conf. Information and Knowledge Management (CIKM '01), 2001.
[23] E. Pitoura and G. Samaras, “Locating Objects in Mobile Computing,” IEEE Trans. Knowledge Data Eng., vol. 13, no. 4, pp. 571-592, July/Aug. 2001.
[24] E. Pitoura and P.K. Chrysanthis, “Multiversion Data Broadcast,” IEEE Trans. Computers, vol. 51, no. 10, Oct. 2002.
[25] A.P. Sistla, O. Wolfson, and Y. Huang, “Minimization of Communication Cost through Caching in Mobile Environments,” IEEE Trans. Parallel and Distributed Systems, vol. 9, 1998.
[26] G. Troll and P. Graben, “Zipf's Law Is Not a Consequence of the Central Limit Theorem,” Physics Rev. E, vol. 57, no. 2, pp. 1347-1355, 1998.
[27] O. Wolfson, S. Jajodia, and Y. Huang, “An Adaptive Data Replication Algorithm,” ACM Trans. Database Systems, vol. 22, no. 2, pp. 255-314, 1997.

Index Terms:
Mobile transaction systems, cost, correlated data, replica placement, disconnection.
Manghui Tu, Peng Li, Liangliang Xiao, I-Ling Yen, Farokh B. Bastani, "Replica Placement Algorithms for Mobile Transaction Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 7, pp. 954-970, July 2006, doi:10.1109/TKDE.2006.114
Usage of this product signifies your acceptance of the Terms of Use.