Computer Science ›› 2014, Vol. 41 ›› Issue (12): 57-59.doi: 10.11896/j.issn.1002-137X.2014.12.013

Previous Articles     Next Articles

Efficient Lookup Method Based on Highly Available Peers in KAD

YAN He,LIU Wei,ZHANG Ge and CHENG Wen-qing   

  • Online:2018-11-14 Published:2018-11-14

Abstract: The lookup performance in KAD is affected by the dynamics of peer participation.By studying the KAD routing mechanism,we found the times of ID appearance in routing tables can be the measurement of the peer availability.Based on the highly available peers,we proposed a new lookup method for KAD peers.At first,the KAD routing information is collected by a crawler.Then the highly available peers are selected as the lookup candidates.Experiment results show that,compared with the existed lookup scheme,our method can reduce 60% of average lookup time and obtain 18% more files in lookup results.

Key words: Peer-to-Peer network,KAD,Highly available peers,Lookup performance

[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!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!