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 manage ment in which update and query loads of the individual databases are balanc ed. We obtain lower bounds to the worst-case delay in locating a mobile use r, to the average delay, and to the call blocking probability We then propo se a dynamic location management algorithm that meets these lower bounds. T he optimality of this algorithm with respect to these three performance mea sures, as well as simplicity, make it an appealing candidate for distribute d location management in PCS networks.