Optimal replication algorithms for hierarchical mobility management in PCS networks

In the context of heterogeneous networks and diverse communication devices, real person-to-person communication can be achieved with a universal personal identification (UPI) that uniquely identifies an individual and is independent of the access networks and communication devices. Hierarchical mobility management techniques (MMTs) have been proposed to support UPI. Traditional replication methods for improving the performance of such MMTs are threshold-based. We present optimal replication algorithms that minimize the network messaging cost based on network structure, communication link cost, and user calling and mobility statistics. We develop our algorithms for both unicast and multicast replica update strategies. The performance of these replication algorithms is studied via large scale network simulations and compared to results obtained from the threshold-based method.

I. Introduction

Looking at trends in today's personal communication, it is evident that a single network can not satisfy the diversity of communication needs, because people will continue to use multiple devices to communicate with one another. Multiple devices require multiple addresses, making it inconvenient to communicate with another person. To achieve the goal of personal communications [1] [2], we need a Universal Personal Identification (UPI) that uniquely identifies an individual and is independent of the access network and communication devices. We take the stance that such UPIs will become an integral part of future personal communication systems so as to better serve the ever increasing communication needs across heterogeneous networks and through a variety of diverse communication devices. Under such context, the relevant problem to be solved is how to locate a user given his UPI.