 |
 |
 |
 |
 |
 |
||
 |
 |
 |
 |
 |
| 5 | 1/1 | 返回列表 |
| 查看: 235 | 回復(fù): 4 | ||
| 本帖產(chǎn)生 1 個(gè) ，點(diǎn)擊這里進(jìn)行查看 | ||
wp2011鐵蟲 (初入文壇)
|
[求助]
幫忙查下檢索號(hào)
|
|
|
論文題目：towards locality aware dht for fast mapping service in future internet 期刊：computer communicates |
回復(fù)此樓» 猜你喜歡
焦慮
已經(jīng)有10人回復(fù)
-
298-一志愿中國(guó)農(nóng)業(yè)大學(xué)-求調(diào)劑
已經(jīng)有3人回復(fù)
-
265求調(diào)劑
已經(jīng)有3人回復(fù)
-
297求調(diào)劑
已經(jīng)有3人回復(fù)
-
302求調(diào)劑
已經(jīng)有8人回復(fù)
-
環(huán)境工程調(diào)劑
已經(jīng)有7人回復(fù)
-
268求調(diào)劑
已經(jīng)有6人回復(fù)
-
311求調(diào)劑
已經(jīng)有11人回復(fù)
-
工科材料085601 279求調(diào)劑
已經(jīng)有4人回復(fù)
-
301求調(diào)劑
已經(jīng)有9人回復(fù)
baiyuefei
版主 (文學(xué)泰斗)
風(fēng)雪
- 應(yīng)助: 4642 (副教授)
- 貴賓: 46.969
- 金幣: 658580
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69420
- 在線: 13323小時(shí)
- 蟲號(hào): 676696
- 注冊(cè): 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學(xué)
- 管轄: 有機(jī)交流
【答案】應(yīng)助回帖
★ ★ ★ ★ ★
感謝參與，應(yīng)助指數(shù) +1
wp2011(sunshan4379代發(fā)): 金幣+5 2015-10-12 16:12:03
sunshan4379: LS-EPI+1, 感謝應(yīng)助！ 2015-10-12 16:12:14
感謝參與，應(yīng)助指數(shù) +1
wp2011(sunshan4379代發(fā)): 金幣+5 2015-10-12 16:12:03
sunshan4379: LS-EPI+1, 感謝應(yīng)助！ 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
baiyuefei
版主 (文學(xué)泰斗)
風(fēng)雪
- 應(yīng)助: 4642 (副教授)
- 貴賓: 46.969
- 金幣: 658580
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69420
- 在線: 13323小時(shí)
- 蟲號(hào): 676696
- 注冊(cè): 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學(xué)
- 管轄: 有機(jī)交流
3樓2015-10-09 07:19:29
baiyuefei
版主 (文學(xué)泰斗)
風(fēng)雪
- 應(yīng)助: 4642 (副教授)
- 貴賓: 46.969
- 金幣: 658580
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69420
- 在線: 13323小時(shí)
- 蟲號(hào): 676696
- 注冊(cè): 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學(xué)
- 管轄: 有機(jī)交流
【答案】應(yīng)助回帖
|
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 提供) 國(guó)際專利分類: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 文獻(xiàn)信息 文獻(xiàn)類型:Journal Paper 語種:English 入藏號(hào):INSPEC:15449577 ISSN:0140-3664 參考文獻(xiàn)數(shù):50 其他信息 處理類型:Bibliography, Practical 文獻(xiàn)號(hào):S0140-3664(15)00151-6 |
4樓2015-10-09 07:20:09
baiyuefei
版主 (文學(xué)泰斗)
風(fēng)雪
- 應(yīng)助: 4642 (副教授)
- 貴賓: 46.969
- 金幣: 658580
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69420
- 在線: 13323小時(shí)
- 蟲號(hào): 676696
- 注冊(cè): 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學(xué)
- 管轄: 有機(jī)交流
【答案】應(yīng)助回帖
|
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 研究領(lǐng)域 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. 關(guān)鍵詞 作者關(guān)鍵詞: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 基金資助致謝 基金資助機(jī)構(gòu) 授權(quán)號(hào) 973 Program of China 2012CB315901 2013CB329104 Natural Science Foundation of China (NSFC) 61309019 61372121 National High Technology Research and Development Program of China 2013AA013505 查看基金資助信息關(guān)閉基金資助信息 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 文獻(xiàn)信息 文獻(xiàn)類型:Article 語種:English 入藏號(hào): WOS:000358094700002 ISSN: 0140-3664 eISSN: 1873-703X 其他信息 IDS 號(hào): CN0HM Web of Science 核心合集中的 "引用的參考文獻(xiàn)": 49 Web of Science 核心合集中的 "被引頻次": 0 影響因子 1.695 1.625 2014 5 年 JCR® 類別 類別中的排序 JCR 分區(qū) COMPUTER SCIENCE, INFORMATION SYSTEMS 33/139 Q1 ENGINEERING, ELECTRICAL & ELECTRONIC 88/249 Q2 TELECOMMUNICATIONS 20/77 Q2 數(shù)據(jù)來自第 2014 版 Journal Citation Reports® |
5樓2015-10-09 07:20:34
相關(guān)版塊跳轉(zhuǎn)
我要訂閱樓主 wp2011 的主題更新
| 5 | 1/1 | 返回列表 |
| 最具人氣熱帖推薦 [查看全部] | 作者 | 回/看 | 最后發(fā)表 | |
|---|---|---|---|---|
|
[考研] 環(huán)境工程調(diào)劑 +7 | 大可digkids 2026-03-16 | 7/350 |
|
|---|---|---|---|---|
|
|
[考研] 328求調(diào)劑，英語六級(jí)551，有科研經(jīng)歷 +3 | 生物工程調(diào)劑 2026-03-16 | 8/400 |
|
|
[考研] 293求調(diào)劑 +6 | 世界首富 2026-03-11 | 6/300 |
|
|
|
[考研] 有沒有道鐵/土木的想調(diào)劑南林，給自己招師弟中～ +3 | TqlXswl 2026-03-16 | 7/350 |
|
|
|
[考研] 08工科 320總分 求調(diào)劑 +4 | 梨花珞晚風(fēng) 2026-03-17 | 4/200 |
|
|
|
[考研] 304求調(diào)劑 +4 | ahbd 2026-03-14 | 4/200 |
|
|
|
[考研] 070300化學(xué)學(xué)碩求調(diào)劑 +6 | 太想進(jìn)步了0608 2026-03-16 | 6/300 |
|
|
|
[考研] 277材料科學(xué)與工程080500求調(diào)劑 +3 | 自由煎餅果子 2026-03-16 | 3/150 |
|
|
|
[考研] 0856求調(diào)劑 +3 | 劉夢(mèng)微 2026-03-15 | 3/150 |
|
|
|
[考研] 復(fù)試調(diào)劑 +4 | z1z2z3879 2026-03-14 | 5/250 |
|
|
|
[考研] 266求調(diào)劑 +4 | 學(xué)員97LZgn 2026-03-13 | 4/200 |
|
|
|
[考研] 四川大學(xué)085601材料工程專碩 初試294求調(diào)劑 +4 | 祝我們好在冬天 2026-03-11 | 4/200 |
|
|
|
[考研] 考研調(diào)劑 +4 | 芬達(dá)46 2026-03-12 | 4/200 |
|
|
|
[考研] 材料專碩350 求調(diào)劑 +4 | 王金科 2026-03-12 | 4/200 |
|
|
|
[考研] 290求調(diào)劑 +7 | ADT 2026-03-12 | 7/350 |
|
|
|
[考研] 一志愿山大07化學(xué) 332分 四六級(jí)已過 本科山東雙非 求調(diào)劑！ +3 | 不想理你 2026-03-12 | 3/150 |
|
|
|
[考研] 0856化學(xué)工程280分求調(diào)劑 +4 | shenzxsn 2026-03-11 | 4/200 |
|
|
|
[考研] 289求調(diào)劑 +3 | 李政瑩 2026-03-12 | 3/150 |
|
|
|
[考研] 321求調(diào)劑（食品/專碩） +3 | xc321 2026-03-12 | 6/300 |
|
|
|
[考博] 26讀博 +4 | Rui135246 2026-03-12 | 10/500 |
|