【CAN算法介绍】

最新推荐文章于 2024-05-31 20:45:00 发布

lijieshare

最新推荐文章于 2024-05-31 20:45:00 发布

阅读量1.4k

点赞数

分类专栏：算法研究--排序算法研究--查找文章标签：【CAN算法介绍】

CAN（内容寻址网络）是一种分布式、去中心化的P2P基础设施，类似于互联网规模的哈希表功能。节点通过维护路由表进行消息定向，节点加入时需找到现有节点，识别可分裂的区域，并更新邻居节点的路由表。节点离开时，其区域由相邻节点合并或接管，同时更新整个网络的路由表。

摘要由CSDN通过智能技术生成

一、CAN介绍

The Content Addressable Network (CAN) is a distributed, decentralized P2P infrastructure that provides hash table functionality on an Internet-like scale. CAN was one of the original four distributed hash table proposals, introduced concurrently with Chord, Pastry, and Tapestry.

Like other distributed hash tables, CAN is designed to be scalable, fault tolerant, and self-organizing. The architectural design is a virtual multi-dimensional Cartesian coordinate space, a type of overlay network, on a multi-torus. This n-dimensional coordinate space is a virtual logical address, completely