24小时热门版块排行榜    

查看: 212  |  回复: 4
本帖产生 1 个 ,点击这里进行查看
当前只显示满足指定条件的回帖,点击这里查看本话题的所有回帖

baiyuefei

版主 (文学泰斗)

风雪

优秀版主优秀版主优秀版主文献杰出贡献优秀版主优秀版主优秀版主文献杰出贡献优秀版主优秀版主优秀版主优秀版主文献杰出贡献优秀版主优秀版主优秀版主优秀版主优秀版主优秀版主

【答案】应助回帖

★ ★ ★ ★ ★
感谢参与,应助指数 +1
wp2011(sunshan4379代发): 金币+5 2015-10-12 16:12:03
sunshan4379: LS-EPI+1, 感谢应助! 2015-10-12 16:12:14
Accession number:  20152100880963

  Title:  Towards locality-aware DHT for fast mapping service in future Internet
  Authors:  Wang, Peng1 ; Lan, Julong1; Hu, Yuxiang1; Chen, Shuqiao1  
  Author affiliation:  1 National Digital Switching System Engineering and Technological Research and Development Centre (NDSC), Zhengzhou; Henan, China  
  Corresponding author:  Wang, Peng  
  Source title:  Computer Communications
  Abbreviated source title:  Comput Commun
  Volume:  66
  Issue date:  July 15, 2015
  Publication year:  2015
  Pages:  14-24
  Language:  English
  ISSN:  01403664  
  CODEN:  COCOD7  
  Document type:  Journal article (JA)
  Publisher:  Elsevier
  Abstract:  The identifier/locator separation has been shown to be critical for the design of future Internet. A key aspect of the identifier/locator separation is to design an identifier-to-locator mapping service to map identifiers onto locators. Although several mapping services have been presented in previous works, they either are designed based on aggregable identifiers, or suffer from high resolution latency. That is, they hardly meet the demands of the future Internet, which is desired to support fast mapping and self-certifying flat identifiers. In this paper, we propose LMChord, a fast mapping service that is based on the idea of locality-aware and hierarchical Distributed Hash Table (DHT). To address the mismatch problem between overlay and physical network, we present the LMChord construction model, which models the LMChord construction process as a Markov decision process (MDP). Moreover, we present a Markov decision construction algorithm, which improves reinforcement learning to get the global optimal or near-optimal construction strategy. To further improve routing efficiency, we also modify the finger table to optimize the LMChord's routing hops. We show that, besides the capability to support incremental deployment and flat identifiers, the mapping scheme is more scalable and has lower resolution latency. The evaluation also demonstrates the performance of our approach. © 2015 Elsevier B.V. All rights reserved.
  Number of references:  50
  Main heading:  Mapping  
  Controlled terms:  Internet - Markov processes - Reinforcement learning - Separation - Telecommunication networks  
  Uncontrolled terms:  Future internet - Identifier/locator separations - Locality aware - Mapping service - MDP  
  DOI:  10.1016/j.comcom.2015.04.003
  Database:  Compendex
   Compilation and indexing terms, © 2015 Elsevier Inc.

Full-text and Local Holdings Links
2楼2015-10-09 07:19:07
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 wp2011 的主题更新
信息提示
请填处理意见