A DHT and MDP-based mobility management scheme for large-scale mobile internet

Yujia Zhai, Yue Wang, I. You, Jian Yuan, Yong Ren, X. Shan
{"title":"A DHT and MDP-based mobility management scheme for large-scale mobile internet","authors":"Yujia Zhai, Yue Wang, I. You, Jian Yuan, Yong Ren, X. Shan","doi":"10.1109/INFCOMW.2011.5928842","DOIUrl":null,"url":null,"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.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2011.5928842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

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.
基于DHT和mdp的大规模移动互联网移动管理方案
可扩展的移动支持是大规模移动互联网中的一项重要任务。基于分布式哈希表(DHT)的移动支持方案具有高度的用户可扩展性和负载均衡性,已经进行了大量的研究。然而,这些方案在查询更新性能和网络可扩展性方面存在不足。这是因为虽然叠加路由本身是有效的,但逻辑拓扑与物理拓扑之间存在不一致性,所以实际的物理网络性能不一定是有效的。本文在对马尔可夫决策过程(MDP)的叠加映射查询建模的同时,定义了结合物理层信息和应用层信息的奖励函数。在此基础上,提出了一种马尔可夫决策路由(MDR)算法,该算法改进了逆向归纳法得到全局最优策略,并能平衡时间和空间的复杂性。我们提出了一种基于DHT和mdr的移动性管理(DMDRMM)方案。数值计算结果表明,该方案继承了基于dht的管理结构的优点,优化了dDHT的更新和查询性能,尤其适用于大规模网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信