Optimal replication algorithms for hierarchical mobility management in PCS networks

  • Authors:

  • Qing Tian;Donald C. Cox

  • Affiliations:

  • Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA;Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

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. In this paper, 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.