|
论文大纲，目录 |
| 关键词搜索：P2P DHT Chord 查找 寻路 IPv6 拓扑 层次化 文件共享 |
, and the lower bits are the hash result of the rest of the IPv6 address. As a result, topologically close peers shall also be adjacent in the overlay. An important advantage of our scheme is that it is very simple and barely modifies the original Chord. Simulation results have shown that our method can significantly reduce inter-domain traffic that causes the long routing latency.
3. Devise a novel scheme to construct embedded DHT, which can not only improve the routing efficiency, but also inherit the load-balancing feature of the original DHT. First, nodes independently insert their location information into DHT systems as they do with file indexes. Then, a newly joined node can utilize DHT to get a complete list of all nodes that are close to it in the underlying physical networks. Finally, nodes within the same domains are organized into many local DHTs which are then embedded into a global DHT comprised of all nodes. Thus, routing can be conducted in local DHTs first, and pass through each other (if necessary) with the aid of the global DHT, which means that inter-domain traffic can be minimized to the extreme. To illustrate the feasibility and effectiveness of the scheme, we construct eChord upon the original Chord system. Analysis and simulation demonstrate that our scheme is very effective.
4. Propose a new kind of hierarchical DHT dubbed hChord, in which topologically close nodes are grouped in the overlay and keys are stored in a hierarchical way. Analysis show t无忧论文 【http://www.uklunwen.com】hat hChord can isolate the effect of dynamic nodes within small groups for better scalability and stability, and show improved performance with partial queries.
5. Present a prototype design of an IPv6-based wide-area file sharing system based on Chord6.
Keywords：P2P，DHT，Chord，look up, routing，IPv6，topology，hierarchical, file sharing
目录
摘要 I
Abstract III
目录 V
第1章 序论 １
1.1 P2P研究背景 １
1.2 什么是P2P ２
1.3 为什么需要P2P ３
1.4 P2P的应用领域 ４
1.4.1 信息共享 ４
1.4.2 实时通信 ４
1.4.3 网络游戏 ４
1.4.4 金融服务 ４
1.4.5 信息检索 ５
1.4.6 协同工作 ５
1.4.7 普及计算 ５
1.4.8 网络存储 ５
1.5 如何实现P2P ６
1.5.1 基于目录服务器P2P ６
1.5.2 非结构化P2P ７
1.5.3 结构化P2P ７
1.6 本章小结 ８
第2章 DHT基本原理 ９
2.1 引言 ９
2.2 Chord ９
2.2.1 Chord的设计 ９
2.2.2 Chord的路由 １０
2.2.3节点加入和退出 １２
2.3 Pastry １３
2.3.1 Pastry的设计 １３
2.3.2 Pastry的路由 １４
2.3.3 节点加入和退出 １４
2.4 CAN １５
2.4.1 CAN的设计 １５
2.4.2 CAN的路由 １６
2.4.3 节点加入和退出 １６
2.5 Tapestry １７
2.5.1 Tapestry的设计 １７
2.5.2 Tapestry的路由 １８
2.5.3 节点加入和退出 １９
2.6 本章小结 ２０
第3章 利用拓扑信息改进DHT ２１
3.1 引言 ２１
3.2 获取位置信息 ２１
3.2.1 分布式网络测量技术 ２１
3.2.2 IP地址蕴涵拓扑信息 ２２
3.3具有层次化标识符的DHT ２３
3.3.1 Chord6的设计 ２３
3.3.2 分析与仿真 ２５
3.3.3 小结和进一步讨论 ２７
3.4 内嵌式DHT ２８
3.4.1 eChord的设计 ２８
3.4.2 eChord的路由 ２９
3.4.3 节点的加入和退出 ３０
3.4.4 分析与仿真 ３０
3.4.5 小结和进一步讨论 ３２
3.5层次化DHT ３３
3.5.1 hChord的设计 ３３
3.5.2性能评估和进一步的讨论 ３６
3.5.3 结语和未来工作 ３７
3.6 本章小结 ３８
第4章 基于DHT的P2P系统设计与实现 ３９
4.1 FSS6 ３９
4.1.1 设计目标 ３９
4.1.2 系统结构 ３９
4.1.3 Chord6实现 ４０
4.1.4 智能节点设计 ４２
4.1.5 消息处理 ４３
4.2 相关的研究 ４４
4.2.1 CFS ４４
4.2.2 PAST ４４
4.2.3 OceanStore ４５
4 |
|
|
第1页 第2页 第3页 第4页 |
|
|
| 上一篇：缘何2008年亚洲货币成为投资热点下一篇：内容寻址网络性能的优化及内容的有效定
|
| 最新论文 |
最热门论文 |
|
|
|
|
|
