This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimization of Communication Cost Through Caching in Mobile Environments
April 1998 (vol. 9 no. 4)
pp. 378-390

Abstract—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] J. Archibald and J.L. Baer, "Cache Coherence Protocols: Evaluation Using a Multiprocessor Simulation Model," ACM Trans. Computer Systems, vol. 4, no. 4, Nov. 1986.
[2] S. Acharya, M. Franklin, and S. Zdonik, “Balancing Push and Pull for Data Broadcast,” Proc. ACM SIGMOD Conf., pp. 183-194, May 1997.
[3] A. Agarwal, R. Simoni, J. Hennessy, and M. Horowitz, “An Evaluation of Directory Schemes for Cache Coherence,” Proc. 15th Ann. Int'l Symp. Computer Architecture, pp. 280-289, 1988.
[4] M. Ahamad, M.H. Ammar, and S.Y. Cheung, "Multi-Dimensional Voting," ACM Trans. Computer Systems, pp. 399-431, Nov. 1991.
[5] R. Alonso and S. Ganguly, "Query Optimization for Energy Efficiency in Mobile Enviroments," Proc. 1993 Int'l Workshop Foundations of Models and Languages for Data and Objects,Aigen, Austria, 1993.
[6] D. Agrawal and A. El Abbadi, "The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data," Proc. 16th Very Large Data Bases, Aug. 1990.
[7] J.K. Bennett, J.B. Carter, and W. Zwaenepoel, "Adaptive Software Cache Management for Distributed Shared Memory Architectures," Proc. 17th Int'l Symp. Computer Architecture, pp. 148-159, May 1990.
[8] J. Bennett, J. Carter, and W. Zwaenepoel, "Munin: Distributed shared-memory based on type-specific memory coherence," Proc. 1990 Conf. Principles and Practice of Parallel Programming.New York: ACM Press, pp. 168-176, 1990.
[9] Y. Bartal, A. Fiat, and Y. Rabani, "Competitive Algorithms for Distributed Data Management," Proc. 24th Ann. ACM Symp. Theory of Compting,Victoria, B.C., Canada, May 1992.
[10] B. Badrinath and T. Imielinski, “Replication and Mobility,” Proc. Second IEEE Workshop Management of Replicated Data, Nov. 1992.
[11] S.Y. Cheung, M. Ammar, and M. Ahamad, “The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data,” Proc. Sixth Int'l Conf. Data Eng., pp. 438-445, Feb. 1990.
[12] M. Carey, M. Franklin, M. Livny, and E. Shekita, "Data Caching Tradeoffs in Client-Server DBMS Architecture," Proc. ACM-SIGMOD Conf. Management of Data,Denver, Colo., May 1991.
[13] M.J. Carey and M. Livny, "Distributed Concurrency Control Performance: A Study of Algorithms, Distribution and Replication," Proc. 14th Very Large Data Bases Conf.,Los Angeles, 1988.
[14] L.W. Dowdy and D.V. Foster, "Comparative Models of the File Assignment Problem," ACM Computing Surveys, vol. 14, no. 2, 1982.
[15] S.J. Eggers and R.H. Katz, "A Characterization of Sharing in Parallel Programs and Its Application to Coherency Protocol Evaluation," Proc. 15th Ann. Int'l Symp. Computer Architecture, IEEE Computer Society Press, Los Alamitos, Calif., 1988, pp. 373-382.
[16] S.J. Eggers and R.H. Katz, "Evaluating the Performance of Four Snooping Cache Coherence Protocols," Proc. 16th Ann. Int'l Symp. Computer Architecture, IEEE Computer Soc. Press, Los Alamitos, Calif., 1989, pp. 2-15.
[17] D.L. Eager and K.C. Sevick, "Achieving Robustness in Distributed Database Systems," ACM Trans. Database Systems, vol. 8, no. 3, pp. 354-381, Sept. 1983.
[18] A. Fiat, R. Karp, M. Luby, L.A. McGeoch, D. Sleator, and N.E. Yong, "Competitive Paging Algorithms," J. Algorithms, vol. 12, pp. 685-699, 1991
[19] M. Franklin, Client Data Caching: A Foundation for High Performance Object Database Systems. Kluwer Academic, 1996.
[20] S. Ganguly and R. Alonso, "Query Optimization in Mobile Environments," technical report, Rutgers Univ., Dec. 1993.
[21] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[22] Y. Huang and O. Wolfson, "A Competitive Dynamic Data Replication Algorithm," IEEE Proc. Ninth Int'l Conf. Data Eng. '93, pp. 310-317,Vienna, 1993.
[23] Y. Huang and O. Wolfson, “Dynamic Allocation in Distributed Systems and Mobile Computers,” IEEE Proc. 10th Int'l Conf. Data Eng., pp. 20-29, 1994.
[24] T. Imielinski and B.R. Badrinath, “Querying in Highly Mobile and Distributed Environment,” Proc. 18th Int'l Conf. Vary Large Data Bases, pp. 41-52, Aug. 1992.
[25] K. Li, "Shared Virtual Memory on Loosely Coupled Multiprocessors," PhD thesis, Dept. of Computer Science, Yale Univ., Sept. 1986.
[26] P. Keleher, S. Dwarkadas, A.L. Cox, and W. Zwaenepoel, "TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems," Proc. Winter 94 Usenix Conf., pp. 115-131, Jan. 1994.
[27] K. Li and P. Hudak, "Memory Coherence in Shared Virtual Memory Systems," ACM Trans. Computer Surveys, vol. 7, no. 4, Nov. 1989.
[28] J. Lee and U. Ramachandram, "Synchronization with Multiprocessor Caches," Proc. 17th Int'l Symp. Computer Architecture, pp. 27-37, May 1990.
[29] A.R. Karlin, M.S. Manasse, L. Rudolph, and D.D. Sleator, "Competitive Snoopy Caching," Algorithmica, vol. 3, pp. 79-119, 1988.
[30] J.J. Kistler and M. Satyanarayanan, "Disconnected Operation in the Coda File System," ACM Trans. Computer Systems, vol. 10, no. 1, Feb. 1992, pp. 3-25.
[31] D. Marakoff and D. Eager, "Disk Cache Performance for Distributed Systems," Proc. 10th IEEE Int'l Conf. Distributed Computing Systems, pp. 212-219,Paris, May 1990.
[32] M. Manasse, L.A. McGeoch, and D. Sleator, "Competitive Algorithms for Online Problems," Proc. 20th ACM Symp. Theory of Compting, pp. 322-333, 1988.
[33] M. Satyanarayanan, J. Kistler, P. Kumar, M. Okasaki, E. Siegel, and D. Steere, "Coda: A Highly Available File System for a Distributed Workstation Environment," IEEE Trans. Computers, vol. 39, no. 4, Apr. 1990.
[34] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[35] O. Wolfson and S. Jajodia, "Distributed Algorithms for Dynamic Replication of Data," Proc. ACM-PODS, 1992.
[36] O. Wolfson and S. Jajodia, "An Algorithm for Dynamic Data Distribution," Proc. Second Workshop Management of Replicated Data (WMRD-II), pp. 62-65, 1992.
[37] O. Wolfson and A. Milo, "The Multicast Policy and Its Relationship to Replicated Data Placement," ACM Trans. Database Systems, vol. 16, no. 1, 1991.
[38] Y. Wang and L. Rowe, "Cache Consistency and Concurrency Control in a Client/Server DBMS Architecture," Proc. 1991 ACM SIGMOD Int'l Conf.,Denver, Colo., May 1991.

Index Terms:
Dynamic data allocation, caching, mobile computing, probabilistic analysis, wireless communication, communication cost.
Citation:
A. Prasad Sistla, Ouri Wolfson, Yixiu Huang, "Minimization of Communication Cost Through Caching in Mobile Environments," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 4, pp. 378-390, April 1998, doi:10.1109/71.667898
Usage of this product signifies your acceptance of the Terms of Use.