Abstract
Recent advances in hardware technologies such as portable computers and wireless communication networks have led to the emergence of mobile computing systems. Thus, availability and accessibility of the data and services become important issues of mobile computing systems. In this paper, we present a data replication and management scheme tailored for such environments. In the proposed scheme data is replicated synchronously over stationary sites while for the mobile network, data is replicated asynchronously based on commonly visited sites for each user. The proposed scheme is compared with other techniques and is shown to require less communication cost for an operation as well as provide higher degree of data availability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nicola, M., Jarke, M.: Performance Modeling of Distributed and Replicated Databases. IEEE Trans. And Knowledge Engineering 12(4), 645–670 (2000)
Wolfson, O., Jajodia, S., Huang, Y.: An Adaptive Data Replication Algorithm. ACM Transactions on Database Systems 22(2), 255–314 (1997)
Holliday, J., Agrawal, D., El Abbadi, A.: Disconnection Modes for Mobile Databases. Journal of Mobile Network 8, 391–402 (2002)
Budiarto, S.N., Noshio, S., Tsukamoto, M.: Data Management Issues in Mobile and Peer-to-Peer Environment. Data and Knowledge Engineering 41, 183–204 (2002)
Agrawal, D., El Abbadi, A.: Using Reconfiguration For Efficient Management of Replicated Data. IEEE Trans. On Know. and Data Eng. 8(5), 786–801 (1996)
Paris, J.F., Long, D.E.: Efficient Dynamic Voting Algorithms. In: Proc. Fourth IEEE Int’l Conf. Data Eng, pp. 268–275 (February 1988)
Mat Deris, M., Abawajy, J.H., Suzuri, H.M.: An Efficient Replicated Data Access Approach for Large-Scale Distributed Systems. In: Proc.IEEE International Symposium on Cluster Computing and the Grid, Chicago, vol. 2660, pp. 223–229 (April 2004)
Agrawal, D., El Abbadi, A.: The Tree Quorum technique: An Efficient Approach for Managing Replicated Data. In: Proc.16th Int’l Conf. On Very Large Data Bases, pp. 243–254 (August 1990)
Agrawal, D., El Abbadi, A.: The generalized Tree Quorum Technique: An Efficient Approach for Managing Replicated Data. ACM Trans. Database Systems 17(4), 689–717 (1992)
Cheung, S.Y., Ammar, M.H., Ahmad, M.: The Grid Protocol: A High Performance Schema for Maintaining Replicated Data. IEEE Trans. Knowledge and Data Engineering 4(6), 582–592 (1992)
Jajodia, S., Mutchles, D.: Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database. ACM Trans. Database Systems 15(2), 230–280 (1990)
Maekawa, M.: A Ön Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Computer Systems 3(2), 145–159 (1992)
Budiarto, S.N., Harumoto, K., Tsukamoto, M., Nishio, S., Takine, T.: Replica allocation strategies for mobile databases. IEICE Transactions on Information and Systems E81-D(1), 112–121 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Deris, M.M., Abawajy, J.H., Omar, M. (2005). A New Approach For Efficiently Achieving High Availability in Mobile Computing. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_7
Download citation
DOI: https://doi.org/10.1007/11424857_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25862-9
Online ISBN: 978-3-540-32045-6
eBook Packages: Computer ScienceComputer Science (R0)