Abstract
We consider per-user profile replication as a mechanism for faster location lookup of mobile users in a personal communications service system. We present a minimum-cost maximum-flow based algorithm to compute the set of sites at which a user profile should be replicated given known calling and user mobility patterns. We show the costs and benefits of our replication algorithm against previous location lookup approaches through analysis. We also simulate our algorithm against other location lookup algorithms on a realistic model of a geographical area to evaluate critical system performance measures. A notable aspect of our simulations is that we use well-validated models of user calling and mobility patterns.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice-Hall, Englewood Cliffs, NJ, 1993).
V. Anantharam, M.L. Honig, U. Madhow and V.K. Wei, Optimization of a database hierarchy for mobility tracking in a personal communications network, Performance Evaluation (1994) 287–300.
B. Awerbuch and D. Peleg, Concurrent on line tracking of mobile users, in: Proc. SIGCOM (1991).
B.R. Badrinath, T. Imielinski and A. Virmani, Locating strategies for personal communication networks, in: Workshop on Networking for Personal Communications Applications, IEEE GLOBECOM (December 1992).
M.S. Bazaraa, J.J. Jarvis and H.D. Sherali, Linear Programming and Network Flows (Wiley, New York, 1990)
D.P. Bertsekas, The auction algorithm: A distributed relaxation method for the assignment problem, Annals of Operations Research 14 (1988) 105–123.
S. Ceri, G. Martella and G. Pelagatti, Optimal file allocation in a computer network: A solution method based on the knapsack problem, Comput. Networks 6 (1982).
S.K. Chang and A.C. Liu, File allocation in a distributed database, Internat. J. Comput. Inform Sci. 11(5) (1982).
T.H. Cormen, C.L. Leicerson and R.L. Rivest, Introduction to Algorithms (MIT Press and McGraw-Hill, New York, 1990).
L.W. Dowdy and D.V. Foster, Comparative models of the file allocation problem, ACM Computing Surveys 14(2) (June 1982).
M.K. Fisher and D.S. Hochbaum, Database location in computer networks, Journal of the ACM 27(4) (October 1980).
H. Harjono, R. Jain and S. Mohan, Analysis and simulation of a cache-based auxiliary location strategy for PCS, in: Proc. IEEE Conference on Networks and Personal Communications (1994).
J.S.M. Ho and I.F. Akyildiz, Local anchor scheme for reducing location tracking costs in PCN, in: Proc. 1st ACM International Conference on Mobile Computing and Networking (MOBICOM ’95), Berkeley, California (November 1995) pp. 170–180.
R. Jain and Y. Lin, An auxiliary user location strategy employing forwarding pointers to reduce network impacts of pcs, in: Proc. International Conference on Communications (ICC ’95) (1995).
R. Jain, Y.-B. Lin, C. Lo and S. Mohan, A caching strategy to reduce network impacts of PCS, IEEE Journal on Selected Areas in Communications 12(8) (October 1994) pp. 1434–1444.
J. Jannink, D. Lam, N. Shivakumar, J. Widom and D.C. Cox, Effi-cient and flexible location management algorithms for wireless communication systems, in: Proc. 2nd ACM International Conference on Mobile Computing and Networking (MOBICOM ’96), New York (November 1996) pp. 38–49.
D. Lam, J. Jannink, D.C. Cox and J. Widom, Modeling location management for Personal Communication Services. Technical Report, Stanford University, Computer Science Dept., October 1995. ftp://wwwdb.stanford.edu/pub/jannink/1995/model/.
S. Mohan and R. Jain, Two user location strategies for personal communications services, IEEE Personal Communications (First Quarter 1994) 42–50.
Metropolitan Transportation Commission, 1990 commute summary, Lotus 123 format spreadsheet, S.F. Bay Area transportation measurements (August 1990).
M.T. Ozsu and P. Valduriez, Principles of Distributed Systems (Prentice-Hall, Englewood Cliffs, NJ, 1991).
N. Shivakumar and J. Widom, User profile replication for faster lookup in mobile environments, in: Proc. 1st ACM International Conference on Mobile Computing and Networking (MOBICOM ’95), Berkeley, California (1995) pp. 161–169.
Transaction processing benchmarks, monthly TPC-A, TPC-B & TPC-C benchmark results. http://www.ideas.com.au/bench/bench. htm (1995).
1990 U.S. census demographic summaries, Population of nine S.F. Bay Area counties, UpClose Publishing. http://www.upclose.com/ upclose/ (1994).
J.Z. Wang, A fully distributed location registration strategy for universal personal communication systems, IEEE Journal on Selected Areas in Communications 11(6) (August 1993) 850–860.
O. Wolfson and S. Jajodia, Distributed algorithms for dynamic replication of data, in: Proceedings of the Symposium on Principles of Database Systems, San Diego, CA (1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shivakumar, N., Jannink, J. & Widom, J. Per-user profile replication in mobile environments: Algorithms, analysis, and simulation results. Mobile Networks and Applications 2, 129–140 (1997). https://doi.org/10.1023/A:1013668230171
Issue Date:
DOI: https://doi.org/10.1023/A:1013668230171