Shivakumar, N. and Jannink, J. and Widom, J. (1997) Per-User ProFILE Replication in Mobile Environments: Algorithms, Analysis, and Simulation Results. Technical Report. Stanford InfoLab. (Publication Note: ACM-Baltzer Journal of Mobile Networks and Nomadic Applications (MONET), 2(2): October 1997, 129 - 140)
BibTeX | DublinCore | EndNote | HTML |
| PDF 435Kb |
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 then present schemes for replication plans that gracefully adapt to changes in the calling and 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.
Item Type: | Techreport (Technical Report) | |
---|---|---|
Subjects: | Computer Science > Mobile Computing | |
Projects: | SKC | |
Related URLs: | Project Homepage | http://infolab.stanford.edu/ |
ID Code: | 276 | |
Deposited By: | Import Account | |
Deposited On: | 25 Feb 2000 16:00 | |
Last Modified: | 04 Jan 2009 12:23 |
Download statistics
Repository Staff Only: item control page