| 基于距离加权Bloom filter的网络路由算法 |
| |
| 引用本文： | 段迅,李坚石,清水敬司. 基于距离加权Bloom filter的网络路由算法[J]. 海军工程大学学报, 2006, 18(4): 80-83 |
| |
| 作者姓名： | 段迅 李坚石 清水敬司 |
| |
| 作者单位： | 1. 贵州大学,计算机科学与技术学院,贵州,贵阳,550025
2. 日本NTT未来网络研究所,横须贺,239-0847 |
| |
| 基金项目： | 国家自然科学基金 , 贵州省国际科技合作计划 |
| |
| 摘 要： | 基于分布式哈希表(DHT)的P2P查找经常受到在底层网络中路由时无必要的路径长度增加的影响.另外,DHT在处理复制方面也有一定的缺陷.文中探讨了解决这些问题的方法.对使用Bloom filters作为资源路由的方法做了简要回顾,并较为详细地阐述了在资源分散的覆盖网络中使用距离加权Bloom filter的网络路由算法.对该算法进行了仿真测试,证明了其有效性.
|
| 关 键 词： | Bloom filters 分布式哈希表(DHT) 覆盖网络 距离加权Bloom filter (dwBF) |
| 文章编号： | 1009-3486(2006)04-0080-04 |
| 修稿时间： | 2006-01-20 |
Routing algorithm based on distance-weighted Bloom filter |
| |
| DUAN Xun,LI Jian-shi,SHIMIZU Takashi. Routing algorithm based on distance-weighted Bloom filter[J]. Journal of Naval University of Engineering, 2006, 18(4): 80-83 |
| |
| Authors: | DUAN Xun LI Jian-shi SHIMIZU Takashi |
| |
| Abstract: | The DHT-based P2P lookup always suffers from unnecessarily long routers in the underlay network though it is very popular in the research community.Another problem with DHT is its ineffectiveness in replica-handling.In order to solve the above problems,the method to use Bloom filters as the resource routing was briefly introduced,and the distance-weighted Bloom filters(dwBFs) as a concise representation of routing information for scattered resources in overlay networks was detailedly explained,and a routing algorithm based on the dwBFs was also described.Meanwhile a simulation experiment was given to show its effectiveness. |
| |
| Keywords: | Bloom filters distributed hash table(DHT) overlay network distance-weighted Bloom filter(dwBF) |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
