计算机科学 ›› 2014, Vol. 41 ›› Issue (12): 57-59.doi: 10.11896/j.issn.1002-137X.2014.12.013
严鹤,刘威,张戈,程文青
YAN He,LIU Wei,ZHANG Ge and CHENG Wen-qing
摘要: KAD网络的查询性能受到P2P节点动态特性的影响。以节点ID在路由表中重复出现的次数作为节点活跃度的表征,提出了一种基于活跃节点的KAD网络查询方法。该方法首先通过网络爬虫获取KAD网络的分布式路由信息,然后获取当前活跃节点的集合,最后将活跃节点作为查询过程中的备选节点。实验结果表明,与现有的查询方法相比,该方法在查询时间上减少了60%,在获取文件范围上提高了18%,较显著地提升了查询的效率。
[1] 刘丹,谢文君.一种面向 P2P空间查询的路由恢复方法[J].计算机科学,2013,9(12):47-50 [2] Steiner M,Carra D,Biersack E.Faster content access in KAD[C]∥IEEE P2P.2008:195-204 [3] Xin Q,Schwarz T,Miller E L.Availability in global peer-to-peer storage systems[C]∥ International Workshop on Distributed Data & Structure (WDAS).2004 [4] Douceur J R.Is remote host availability governed by a universal law?[J].ACM SIGMETRICS Performance Evaluation Review,2003,31(3):25-29 [5] Zhang Y,Xiao C,Zhang H.Analysis of session sequences of stable peers in P2P systems[C]∥2013 3rd IEEE International Conference on Broadband Network and Multimedia Technology(IC-BNMT).2010:1005-1009 [6] Steiner M,En-Najjary T,Biersack E W.Long term study of peer behavior in the KAD DHT [J].IEEE/ACM Transactions on Networking,2009,17(5):1371-1384 [7] Yu J,Fang C,Xu J,et al.ID repetition in Kad[C]∥ IEEE P2P.2009:111-120 [8] Maymounkov P,Mazi`eres D.Kademlia:A peer-to-peer information system based on the XOR metric[C]∥First International Workshop on Peer-to-Peer Systems (IPTPS).2002:53-65 |
No related articles found! |
|