应《网络安全法》要求，自2017年10月1日起，未进行实名认证将不得使用互联网跟帖服务。为保障您的帐号能够正常使用，请尽快对帐号进行手机号验证，感谢您的理解与支持！

24小时热门版块排行榜    

小木虫论坛-学术科研互动平台» 文献求助区» 检索知识 » 检索知识完结子版 » 帮忙查下检索号
51/1返回列表
查看: 205  |  回复: 4
只看楼主 @他人 存档 新回复提醒 (忽略) 收藏    在APP中查看
本帖产生 1 个 ，点击这里进行查看

wp2011

铁虫 (初入文坛)

[求助] 帮忙查下检索号

论文题目：towards locality aware dht for fast mapping service in future internet
期刊：computer communicates
回复此楼

» 猜你喜欢
1楼 2015-10-08 22:45:18
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

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的回帖

baiyuefei

版主 (文学泰斗)

风雪

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

【答案】应助回帖

Accession number:  20152100880963
回复此楼
3楼2015-10-09 07:19:29
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

baiyuefei

版主 (文学泰斗)

风雪

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

【答案】应助回帖

Towards locality-aware DHT for fast mapping service in future Internet
作者eng Wang; Julong Lan; Yuxiang Hu; Shuqiao Chen

Computer Communications

卷: 66  
页: 14-24  
DOI: 10.1016/j.comcom.2015.04.003  

出版年: 15 July 2015  



摘要
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. [All rights reserved Elsevier].

作者信息
作者地址: Peng Wang; Julong Lan; Yuxiang Hu; Shuqiao Chen; Nat. Digital Switching Syst. Eng. & Technol. R&D Centre, Zhengzhou, China.

出版商
Elsevier B.V., Netherlands

类别 / 分类
研究方向:Telecommunications; Communication; Mathematics; Computer Science (由 Thomson Reuters 提供)

国际专利分类:G06F15/18 In which a programme is changed according to experience gained by the computer itself during a complete run; Learning machines; H04L12/28 Characterised by path configuration, e.g. lan [local area networks] or wan [wide area networks]; H04W16/00 Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cell structures; H04W40/00 Communication routing or communication path finding; G06N5/04 Inference methods or devices

分类代码:B6210L Computer communications; B6150P Communication network design, planning and routing; B0240J Markov processes; C5620W Other computer networks; C6170K Knowledge engineering techniques; C1140J Markov processes

CODEN:COCOD7

受控索引:Internet; learning (artificial intelligence); Markov processes; telecommunication network routing

非受控索引:distributed hash table; locality-aware DHT; Internet; identifier separation; locator separation; identifier-to-locator mapping service; self-certifying flat identifiers; fast mapping service; LMChord construction model; Markov decision process; MDP; reinforcement learning; LMChord routing hops

文献信息
文献类型:Journal Paper

语种:English

入藏号:INSPEC:15449577

ISSN:0140-3664

参考文献数:50

其他信息
处理类型:Bibliography, Practical

文献号:S0140-3664(15)00151-6
回复此楼
4楼2015-10-09 07:20:09
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

baiyuefei

版主 (文学泰斗)

风雪

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

【答案】应助回帖

Towards locality-aware DHT for fast mapping service in future Internet
作者:Wang, P (Wang, Peng)[ 1 ] ; Lan, JL (Lan, Julong)[ 1 ] ; Hu, YX (Hu, Yuxiang)[ 1 ] ; Chen, SQ (Chen, Shuqiao)[ 1 ]


COMPUTER COMMUNICATIONS


卷: 66
页: 14-24
DOI: 10.1016/j.comcom.2015.04.003

出版年: JUL 15 2015

查看期刊信息

COMPUTER COMMUNICATIONS  

出版商 ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS

ISSN: 0140-3664
eISSN: 1873-703X

研究领域 Computer Science
Engineering
Telecommunications



摘要
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. (C) 2015 Elsevier B.V. All rights reserved.

关键词
作者关键词:Future Internet; Mapping service; Identifier/locator separation; Locality-aware; MDP

KeyWords Plus:TO-PEER NETWORKS; OVERLAY NETWORK; ARCHITECTURES; SEPARATION; P2P

作者信息
通讯作者地址: Wang, P (通讯作者)       Natl Digital Switching Syst Engn & Technol Res &, Zhengzhou 450000, Henan, Peoples R China.


地址:        [ 1 ] Natl Digital Switching Syst Engn & Technol Res &, Zhengzhou 450000, Henan, Peoples R China


电子邮件地址:wangpeng.ndsc@gmail.com

基金资助致谢
基金资助机构 授权号
973 Program of China  2012CB315901
2013CB329104  
Natural Science Foundation of China (NSFC)  61309019
61372121  
National High Technology Research and Development Program of China  2013AA013505  
查看基金资助信息关闭基金资助信息   

This work was supported in part by the 973 Program of China under Grant Nos. 2012CB315901 and 2013CB329104, in part by the Natural Science Foundation of China (NSFC) under Grant Nos. 61309019 and 61372121, in part by the National High Technology Research and Development Program of China under Grant No. 2013AA013505. The authors acknowledge all the supports from the above programs. They would also like to thank the anonymous reviewers and the associate editor for their useful comments.

出版商
ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS

类别 / 分类
研究方向:Computer Science; Engineering; Telecommunications

Web of Science 类别:Computer Science, Information Systems; Engineering, Electrical & Electronic; Telecommunications

文献信息
文献类型:Article

语种:English

入藏号: WOS:000358094700002

ISSN: 0140-3664

eISSN: 1873-703X

其他信息
IDS 号: CN0HM

Web of Science 核心合集中的 "引用的参考文献": 49

Web of Science 核心合集中的 "被引频次": 0

影响因子 1.695  1.625  
2014  5 年  


JCR® 类别 类别中的排序 JCR 分区
COMPUTER SCIENCE, INFORMATION SYSTEMS  33/139  Q1
ENGINEERING, ELECTRICAL & ELECTRONIC  88/249  Q2
TELECOMMUNICATIONS  20/77  Q2


数据来自第 2014 版 Journal Citation Reports®
回复此楼
5楼2015-10-09 07:20:34
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 wp2011 的主题更新
51/1返回列表
普通表情 龙 兔 虎 猫
信息提示
关闭
请填处理意见
关闭