共被期刊论文引用了2次
您的检索式：您选中1篇文献正在查看引证文献汇总
|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | 基于路由注入的快速DHT网络资源发现方法显示文摘为提高抓取海量DHT节点上的网络资源效率,提出一种基于路由注入的DHT网络爬虫方法。结合Kademlia算法的特点,针对路由表各区间计算查询目标ID,获取已知节点保存的所有节点信息,提高遍历节点的速度;在与网络节点交互的过程中,生成适应已知节点路由表的爬虫节点ID,达到注入对方路由表的目的;实现持续地抓取对方节点的资源。实验结果表明,该方法既找到了路由表的最佳注入区间,提高了注入成功率,使得获取DHT网络资源的效率提高,并在Btbook网站中得到成功应用。 | 耿焕同 陈华 李辉健 | 2016 | 计算机工程与设计2016，37，2： | 1 |
| 2 | Optimizing Bloom Filter Settings for Multi-keyword Search in Kademlia-like DHT Peer-to-Peer Networks显示文摘This paper has proposed a novel method to reduce the multi-keyword query traffic in Kademlia-like Peer-to-peer(P2P) networks by optimizing the Bloom filter settings. We build some models to estimate the communication cost, the union set size, and the loss rate of performing union and intersection operations. We implement a Kademlia-like system and generate a group of datasets.We use one part of the datasets to obtain the functions how to compute the optimal parameters and use another part of datasets to verify our method. Each query can determine the optimal settings of Bloom filter with no extra configuration. Our simulation experimental results show that with optimal Bloom filters settings, we can greatly reduce the communication cost under an acceptable loss rate. | MA Wenming ZHANG Yujie MENG Xiangwu | 2014 | Chinese Journal of Electronics2014，23，2： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员