摘要
基于分布式哈希表(DHT)的P2P查找经常受到在底层网络中路由时无必要的路径长度增加的影响。另外,DHT在处理复制方面也有一定的缺陷。提出了距离加权Bloom Filter(dwBF),详细地阐述了在资源分散的覆盖网络中使用距离加权Bloom Filter网络路由算法。
Today＇s DHT-based P2P lookups always suffer from unnecessarily long routers in the underlay network. Another problem with DHT is its ineffectiveness in replica-handle. In this paper, we use Bloom Filters for resource routing. We introduce distance-weighted Bloom Filters （dwBFs） as a concise representation of routing information for scattered resources in overlay networks. This paper also describes an efficient routing algorithm base on dwBFs.
出处
《微电子学与计算机》
CSCD
北大核心
2007年第5期73-75,79,共4页
Microelectronics & Computer
