 |
 |
 |
 |
 |
 |
||
 |
 |
 |
 |
 |
| 5 | 1/1 | 返回列表 |
| 查看: 246 | 回復: 4 | ||
| 本帖產(chǎn)生 1 個 ，點擊這里進行查看 | ||
| 當前只顯示滿足指定條件的回帖，點擊這里查看本話題的所有回帖 | ||
wp2011鐵蟲 (初入文壇)
|
[求助]
幫忙查下檢索號
|
|
|
論文題目：towards locality aware dht for fast mapping service in future internet 期刊：computer communicates |
回復此樓» 猜你喜歡
材料與化工調劑一志愿大連海事085600，349
已經(jīng)有4人回復
-
甲基亞磺磺酸鈉和甲基磺酸酯反應機理
已經(jīng)有4人回復
-
理學07化學 303求調劑
已經(jīng)有3人回復
-
一志愿大連理工大學材料求調劑
已經(jīng)有4人回復
-
085600材料與化工調劑
已經(jīng)有11人回復
-
生物考研337分求調劑
已經(jīng)有4人回復
-
材料求調劑 一志愿哈工大總分298分，前三科223分
已經(jīng)有9人回復
-
哈爾濱工業(yè)大學材料與化工專碩378求調劑
已經(jīng)有3人回復
-
求調劑，一志愿 南京航空航天大學 ，080500材料科學與工程學碩，總分289分
已經(jīng)有9人回復
-
材料科學與工程求調劑
已經(jīng)有8人回復
baiyuefei
版主 (文學泰斗)
風雪
- 應助: 4642 (副教授)
- 貴賓: 46.97
- 金幣: 658522
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69425
- 在線: 13328.5小時
- 蟲號: 676696
- 注冊: 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學
- 管轄: 有機交流
3樓2015-10-09 07:19:29
baiyuefei
版主 (文學泰斗)
風雪
- 應助: 4642 (副教授)
- 貴賓: 46.97
- 金幣: 658522
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69425
- 在線: 13328.5小時
- 蟲號: 676696
- 注冊: 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學
- 管轄: 有機交流
【答案】應助回帖
★ ★ ★ ★ ★
感謝參與，應助指數(shù) +1
wp2011(sunshan4379代發(fā)): 金幣+5 2015-10-12 16:12:03
sunshan4379: LS-EPI+1, 感謝應助！ 2015-10-12 16:12:14
感謝參與，應助指數(shù) +1
wp2011(sunshan4379代發(fā)): 金幣+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
baiyuefei
版主 (文學泰斗)
風雪
- 應助: 4642 (副教授)
- 貴賓: 46.97
- 金幣: 658522
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69425
- 在線: 13328.5小時
- 蟲號: 676696
- 注冊: 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學
- 管轄: 有機交流
【答案】應助回帖
|
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 參考文獻數(shù):50 其他信息 處理類型:Bibliography, Practical 文獻號:S0140-3664(15)00151-6 |
4樓2015-10-09 07:20:09
baiyuefei
版主 (文學泰斗)
風雪
- 應助: 4642 (副教授)
- 貴賓: 46.97
- 金幣: 658522
- 散金: 11616
- 紅花: 995
- 沙發(fā): 81
- 帖子: 69425
- 在線: 13328.5小時
- 蟲號: 676696
- 注冊: 2008-12-18
- 性別: GG
- 專業(yè): 合成藥物化學
- 管轄: 有機交流
【答案】應助回帖
|
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 分區(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
| 最具人氣熱帖推薦 [查看全部] | 作者 | 回/看 | 最后發(fā)表 | |
|---|---|---|---|---|
|
[考研] 288資源與環(huán)境專碩求調劑，不限專業(yè)，有學上就行 +11 | lllllos 2026-03-30 | 11/550 |
|
|---|---|---|---|---|
|
[考研] 266分，求材料相關專業(yè)調劑 +6 | 哇呼哼呼哼 2026-03-30 | 7/350 |
|
|
|
[考研] 各位老師好，我的一志愿為北京科技大學085601材料專碩 +10 | Koxui 2026-03-28 | 10/500 |
|
|
|
[考研] 322求調劑 +10 | 宋明欣 2026-03-27 | 10/500 |
|
|
|
[考研] 287求調劑 +14 | land xuxu 2026-03-26 | 14/700 |
|
|
|
[考研] 化工專碩求調劑 +5 | question挽風 2026-03-24 | 5/250 |
|
|
|
[考研] 291求調劑 +8 | HanBeiNingZC 2026-03-24 | 8/400 |
|
|
|
[考研] 342求調劑 +4 | 加油a李zs 2026-03-26 | 4/200 |
|
|
|
[考研] 考研調劑 +5 | Sanmu-124 2026-03-26 | 5/250 |
|
|
|
[碩博家園] 求調劑 有機化學考研356分 +10 | Nadiums 2026-03-25 | 11/550 |
|
|
|
[考研] 295求調劑 +5 | wei-5 2026-03-26 | 5/250 |
|
|
|
[考研] 290求調劑 +3 | dfffsar 2026-03-29 | 3/150 |
|
|
|
[考博] 26申博自薦 +6 | whh869393 2026-03-24 | 6/300 |
|
|
|
[考研] 求調劑 +6 | 蘆lty 2026-03-25 | 7/350 |
|
|
|
[考研] 274求調劑 +17 | 顧九笙要謙虛 2026-03-24 | 23/1150 |
|
|
|
[考研] 0856調劑 +5 | 求求讓我有書讀?/a> 2026-03-26 | 6/300 |
|
|
|
[考研] 085600，材料與化工321分，求調劑 +9 | 大饞小子 2026-03-27 | 9/450 |
|
|
|
[考研] 調劑推薦 +5 | 清酒714 2026-03-26 | 6/300 |
|
|
|
[考研] 一志愿天津大學339材料與化工求調劑 +3 | 江往賣魚 2026-03-26 | 3/150 |
|
|
|
[考研] 一志愿吉林大學材料與化工303分求調劑 +4 | 為學666 2026-03-24 | 4/200 |
|