Abstract-Scalable mobility support is an important task in 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. However these schemes have shortcomings in query and update performances and network scalability. It is because although routing of overlay itself is effective, there is inconsistency between logical and physical topologies, so the actual physical network performances are not necessarily efficient. In this article, while modeling the overlay mapping query to a Markov decision process (MDP), we define the reward function combining physical layer information with application layer information. Then we present a Markov decision routing (MDR) algorithm, which improves backward induction to get the global optimal strategy, and can balance the complexity of the time and space. We propose a DHT and MDR-based mobility management (DMDRMM) scheme. The numerical results show that the scheme inherits the advantages of the DHT-based management structure, and optimizes the update and query performances of dDHT especially for large-scale network.
In REF , we proposed the DHT and Markov decision process based mobility management scheme.
A DHT and MDP-based mobility management scheme for large-scale mobile internet
2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Computer Science