没有合适的资源？快使用搜索试试~ 我知道了~

文库首页开发技术其它分层chord的实现及应用

分层chord的实现及应用

chord

需积分: 16 9 下载量 145 浏览量 2010-05-10 10:23:18 上传评论收藏 1.17MB PDF 举报

温馨提示

试读

31页

层次性chord模型的组织方式及合并算法的实现细节，chord协议的深层理解。

资源推荐

资源详情

资源评论

CRESCENDO

GEORGE S. NOMIKOS

Advisor: Dr. George Xylomenos

ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS

DEPARTMENT OF INFORMATICS

MSc IN COMPUTER SCIENCE

Implementation of Hierarchical Chord (Crescendo), according to

Canon paradigm and evaluation, via simulation over realistic network

topologies, of the Crescendo's advantages in comparison to Chord.

ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS

Motivation

●

All current DHTs are “Flat”, non-hierarchical structures.

●

No single point of failure, homogeneity.

●

Decentralization, Scalability.

●

Why Hierarchical Design?

●

Hierarchies exist! Physical Network has hierarchy.

●

Fault Isolation, Security.

●

Efficient caching and bandwidth usage.

●

Adaptation to the underlying physical network.

●

Hierarchical storage of content.

●

Hierarchical access control.

●

Goal: Inherit the best of both designs Hierarchical DHTs.

Motivation

●

Hierarchical DHTs

●

Maintain all the advantages of flat DHTs and add

even more.

●

Simulators offering hierarchical DHT support

●

None of the current simulators offer hierarchical

DHT support. No other module exists.

●

This is the first and the only hierarchical DHT

implementation available. Implemented for the

simulation environment OMNeT++/OverSim.

Chord

●

Hash function (SHA-1) assigns each node and key an m-bit identifier.

●

Node keys are arranged in a circle.

●

Each node:

●

Has links to it's previous node (predecessor) and to it's next node (successor).

●

Maintains a routing table with up to m entries called the finger table.

●

Runs a stabilization protocol periodically to find newly joined and failed nodes.

●

Responsible node for a key, is the successor of the key.

●

Finger table contains records like the following:

●

finger[k] = first node that succeeds (n + 2

k-1

) mod 2

where 1 ≤ k ≤ m, n is the current node.

●

Example Chord Ring

●

10 Nodes, 5 Keys

●

m = 6 bits

Canon

Networks are hierarchical

Canon adapts to the underlying network hierarchy

●

Canon Paradigm

●

Recursive Structure.

●

Construct bottom-up.

●

Merge smaller DHTs.

●

Multi-level hierarchies.

●

A global ring at the top level

containing all the small rings.

剩余30页未读，继续阅读

评论收藏

内容反馈

资源评论

资源反馈

评论星级较低，若资源使用遇到问题可联系上传者，3个工作日内问题未解决可申请退款~

yuanandwang

粉丝: 2
资源: 2

上传资源快速赚钱

我的内容管理展开

我的资源快来上传第一个资源

我的收益

登录查看自己的收益

我的积分登录查看自己的积分

我的C币登录后查看C币余额

我的收藏

我的下载

下载帮助

前往需求广场，查看用户热搜

分层chord的实现及应用

基于．net类结构的WEB应用分层设计与实现 (2005年)

论文研究-一种基于分层策略的移动应用商店主题爬虫的研究与实现 .pdf

Chord算法在对等网络中的应用研究

Chord算法实现

论文研究-基于分类分层的chord优化算法 .pdf

论文研究-一种分层分簇的应用层组播方案.pdf

DHT算法的实现，学习chord好材料

Chord算法性能及优化策略分析

P_Chord 基于分区的Chord 路由模型

Chord 0.1 实现分析

chord的阅读汇报

基于chord协议的分布式文件系统的设计与实现.pdf

chord-0.1实现代码

关于chord的论文

chord算法ppt详解

基于Chord的应用层组播研究

c语言编写的chord源代码

chord算法演示源代码

论文研究-支持串模糊匹配的Chord扩展资源索引模型.pdf

chord:Chord协议的实现

Qt 5实现串口调试助手 （源工程文件、0积分下载）

【SystemVerilog】路科验证V2学习笔记（全600页）.pdf

AutoSAR标准协议4.2.2

光伏-储能并网系统仿真.rar

XCP协议的规范文档

GD32替换STM32注意事项.pdf

NPPJSONViewer.zip

CANoe通过CAPL脚本实现自动测试

蓝牙BLE协议中文版.pdf

最新资源

Qt 5实现串口调试助手（源工程文件、0积分下载）