DBCAN：一种基于de Bruijn图的高效P2P模型  

DBCAN:An Efficient P2P Model Based on de Bruijn Graph

作　　者：毕海波[1] BI Hai-bo(Urumqi Central Sub Branch of the People's Bank of China,Urumqi 830002)

机构地区：[1]中国人民银行乌鲁木齐中心支行

出　　处：《现代计算机》2020年第1期16-20,共5页Modern Computer

摘　　要：DBCAN是一种基于de Bruijn图的结构化P2P网络路由模型,采用de Bruijn图作为P2P覆盖网络拓扑结构,网络中的每个节点都负责维护虚拟2维笛卡尔坐标空间中的一块区域,实现数据命名与分布、节点邻居关系、路由算法、数据的发布等。实验仿真表明,该路由模型的节点度、负载均衡和路由路径长度等性能均优于CAN、Koorde等结构化路由模型。DBCAN is a structured P2P network routing model based on de Bruijn graph,adopting de Bruijn graph by way of P2P overlay topology structure,every node of network with responsibility for maintaining an area of virtual 2-dimension Descartes coordinate space,accomplish⁃ing model’s naming and distributing of data,neighbor relation of node,routing arithmetic,issuance of data.Experimental simulation shows that,the performance of this routing model,such as node degree,load balance and routing path length,is better than that of CAN,Koorde and other structured routing models.

关 键 词：路由 定位 分布式哈希表 de Bruijn图 

分 类 号：O157.5[理学—数学]