Hierarchical DHT and proportional replication based mobility management for large‐scale mobile Internet

A considerable amount of research on distributed hash table (DHT) based mobility support schemes, which are highly user scalable and load balanced, has been done. But these schemes have shortcomings in query performances and network scalability. It is because although routing of overlay is effective, there is inconsistency between logical and physical topologies, so the actual physical network performances are not necessarily efficient. In this paper, we introduce a replication technology based DHT‐based mobility support. Then all queries from any subnet can get responses as early as possible, i.e., the query distances are reduced, and the scopes of the effect of topological inconsistency are limited. We investigate the effect of the number of mapping replicas on query performances for DHT‐based mobility support. And we find that replicating mobile nodes’ mappings in proportion to their call‐mobility‐rates minimizes the query delay and ensures fairness in the query load distribution. Moreover, we combine the hierarchical structure with the domain‐level DHT‐based (dDHT) structure, to reduce the expense of replication on update performances. We propose a hierarchical DHT and proportional replication based mobility management (HDPRMM) scheme. The numerical results show HDPRMM optimizes the query and update performances of dDHT, and achieves better fairness and network scalability than MIP and dDHT.