Optimal distributed location management in mobile networks

An important issue in the design of future Personal Communication Services (PCS) networks is the efficient management of location information. In this paper, we consider a distributed database architecture for location management in which update and query loads of the individual databases are balanced. We obtain lower bounds to the worst-case delay in locating a mobile user, to the average delay, and to the call blocking probability We then propose a dynamic location management algorithm that meets these lower bounds. The optimality of this algorithm with respect to these three performance measures, as well as simplicity, make it an appealing candidate for distributed location management in PCS networks.