结构化P2P网络性能分析与搜索算法研究
|
摘要
近年来,对等网络(P2P)日益成为Internet上的一个重要应用。P2P网络中的每个节点既是内容提供者,又是内容消费者。结构化对等网络是扩展性高、容错性好的P2P网络,是当前的研究热点。基于分布式哈希表的结构化P2P网络利用DHT进行资源定位,它将网络中每个资源和节点哈希到同一个值空间,每个共享资源被发布到和自己资源标识符最接近的节点上。这种定位机制虽然有效地解决了非结构化对等网络中洪泛机制所带来的不可扩展问题,却不可避免地带来了另外的一些问题。这些问题主要是:(1)由于节点的频繁加入和离开所引起的路由表更新代价非常大;(2)哈希过程丢失了节点的物理位置信息,使得重叠网络中的邻居物理上可能相距很远,从而使得结构化P2P网络中的查找延迟增大;(3)在抖动率很高时,某些结构化P2P网络随着网络规模的扩大而性能急剧下降;(4)只支持从key到value的精确匹配,不支持多关键字搜索,搜索效率不高。
当前,结构化P2P网络的研究主要集中在对现有的DHT协议的直接改进上,很少通过对网络的性能进行分析而提出改进方案。这种方法存在着两个缺点,一是这种改进只针对某种DHT协议,如Tapestry,没有普遍意义;二是容易造成顾此失彼,如常量度数的DHT算法虽然降低了查询跳数,但对于节点的异常离开的处理能力较差,容错性能大大降低。为了更有效解决上述问题,有必要从路由表更新代价、查找延迟和抖动环境下的可扩展性等网络性能指标对典型结构化P2P网络的性能进行整体分析,进而提出改进算法和方案。从而提高结构化P2P网络的整体性能。
为了找出影响网络抖动的关键因素,首次提出了反向邻居节点的概念,即把自己作为邻居节点的节点,在此基础上,计算了六种DHT网络的反向邻居节点数。分析了影响抖动的路由方式、邻居选择、节点加入和节点离开以及并行查找等策略因素。发现对任意两种DHT网络,它们分别采用的五种策略都至少有两种不同,于是,对两种DHT网络直接进行比较就很难确定哪些策略能更有效地降低抖动。因此,提出在同一网络内,用不同的单个策略对网络抖动进行比较和分析的方法,称之为CSP。对现有的Pastry算法进行改进,构造了使用快速加入策略的F_Pastry算法和周期性恢复策略的P_Pastry算法。并分别把F_Pastry、P_Pastry和原有版本的慢速加入、反应性恢复算法进行了比较。还把使用迭代路由的Chord协议和使用递归路由的Chord协议进行了比较,得出以下结论:迭代路由、快速加入和周期性恢复策略和有效的邻居选择算法能更有效地降低网络的抖动。
研究发现,数据存放机制、路由方式、邻居选择和服务选择方式等,是影响结构化P2P网络查找延迟的关键因素。通过对一些典型结构化P2P网络查找延迟的比较和分析,提出了降低内容寻址网络节点间延迟的DCAN算法。该算法将内容寻址网络中的节点抽象成一个无向带权图,在此基础上,把Dijkstra算法求得的源节点到目的节点的最短路径作为路由。仿真实验表明,和路由过程中每次选择最小的下一跳的算法相比,DCAN算法能更有效地降低从源节点到目的节点的总延迟。
为了研究抖动环境下各种结构化P2P网络的可扩展性,提出了LBE评价方法。该方法把成功查找的时间延迟和查找失败率随网络规模的变化作为衡量可扩展性好坏的标准。随机改变DHT的各种参数,得到一系列查找延迟时间,把它们形成的最低线作为网络的整体性能指标。固定某一参数,但随机改变其它参数再进行仿真,从而得到最佳网络整体性能条件下的参数值。用上述方法对三种DHT协议的可扩展性进行了综合分析,并得出了相应的结论。
通过分析现有多关键字搜索算法的缺点,提出了ICCCS搜索算法,该算法在DHT协议层之上建立逻辑的关键字搜索层,搜索层采用改进的超立方体互联圈(Improved Cube-Connected Cycle)结构。通过向量空间模型选择每个对象的重要关键字,并将其映射到ICCC节点的环号,然后将描述对象的整个关键字集映射到ICCC节点的立方体标号。基于反向文档索引技术建立了索引算法,并使用生成树建立了搜索算法。实验结果表明,该算法对于关键字较少的查询有较高的查找精度和较低的查找延迟。
In recent years,peer-to-peer network has been widely used in the Internet.Each node on the peer-to-peer network is both a content provider and a content consumer. Because of high scalability and good fault-tolerance capabilitysstructured peer-to-peer network becomes current research hotspot.Which identifies and locates resources based on Distributed Hash Table(DHT),hashing resources and nodes to the same key space so that each resource is mapped to the node whose identifier is closest to its resource identifier.While this resource location mechanism effectively addresses the unscalability issue caused by flooding mechanism of unstructured P2P network,new problems emerge and remain unresolved as follows:1) the cost of updating the routing table increases significantly due to the frequent entering and exiting of the nodes;2)Since the information of the node physical location is lost during the hashing process,the physical distance between two neighboring nodes in the overlay network could be very large, thereby causing long query delay in structured P2P network.3)When the churn rate is high,some structured P2P networks's preference decrease sharply.4) the network only supports searches of precise key-value matching but does not support multi-key-words searches.
Prior researches on structured P2P network mainly focus on the improvement of DHT protocol in order to solve a specific problem,There are little to resolution based on performance analysis.The method has two weaknesses:At first,the improvement is aimed at a specific DHT protocol e.g.Tapestry,and may not be generalized.The second,the method fails to take a balanced approach,e.g.while the constant-degree DHT algorithm reduces the query hops,its poor ability of handling the abnormal departure of the nodes significantly decreases the fault-tolerance capability of the system.Therefore, to address the problems,the algorithm should be improved based on insights from a detailed analysis of typical structured P2P network focusing on the cost of routing table update,query delay and the scalability in a churn environment.
With regard to the churn issue,The concept of inverse-neighbourhood nodes is proposed.Which means the node is in their routing table.The number of inverse-neighbourhood nodes for six DHT netword is computed.we find that the most significant factors affecting churn is routing,neighboring nodes selection,bootstrapping,lookup parallely and recovery policy.In any two existing DHT,there are at least two kind of policy different.Therefore,the method that compares the routing tables update costs of two structured P2P network directly cann't decide which policy could deal with churn,so we proposes a new method of analysis:CSP(A comparation based on single policy),this method analyzed the relationship between routing tables update costs and each single policy.We create F Pastry which uses fast bootstrapping policy and P_Pasty which uses periodic recovery policy.F_Pastry and P_Pastry are compared with the original version Pastry separately.At the same time,I_Chord which uses iterative routing and R_Chord which use recursive routing are compared.It's concluded that iterative routing,fast bootstrapping,periodly recovery and effective neighboring nodes selection algorithm could decrease the consts of updating routing table in high churn.
The mechanisms of storing data,routing policy,neighboring nodes selection and sever-selection is the key factor which affect the query delay of tructured peer-to-peer networkBased on the analysis of the query delay and the weakness of the algorithm aimed at reducing the delay,the paper proposes a DCAN algorithm in order to reduce delay between the nodes in the Content-Addressable Network(CAN).This algorithm abstracts nodes of CAN network into a undirected weighted graph.By dijkstra algorithm,the shortest path from source node to destination node is obtained as the query routing.Simulation experiments suggest that this algorithm can reduce the delay between the source nodes and the target nodes in CAN effectively.
In order to address the scalability problem of the P2P network underthe condition of churn,a low-bandwidth evaluation(LBE) method is proposed.Which use the variation of delay for success query and percentage for failed query as the standard to evaluate scalability.A series of delay times are getted by changing DHT parameters randomly,The lowest line could be formed by so much points as the overall performance of DHT network.By fixing some parameter and changing other parameters,the optimal design parameter value could be obstained to get the best DHT network performance.We analyze the scalability of three DHT protocols from two respects:overall preference of the network and the change of optimal design parameters relative to the network scale,and get corresponding conclution.
Based on the analysis of the weakness of current multi-key-word search algorithm, the paper proposes an ICCCS(Improved Cube-Connected Cycle) search algorithm, which establishes a logical key-word search layer on top of the DHT protocol layer. The search layer is structured using the Improved Cube-Connected Cycle.The top keywords for each object is choosed by Vector Space Model and is mapped to the cyclic index of ICCC nodes.The whole keyword set for each object is mapped to the cubic index of ICCC nodes.The index scheme is build on Inverse Document Index and the search algorithm is created on Spanning Binomial Tree.Experiments suggest that the algorithm results in higher search precision and lower query delay for searches with fewer key words.
当前,结构化P2P网络的研究主要集中在对现有的DHT协议的直接改进上,很少通过对网络的性能进行分析而提出改进方案。这种方法存在着两个缺点,一是这种改进只针对某种DHT协议,如Tapestry,没有普遍意义;二是容易造成顾此失彼,如常量度数的DHT算法虽然降低了查询跳数,但对于节点的异常离开的处理能力较差,容错性能大大降低。为了更有效解决上述问题,有必要从路由表更新代价、查找延迟和抖动环境下的可扩展性等网络性能指标对典型结构化P2P网络的性能进行整体分析,进而提出改进算法和方案。从而提高结构化P2P网络的整体性能。
为了找出影响网络抖动的关键因素,首次提出了反向邻居节点的概念,即把自己作为邻居节点的节点,在此基础上,计算了六种DHT网络的反向邻居节点数。分析了影响抖动的路由方式、邻居选择、节点加入和节点离开以及并行查找等策略因素。发现对任意两种DHT网络,它们分别采用的五种策略都至少有两种不同,于是,对两种DHT网络直接进行比较就很难确定哪些策略能更有效地降低抖动。因此,提出在同一网络内,用不同的单个策略对网络抖动进行比较和分析的方法,称之为CSP。对现有的Pastry算法进行改进,构造了使用快速加入策略的F_Pastry算法和周期性恢复策略的P_Pastry算法。并分别把F_Pastry、P_Pastry和原有版本的慢速加入、反应性恢复算法进行了比较。还把使用迭代路由的Chord协议和使用递归路由的Chord协议进行了比较,得出以下结论:迭代路由、快速加入和周期性恢复策略和有效的邻居选择算法能更有效地降低网络的抖动。
研究发现,数据存放机制、路由方式、邻居选择和服务选择方式等,是影响结构化P2P网络查找延迟的关键因素。通过对一些典型结构化P2P网络查找延迟的比较和分析,提出了降低内容寻址网络节点间延迟的DCAN算法。该算法将内容寻址网络中的节点抽象成一个无向带权图,在此基础上,把Dijkstra算法求得的源节点到目的节点的最短路径作为路由。仿真实验表明,和路由过程中每次选择最小的下一跳的算法相比,DCAN算法能更有效地降低从源节点到目的节点的总延迟。
为了研究抖动环境下各种结构化P2P网络的可扩展性,提出了LBE评价方法。该方法把成功查找的时间延迟和查找失败率随网络规模的变化作为衡量可扩展性好坏的标准。随机改变DHT的各种参数,得到一系列查找延迟时间,把它们形成的最低线作为网络的整体性能指标。固定某一参数,但随机改变其它参数再进行仿真,从而得到最佳网络整体性能条件下的参数值。用上述方法对三种DHT协议的可扩展性进行了综合分析,并得出了相应的结论。
通过分析现有多关键字搜索算法的缺点,提出了ICCCS搜索算法,该算法在DHT协议层之上建立逻辑的关键字搜索层,搜索层采用改进的超立方体互联圈(Improved Cube-Connected Cycle)结构。通过向量空间模型选择每个对象的重要关键字,并将其映射到ICCC节点的环号,然后将描述对象的整个关键字集映射到ICCC节点的立方体标号。基于反向文档索引技术建立了索引算法,并使用生成树建立了搜索算法。实验结果表明,该算法对于关键字较少的查询有较高的查找精度和较低的查找延迟。
In recent years,peer-to-peer network has been widely used in the Internet.Each node on the peer-to-peer network is both a content provider and a content consumer. Because of high scalability and good fault-tolerance capabilitysstructured peer-to-peer network becomes current research hotspot.Which identifies and locates resources based on Distributed Hash Table(DHT),hashing resources and nodes to the same key space so that each resource is mapped to the node whose identifier is closest to its resource identifier.While this resource location mechanism effectively addresses the unscalability issue caused by flooding mechanism of unstructured P2P network,new problems emerge and remain unresolved as follows:1) the cost of updating the routing table increases significantly due to the frequent entering and exiting of the nodes;2)Since the information of the node physical location is lost during the hashing process,the physical distance between two neighboring nodes in the overlay network could be very large, thereby causing long query delay in structured P2P network.3)When the churn rate is high,some structured P2P networks's preference decrease sharply.4) the network only supports searches of precise key-value matching but does not support multi-key-words searches.
Prior researches on structured P2P network mainly focus on the improvement of DHT protocol in order to solve a specific problem,There are little to resolution based on performance analysis.The method has two weaknesses:At first,the improvement is aimed at a specific DHT protocol e.g.Tapestry,and may not be generalized.The second,the method fails to take a balanced approach,e.g.while the constant-degree DHT algorithm reduces the query hops,its poor ability of handling the abnormal departure of the nodes significantly decreases the fault-tolerance capability of the system.Therefore, to address the problems,the algorithm should be improved based on insights from a detailed analysis of typical structured P2P network focusing on the cost of routing table update,query delay and the scalability in a churn environment.
With regard to the churn issue,The concept of inverse-neighbourhood nodes is proposed.Which means the node is in their routing table.The number of inverse-neighbourhood nodes for six DHT netword is computed.we find that the most significant factors affecting churn is routing,neighboring nodes selection,bootstrapping,lookup parallely and recovery policy.In any two existing DHT,there are at least two kind of policy different.Therefore,the method that compares the routing tables update costs of two structured P2P network directly cann't decide which policy could deal with churn,so we proposes a new method of analysis:CSP(A comparation based on single policy),this method analyzed the relationship between routing tables update costs and each single policy.We create F Pastry which uses fast bootstrapping policy and P_Pasty which uses periodic recovery policy.F_Pastry and P_Pastry are compared with the original version Pastry separately.At the same time,I_Chord which uses iterative routing and R_Chord which use recursive routing are compared.It's concluded that iterative routing,fast bootstrapping,periodly recovery and effective neighboring nodes selection algorithm could decrease the consts of updating routing table in high churn.
The mechanisms of storing data,routing policy,neighboring nodes selection and sever-selection is the key factor which affect the query delay of tructured peer-to-peer networkBased on the analysis of the query delay and the weakness of the algorithm aimed at reducing the delay,the paper proposes a DCAN algorithm in order to reduce delay between the nodes in the Content-Addressable Network(CAN).This algorithm abstracts nodes of CAN network into a undirected weighted graph.By dijkstra algorithm,the shortest path from source node to destination node is obtained as the query routing.Simulation experiments suggest that this algorithm can reduce the delay between the source nodes and the target nodes in CAN effectively.
In order to address the scalability problem of the P2P network underthe condition of churn,a low-bandwidth evaluation(LBE) method is proposed.Which use the variation of delay for success query and percentage for failed query as the standard to evaluate scalability.A series of delay times are getted by changing DHT parameters randomly,The lowest line could be formed by so much points as the overall performance of DHT network.By fixing some parameter and changing other parameters,the optimal design parameter value could be obstained to get the best DHT network performance.We analyze the scalability of three DHT protocols from two respects:overall preference of the network and the change of optimal design parameters relative to the network scale,and get corresponding conclution.
Based on the analysis of the weakness of current multi-key-word search algorithm, the paper proposes an ICCCS(Improved Cube-Connected Cycle) search algorithm, which establishes a logical key-word search layer on top of the DHT protocol layer. The search layer is structured using the Improved Cube-Connected Cycle.The top keywords for each object is choosed by Vector Space Model and is mapped to the cyclic index of ICCC nodes.The whole keyword set for each object is mapped to the cubic index of ICCC nodes.The index scheme is build on Inverse Document Index and the search algorithm is created on Spanning Binomial Tree.Experiments suggest that the algorithm results in higher search precision and lower query delay for searches with fewer key words.
引文
[1] White W. D., Barad B. FidoNet technology applications. Bulletin of the American Society for Information Science, 1993, 19(4): 21-29
[2] Bush R. FidoNet: technology, tools, and history. Communications of the ACM, 1993,36(8): 123-128
[3] Napster: http: //www. napster. com
[4] Gnutella: http: //www. gnutella. com
[5] Ion Stoica, Robert Morris, David Karger, et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedingsof ACM SIGCOMM, August 2001. 149-160
[6] Sylvia Ratnasamy, Paul Francis, Mark Handley, et al. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, August 2001. 161-172
[7] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In IFIP/ACM Middleware, November 2001.329-350
[8] Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41-53
[9] Leibowitz N., Ripeanu M, Wierzbicki A. Deconstructing the Kazaa network, proceeding of the The Third IEEE Workshop on Internet Applications(WIAPP03), San Jose, CA, USA, 2003. 112-120
[10] Peter Maymounkov and David Mazieres. Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of the 1st IPTPS, March 2002. 53-65
[11]Dinger,Jochen Hartenstein,Hannes.Defending the sybil attack in P2P networks:Taxonomy,challenges,and a proposal for self-registration,the First International Conference on Availability,Reliability and Security,ARES 2006,Vienna,Austria,2006.109-117
[12]Malkhi D.,Naor M.,Ratajczak D..Viceroy:A scalable and dynamic emulation of t he butterfly.In:Proceedings of Principles of Dist ributed Computing(PODC 2002),Monterey,CA,2002.183-192
[13]Kaashoek M.F.,Karger R.Koorde:A simple degree optimaldistributed hash table.In:Proceedings of the 2nd International Workshop on P2P Systems(IPIPS'03),Berkeley,CA,2003.98-107
[14]Preparata F.P.,Vuillemin J.The cube-connected cycles:A versatile network for parallel computation.Communications of the ACM,1981,24(5):300-309
[15]C.Greg Plaxton,Rajmohan Rajaraman,and Andrea W.Richa.Accessing Nearby Copies of Replicated Objects in a Distributed Environment.In Proceedings of the ACM SPAA,June 1997.142-151
[16]Fraigniaud P,Gauron P.The Content-Addressable Network D2B.Tech Rept.1349,CNRS University paris-Sud,France,2003
[17]Pierre Fraigniaud,Philippe Gauron.D2B:a de Bruijn based content-addressable network.Theoretical Computer Science,2006,355(1):217-228
[18]李东升,卢锡城.P2P网络中常量度数常量拥塞的DHT方法研究.中国科学E 辑,2004,34(12):1337-1358
[19]F.Dabek,M.F.Kaashoek,D.Karger,et al.Wide-area cooperative storage with CFS.In SOSP,Oct.2001.149-161
[20]Sean Rhea,Chris Wells,Patrick Eaton,etal,Maintenance-Free Global Data Storage.IEEE Internet Computing,2002,5(5):40-49
[21]Rowstron,A.,And Druschel,P.Storage management and caching in PAST,a large-scale,persistent peer-to-peer storage utility.In Proc.of the 18th ACM SOSP, Oct. 2001. 256-267
[22] http: //www. bittorent. com
[23] eMule. http: //www. emule-project. net, 2005
[24] Frank Dabek, A Distributed Hash Table, MIT's thesis lib, 2005
[25] Fu K., Kaashoek, M. F., and Mazieres D. Fast and secure distributed read-only file system. In proceedings of the 4th USENIX Symposium on Operating Systems Design and Implementation OSDI 2000. 181-196
[26] B Bloom. Space/ time tradeoffs in hash coding with allowable errors Communications of the ACM, 1970, 13(7): 422-426
[27] M Mitzenmacher. Compressed bloom filters. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC2001) . Newport, Rhode, Island, 2001. 317-328
[28] M V Ramakrishna. Practical performance of bloom filters and parallel Free-text searching . Communications of the ACM, 1989, 32(10): 1237-1239
[29] http: //pier. cs. berkeley. edu/
[30] S. Ramabhadran, S. Ratnasamy, J. Hellerstein, and S. Shenker. Brief announcement: Prefix hash tree (extended abstract). In PODC, 2004. 368-368
[31] Fabian Staber, Gerald Kunzmann, Jorg P. Muller, Extended Prefix Hash Trees for a distributed phone book application, in the proceeding of the 13th International Conference on Parallel and Distributed Systems, Dec 2007. 1-8
[32] Heubsch R, Hellerstein J M, Lanham N, et al. Querying the Internet with PIER. Proc. of the 29th International Conference on Very Large Data Bases. San Fransisco: Morgan Kaufmann Publishers, 2003. 321-332
[33] A. Singhal. Modern Information Retrieval: A Brief Overview. IEEE Data Engineering Bulletin, 2001, 24(4): 35-43
[34] Alessandro Linari, Gerhard Weikum, Efficient Peer-to-Peer Semantic Overlay Networks based on Statistical Language Models, 2007 International Symposium on Communications and Information Technologies Proceedings(ISCIT 2007), Sydney, Australia, Oct 2007. 142-150
[35] Gleb Skobeltsyn, Toan Luu, PKarl Aberer, etal. Query-driven indexing for peer-to-peer text retrieval. Proceedings of the 16th international conference on World Wide Web, Banff, Alberta, Canada, May 2007. 223-242
[36] W. G. Yee, L. T. Nguyen, O. Frieder. Conjunction Dysfunction: The Weakness of Conjunctive Queries in Peer-to-Peer File-sharing Systems. In Proc. IEEE P2P, 2006. 110-118
[37] Performing efficient keyword search by keyword grouping in DHT peer-to-peer network in the proceeding of ISPA 2005 International Workshops, 2005. 17-26
[38] Li Yin, Ma Fanyuan, Zhang Liang. pKSS: An efficient keyword search system in DHT peer-to-peer network. LNCS, 2005, 3719. 112-117
[39] Zhang Liang, Zou Fu-Tai, Ma Fan-Yuan. KRBKSS: A keyword relationship based keyword-set search system for peer-to-peer networks. Journal of Zhejiang University: Science, 2005, 6(6): 577-582
[40] C. Tang and S. Dwarkadas. Hybrid global-local indexing for efficient peer-to-peer information retrieval. in Proceedings of the First Symposium on Networked Systems Design and Implementation (NSDI 2004). USENIX, 2004. 211-224
[41] Shi Shuming, Yang Guangwen, Wang Dingxing, et al. Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning, IPTPS 2004, La Jolla, CA, United States, 2004. 151-161
[42] C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003). ACM Press, 2003. 175-186
[43] Rostami, Habib Habibi, Jafar Rahnama, etal, Semantic HyperCup, in the Proceedings of the Annual Hawaii International Conference on System Sciences, 2006. 223-230
[44] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. HyperCuP: Hypercubes, ontologies and efficient search on P2P networks. in Proceedings of the 2002 International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2002), ser. Lecture Notes in Computer Science, vol. 2530. Springer-Verlag, 2003. 112-124
[45] Sean Rhea, Dennis Geels, Timothy Roscoe, et al. Handling churn in a DHT. Technical Report UCB//CSD-03-1299. University of California, Berkeley, December 2003
[46] Praveen Kumar, Sridhar G, Sridhar V. Bandwidth and Latency Model for DHT based Peer-to-Peer Networks under variable churn, Montreal, Que., Canada, 2005 System Communication, Aug 2005. 208-213
[47] Sean Rhea, Brighten Godfrey, Brad Karp, et al. OpenDHT: A public DHT service and its uses. In Proceedings of ACM SIGCOMM, August 2005. 110-121
[48] Rongmei Zhang, Hu, Y. C. , Druschel, P. , Optimizing routing in structured peer-to-peer overlay networks using routing table redundancy, Proceedings the Ninth IEEE Workshop on Future Trends of Distributed Computing Systems. FTDCS 2003. 315-321
[49] Ren Shansi, Guo Lei, Jiang, Song; etal, SAT-Match: A self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks, IPDPS 2004, Texas: IEEE Press, 2004. 1165-1173
[50] Hazarika S, Towsley D. Delay analysis of application level multicast on content addressable networks, Global Telecommunications Conference, 2004. (GLOBECOM '04). Texas: IEEE Press, 2004. 1271-1277
[51] Li Dongsheng, Cao Jiannong, Lu Xicheng, et al. Delay-bounded range queries in DHT-based peer-to-peer systems. 26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006, 2006. 64-70
[52] Jun Xu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks.In Proceedings of the 22nd Infocom,March 2003.221-229
[53]Mudhakar Srivatsa,Ling Liu,Vulnerabilities and Security Threats in Structured Peer-to-Peer Systems:A Quantitative Analysis,In the Proceedings of the 20th IEEE Annual Computer Security Applications Conference(ACSAC 2004),Tucson,Arizona,USA,2004.59-74
[54]Awerbuch,Baruch;Scheideler,Christian;Towards a Scalable and Robust DHT,the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures(SPAA 2006),Cambridge,MA,United States,2006.176-185
[55]Dinger,Jochen Hartenstein,Hannes.Defending the sybil attack in P2P networks:Taxonomy,challenges,and a proposal for self-registration,the First International Conference on Availability,Reliability and Security,ARES 2006,Vienna,Austria,2006.109-117
[56]Baruch Awerbuch,Christian Scheideler.Group Spreading:A Protocol for Provably Secure Distributed Name Service,ICALP2004,2004.232-243
[57]Fiat Amos,Saia Jared,Young Maxwell.Making Chord Robust to Byzantine Attacks.The 13th Annual European Symposium on Algorithms,ESA 2005,Palma de Mallorca,Spain,2005.259-293
[58]黄庆凤,李之棠,陆垂伟等.DHT抖动处理代价的分析.计算机研究与发展,2008(1):409-414
[59]黄庆凤,李之棠,柯华.一种新的降低内容寻址网络节点间延迟的方法.武汉大学学报(理学版),2007(1):563-566
[60]Huang Qingfeng,Li Zhitang,Zhang Yejing,et al.A Modified CCC for More Efficient Keyword Search in DHT-Based Peer-to-Peer Network,3rd International Conference on Semantics,Knowledge,and Grid,SKG 2007.462-466
[61]J.X.Parreira,S.Michel,and G.Weikum.P2PDating:Real life inspired semantic overlay networks for web search.In SIGIR workshop on Heterogeneous and Distributed Information Retrieval, Aug 2005. 176-182
[62] P. Kalnis, W. S. Ng, B. C. Ooi, and K. -L. Tan. Answering similarity queries in peer-to-peer networks. Inf. Syst, 2006, 31(1): 57-72
[63] ML Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Improving collection selection withoverlap awareness in P2P search engines. In SIGIR, 2005. 67-74
[64] J. Lu and J. Callan. User modeling for full-text federated search in peer-to-peer networks. In SIGIR, Aug 2006. 62-68
[65] Stutzbach D. , Rejaie R. , Improving lookup performance over a widely-deployed DHT. 25th IEEE INFOCOM Conference, Piscataway, NJ, USA, Apr 2006. 62-73
[66] C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003). ACM Press, 2003. 175-186
[67] Rostami, Habib Habibi, Jafar Rahnama, etal, Semantic HyperCup, in the Proceedings of the Annual Hawaii International Conference on System Sciences, 2006. 223-230
[68] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. HyperCuP: Hypercubes, ontologies and efficient search on P2P networks. in Proceedings of the 2002 International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2002), ser. Lecture Notes in Computer Science, vol. 2530. Springer-Verlag, 2003. 112-124
[69] Yuh-Jzer Joung, Li-Wei Yang, Chien-Tse Fang. Keyword search in DHT-based peer-to-peer networks, Selected Areas in Communications. IEEE Journal on, 2007, 25(1): 46-61
[70] C. Tang and S. Dwarkadas. Hybrid global-local indexing for efficient peer-to-peer information retrieval. in Proceedings of the First Symposium on Networked Systems Design and Implementation (NSDI 2004). USENIX, 2004. 211-224
[71] Omprakash, D. Gnawali. A Keyword-set Search System for Peer-to-Peer Networks. MIT's thesis Lib, 2002
[72] Jinyang Li, Jeremy Stribling, Robert Morris, et al. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proceedings of the 24th Infocom, Miami, FL, March 2005. 9-18
[73] Jinyang Li, Jeremy Stribling, Thomer Gil, et al. Comparing the performance of distributed hash tables under churn. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems, 2004. 123-135
[74] Prakash Linga, Indranil Gupta, Ken Birman. A churn-resistant peer-to-peer web caching system. Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems, Fairfax, VA, USA, Oct 2003. 82-89
[75] Di Wu, Ye Tian and KamWing Ng. An analytical study on optimizing the lookup performance of distributed hash table systems under churn. Concurrency Computation Practice and Experience, 2007, 19(4): 543-569
[76] P. Brighten Godfrey, Scott Shenker, Ion Stoica. Minimizing Churn in Distributed Systems. Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, 2006. 123-134
[77] Daniel Stutzbach, Reza Rejaie. Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeriro, Brazil, Oct 2006. 79-91
[78] Hung-Chang Hsiao, Chung-Ta King, Mobility churn in DHTs, 25th IEEE International Conference on Distributed Computing Systems Workshops, Jun 2005. 799-805
[79] Li Dongsheng, Cao Jiannong, Lu Xicheng, et al. Delay-bounded range queries in DHT-based peer-to-peer systems. 26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006, 2006. 64-70
[80] Frank Dabek, M. Frans Kaashoek, Jinyang Li, Robert Morris, James Robert-son, and Emil Sit.Designing a DHT for low latency and high throughput.In Proceedings of the 1st NSDI,March 2004.85-98
[81]林龙新,周杰,张凌.DOMulti:一种延迟优化的P2P应用层组播协议.华南理工大学学报(自然科学版),2007,35(9):78-84
[82]王传殊,王意洁.基于网络延迟的P2P路由算法的研究.计算机科学,2007,34(6):41-44
[83]王菁,杨寿保,郭磊涛等.基于延迟敏感的双向查询chord系统.小型微型计算机系统,2007,28(4):64-68
[84]Indranil Gupta,Ken Birman,Prakash Linga,etal,Kelips:Building an efficient and stable P2P DHT through increased memory and background overhead.In Proceedings of the 2nd IPTPS,2003.160-169
[85]M.Costa,M.Castro,A.Rowstron,and P.Key.PIC:Practical Internet coordinates for distance estimation.In Proceedings of the 24th International Conference on Distributed Computing Systems(ICDCS'04),Tokyo,Japan,2004.214-223
[86]L.Lehman.PCoord:A Decentralized Network Coordinate System for Internet Distance Prediction.PhD thesis,Massachusetts Institute of Technology,2005
[87]H.Lim,J.Hou,and C.-H.Choi.Constructing Internet coordinate system based on delay measurement.In Proceedings of Internet Measurement Conference(IMC'03),October 2003.189-197
[88]L.Lehman and S.Lerman.PALM:Predicting Internet network distances using peer-to-peer measurements.Technical report,appeared in Annual Singapore-MIT Alliance Sym,2003
[89]Z.Xu,C.Tang,and Z.Zhang.Building Topology-Aware Overlays using Global Soft-State.In ICDSC'2003,May 2003.47-57
[90]D Frank,C Russ,K Frans,et al.Vivaldi:A decentralized network coordinate system.IEEE SIGCOMM2005,Portland,USA,2005.236-248
[91]Krishna P.Gummadi,Stefan Saroiu,Steven D.Gribble.King:Estimating Latency between Arbitrary Internet End Hosts.Proceedings of the SIGCOMM Internet Measurement Workshop(IMW 2002).241-252
[92]P.Francis,S.Jamin,C.Jin,Y.Jin,D.Raz,Y.Shavitt,and L.Zhang.IDMAPS:a global Internet host distance estimation service.In IEEE/ACM Trans.on Networking,October 2001.174-181
[93]Nissanka B.Priyantha,Hari Balakrishnan,ErikDemaine.AnchorFree Distributed Localization in Sensor Networks.Technical Report TR-892,MIT LCS,2003.209-218
[94]胡迎松,郭守烈.一种层次式的低延迟Chord协议扩展算法.计算机工程与科学,2007,29(4):74-77
[95]Lua,Eng Keong,Securing Peer-to-Peer overlay networks from Sybil Attack,2007International Symposium on Communications and Information Technologies Proceedings,Sydney,Australia,Oct 2007.1213-1230
[96]Kristen Hildrum and John Kubiatowicz.Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks.In Proceedings of the 17th International Symposium on Distributed Computing,2004.241-252
[97]Moni Naor and Udi Wieder.A simple fault tolerant distributed hash table.In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS),2003.88-97
[98]Amos Fiat and Jared Saia.Censorship resistant peer-to-peer content addressable networks.In Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms(SODA),2002.92-101
[99]Castro M,Druschel P,Hu Y.Topology-aware routing in structured peer-to-peer overlay networks.Microsoft research technical report msrr,2002.82-89
[100]M.Castro,P.Druschel,Y.C.Hu,and A.Rowstron.Exploiting Network Proximity in Peer-to-Peer Overlay Networks.International Workshop on Future Directions in Distributed Computing(FuDiCo),Bertinoro,Italy,June,2002.224-230
[101] Gummadi, K. P., Gummadi, R., Gribble, S., et al. The impact of DHT routing geometry on resilience and proximity. In Proc. of the 2003 ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003. 214-225
[102] Overnet. http: //www. overnet. com
[103] Iyer, S., Rowstron, A., And Druschel, P. Squirrel: A decentralized, peer-to-peer web cache. In Proc. 21st Annual ACM Symposium on Principles of Distributed Computing (PODC02), July 2002. 214-226
[104] Cox, L. P., And Noble, B. D. Pastiche: making backup cheap and easy. In Proc. of the 5th OSDI, Dec. 2002. 143-149
[105] Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, et al. Distributed Object Location in a Dynamic Environment. In Proceedings of the ACM SPAA, 2002. 151-158
[106] Sushant Jain, Ratul Mahajan, David Wetherall. A Study of Performance Potential of DHT-based Overlays. In Proceedings of the 4th Usenix Symposium on Internet Technologies and Systems (USITS), Seattle, WA, USA, March 2003. 176-184
[107] David R. Karger and Matthias Ruhl. Finding Nearest Neighbours in Growth-restricted Metrics. In Proceedings of the ACM STOC, Montreal, May 2002. 165-172
[108] T. Ng and H. Zhang. A network positioning system for the Internet. In Proceedings of USENIX 2004 Annual Technical Conference, Boston, MA, June 2004. 141-154
[109] T. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of INFOCOM, 2002. 215-227
[110] M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for scalable distributed location. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems(IPTPS'03), Berkeley, CA, February 2003. 172-179
[111] Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in Euclidean space. In Proceedings of IEEE INFOCOM'03, Apr 2003. 356-367
[112] Li-wei Lehman, Steven Lerman. A Decentralized Network Coordinate System for Robust Internet Distance Prediction, Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06), 2006. 312-319
[113] M. Magennis and C. J. van Rijsbergen. The potential and actual effectiveness of interactive query expansion. in Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '97). ACM Press, 1997. 324-332
[114] M. Mitra, A. Singhal, and C. Buckley. Improving automatic query expansion. in Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR'98). ACM Press, 1998. 206-214
[115] S. Gauch, J. Wang, and S. M. Rachakonda. A corpus analysis approach for automatic query expansion and its extension to multiple databases. ACM Transactions on Information Systems, 1999, 17(3): 250-269
[116] Zhang Q, Sun Y, Liu Z, et al. Design of a P2P-based grid content management architecture. In: Iiow J, ed. Proc. Of the 3rd Communication Networks and Services Research Conf. New York: IEEE Press, 2005. 339-344
[117] Clarke I, Sandberg O, Wiley B, et al. Freenet: A distributed anonymous information storage and retrieval system. In: Federrath H, ed. Proc. of the Workshop on Design Issues in Anonymity and Unobservability. Berlin, 2001. 46-66
[118] G. W. Furnas, T. K. Landauer, L. M. Gomez, et al. The vocabulary problem in human-system communication. Communications of the ACM, 1987, 30(11): 964-971
[119] 陈贵海,须成忠,沈海英等. 一种新的常数度数的P2P覆盖网络. 计算机学报,2005,28(7): 1084-1095
[120] FOX, E. A. Extending the Boolean and vector space models of information retrieval with pnorm queries and multiple concept types. Ph. D. Dissertation, Department of Computer Science, Cornell University, Ithaca, NY, 1983
[121] Wenlei Mao, PWesley W. Chu. The phrase-based vector space model for automatic retrieval of free-text medical documents. Data & Knowledge Engineering, 2007, 61(1): 76-92
[122] Ilmerio R. Silva, Joao Nunes Souza, Karina S. Santos, Dependence Among Terms in Vector Space Model, in the Proceedings of the International Database Engineering and Applications Symposium, Massachusetts Ave., NW Washington, DC USA, Jul 2004. 97-102
[123] G. Salton, A. Wang, C. Yang. A vector space model for information retrieval, Journal of the American Society for Information Science, 1975, 18(1): 613-620
[124] I. Witten, A. Moffat, and T. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, second edition, 1999
[2] Bush R. FidoNet: technology, tools, and history. Communications of the ACM, 1993,36(8): 123-128
[3] Napster: http: //www. napster. com
[4] Gnutella: http: //www. gnutella. com
[5] Ion Stoica, Robert Morris, David Karger, et al. Chord: A scalable peer-to-peer lookup service for Internet applications. In Proceedingsof ACM SIGCOMM, August 2001. 149-160
[6] Sylvia Ratnasamy, Paul Francis, Mark Handley, et al. A scalable content-addressable network. In Proceedings of ACM SIGCOMM, August 2001. 161-172
[7] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems. In IFIP/ACM Middleware, November 2001.329-350
[8] Ben Y. Zhao, Ling Huang, Jeremy Stribling, et al. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 41-53
[9] Leibowitz N., Ripeanu M, Wierzbicki A. Deconstructing the Kazaa network, proceeding of the The Third IEEE Workshop on Internet Applications(WIAPP03), San Jose, CA, USA, 2003. 112-120
[10] Peter Maymounkov and David Mazieres. Kademlia: A peer-to-peer information system based on the XOR metric. In Proceedings of the 1st IPTPS, March 2002. 53-65
[11]Dinger,Jochen Hartenstein,Hannes.Defending the sybil attack in P2P networks:Taxonomy,challenges,and a proposal for self-registration,the First International Conference on Availability,Reliability and Security,ARES 2006,Vienna,Austria,2006.109-117
[12]Malkhi D.,Naor M.,Ratajczak D..Viceroy:A scalable and dynamic emulation of t he butterfly.In:Proceedings of Principles of Dist ributed Computing(PODC 2002),Monterey,CA,2002.183-192
[13]Kaashoek M.F.,Karger R.Koorde:A simple degree optimaldistributed hash table.In:Proceedings of the 2nd International Workshop on P2P Systems(IPIPS'03),Berkeley,CA,2003.98-107
[14]Preparata F.P.,Vuillemin J.The cube-connected cycles:A versatile network for parallel computation.Communications of the ACM,1981,24(5):300-309
[15]C.Greg Plaxton,Rajmohan Rajaraman,and Andrea W.Richa.Accessing Nearby Copies of Replicated Objects in a Distributed Environment.In Proceedings of the ACM SPAA,June 1997.142-151
[16]Fraigniaud P,Gauron P.The Content-Addressable Network D2B.Tech Rept.1349,CNRS University paris-Sud,France,2003
[17]Pierre Fraigniaud,Philippe Gauron.D2B:a de Bruijn based content-addressable network.Theoretical Computer Science,2006,355(1):217-228
[18]李东升,卢锡城.P2P网络中常量度数常量拥塞的DHT方法研究.中国科学E 辑,2004,34(12):1337-1358
[19]F.Dabek,M.F.Kaashoek,D.Karger,et al.Wide-area cooperative storage with CFS.In SOSP,Oct.2001.149-161
[20]Sean Rhea,Chris Wells,Patrick Eaton,etal,Maintenance-Free Global Data Storage.IEEE Internet Computing,2002,5(5):40-49
[21]Rowstron,A.,And Druschel,P.Storage management and caching in PAST,a large-scale,persistent peer-to-peer storage utility.In Proc.of the 18th ACM SOSP, Oct. 2001. 256-267
[22] http: //www. bittorent. com
[23] eMule. http: //www. emule-project. net, 2005
[24] Frank Dabek, A Distributed Hash Table, MIT's thesis lib, 2005
[25] Fu K., Kaashoek, M. F., and Mazieres D. Fast and secure distributed read-only file system. In proceedings of the 4th USENIX Symposium on Operating Systems Design and Implementation OSDI 2000. 181-196
[26] B Bloom. Space/ time tradeoffs in hash coding with allowable errors Communications of the ACM, 1970, 13(7): 422-426
[27] M Mitzenmacher. Compressed bloom filters. In Proceedings of the 20th ACM Symposium on Principles of Distributed Computing (PODC2001) . Newport, Rhode, Island, 2001. 317-328
[28] M V Ramakrishna. Practical performance of bloom filters and parallel Free-text searching . Communications of the ACM, 1989, 32(10): 1237-1239
[29] http: //pier. cs. berkeley. edu/
[30] S. Ramabhadran, S. Ratnasamy, J. Hellerstein, and S. Shenker. Brief announcement: Prefix hash tree (extended abstract). In PODC, 2004. 368-368
[31] Fabian Staber, Gerald Kunzmann, Jorg P. Muller, Extended Prefix Hash Trees for a distributed phone book application, in the proceeding of the 13th International Conference on Parallel and Distributed Systems, Dec 2007. 1-8
[32] Heubsch R, Hellerstein J M, Lanham N, et al. Querying the Internet with PIER. Proc. of the 29th International Conference on Very Large Data Bases. San Fransisco: Morgan Kaufmann Publishers, 2003. 321-332
[33] A. Singhal. Modern Information Retrieval: A Brief Overview. IEEE Data Engineering Bulletin, 2001, 24(4): 35-43
[34] Alessandro Linari, Gerhard Weikum, Efficient Peer-to-Peer Semantic Overlay Networks based on Statistical Language Models, 2007 International Symposium on Communications and Information Technologies Proceedings(ISCIT 2007), Sydney, Australia, Oct 2007. 142-150
[35] Gleb Skobeltsyn, Toan Luu, PKarl Aberer, etal. Query-driven indexing for peer-to-peer text retrieval. Proceedings of the 16th international conference on World Wide Web, Banff, Alberta, Canada, May 2007. 223-242
[36] W. G. Yee, L. T. Nguyen, O. Frieder. Conjunction Dysfunction: The Weakness of Conjunctive Queries in Peer-to-Peer File-sharing Systems. In Proc. IEEE P2P, 2006. 110-118
[37] Performing efficient keyword search by keyword grouping in DHT peer-to-peer network in the proceeding of ISPA 2005 International Workshops, 2005. 17-26
[38] Li Yin, Ma Fanyuan, Zhang Liang. pKSS: An efficient keyword search system in DHT peer-to-peer network. LNCS, 2005, 3719. 112-117
[39] Zhang Liang, Zou Fu-Tai, Ma Fan-Yuan. KRBKSS: A keyword relationship based keyword-set search system for peer-to-peer networks. Journal of Zhejiang University: Science, 2005, 6(6): 577-582
[40] C. Tang and S. Dwarkadas. Hybrid global-local indexing for efficient peer-to-peer information retrieval. in Proceedings of the First Symposium on Networked Systems Design and Implementation (NSDI 2004). USENIX, 2004. 211-224
[41] Shi Shuming, Yang Guangwen, Wang Dingxing, et al. Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning, IPTPS 2004, La Jolla, CA, United States, 2004. 151-161
[42] C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003). ACM Press, 2003. 175-186
[43] Rostami, Habib Habibi, Jafar Rahnama, etal, Semantic HyperCup, in the Proceedings of the Annual Hawaii International Conference on System Sciences, 2006. 223-230
[44] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. HyperCuP: Hypercubes, ontologies and efficient search on P2P networks. in Proceedings of the 2002 International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2002), ser. Lecture Notes in Computer Science, vol. 2530. Springer-Verlag, 2003. 112-124
[45] Sean Rhea, Dennis Geels, Timothy Roscoe, et al. Handling churn in a DHT. Technical Report UCB//CSD-03-1299. University of California, Berkeley, December 2003
[46] Praveen Kumar, Sridhar G, Sridhar V. Bandwidth and Latency Model for DHT based Peer-to-Peer Networks under variable churn, Montreal, Que., Canada, 2005 System Communication, Aug 2005. 208-213
[47] Sean Rhea, Brighten Godfrey, Brad Karp, et al. OpenDHT: A public DHT service and its uses. In Proceedings of ACM SIGCOMM, August 2005. 110-121
[48] Rongmei Zhang, Hu, Y. C. , Druschel, P. , Optimizing routing in structured peer-to-peer overlay networks using routing table redundancy, Proceedings the Ninth IEEE Workshop on Future Trends of Distributed Computing Systems. FTDCS 2003. 315-321
[49] Ren Shansi, Guo Lei, Jiang, Song; etal, SAT-Match: A self-adaptive topology matching method to achieve low lookup latency in structured P2P overlay networks, IPDPS 2004, Texas: IEEE Press, 2004. 1165-1173
[50] Hazarika S, Towsley D. Delay analysis of application level multicast on content addressable networks, Global Telecommunications Conference, 2004. (GLOBECOM '04). Texas: IEEE Press, 2004. 1271-1277
[51] Li Dongsheng, Cao Jiannong, Lu Xicheng, et al. Delay-bounded range queries in DHT-based peer-to-peer systems. 26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006, 2006. 64-70
[52] Jun Xu. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks.In Proceedings of the 22nd Infocom,March 2003.221-229
[53]Mudhakar Srivatsa,Ling Liu,Vulnerabilities and Security Threats in Structured Peer-to-Peer Systems:A Quantitative Analysis,In the Proceedings of the 20th IEEE Annual Computer Security Applications Conference(ACSAC 2004),Tucson,Arizona,USA,2004.59-74
[54]Awerbuch,Baruch;Scheideler,Christian;Towards a Scalable and Robust DHT,the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures(SPAA 2006),Cambridge,MA,United States,2006.176-185
[55]Dinger,Jochen Hartenstein,Hannes.Defending the sybil attack in P2P networks:Taxonomy,challenges,and a proposal for self-registration,the First International Conference on Availability,Reliability and Security,ARES 2006,Vienna,Austria,2006.109-117
[56]Baruch Awerbuch,Christian Scheideler.Group Spreading:A Protocol for Provably Secure Distributed Name Service,ICALP2004,2004.232-243
[57]Fiat Amos,Saia Jared,Young Maxwell.Making Chord Robust to Byzantine Attacks.The 13th Annual European Symposium on Algorithms,ESA 2005,Palma de Mallorca,Spain,2005.259-293
[58]黄庆凤,李之棠,陆垂伟等.DHT抖动处理代价的分析.计算机研究与发展,2008(1):409-414
[59]黄庆凤,李之棠,柯华.一种新的降低内容寻址网络节点间延迟的方法.武汉大学学报(理学版),2007(1):563-566
[60]Huang Qingfeng,Li Zhitang,Zhang Yejing,et al.A Modified CCC for More Efficient Keyword Search in DHT-Based Peer-to-Peer Network,3rd International Conference on Semantics,Knowledge,and Grid,SKG 2007.462-466
[61]J.X.Parreira,S.Michel,and G.Weikum.P2PDating:Real life inspired semantic overlay networks for web search.In SIGIR workshop on Heterogeneous and Distributed Information Retrieval, Aug 2005. 176-182
[62] P. Kalnis, W. S. Ng, B. C. Ooi, and K. -L. Tan. Answering similarity queries in peer-to-peer networks. Inf. Syst, 2006, 31(1): 57-72
[63] ML Bender, S. Michel, P. Triantafillou, G. Weikum, and C. Zimmer. Improving collection selection withoverlap awareness in P2P search engines. In SIGIR, 2005. 67-74
[64] J. Lu and J. Callan. User modeling for full-text federated search in peer-to-peer networks. In SIGIR, Aug 2006. 62-68
[65] Stutzbach D. , Rejaie R. , Improving lookup performance over a widely-deployed DHT. 25th IEEE INFOCOM Conference, Piscataway, NJ, USA, Apr 2006. 62-73
[66] C. Tang, Z. Xu, and S. Dwarkadas. Peer-to-peer information retrieval using self-organizing semantic overlay networks. in Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM 2003). ACM Press, 2003. 175-186
[67] Rostami, Habib Habibi, Jafar Rahnama, etal, Semantic HyperCup, in the Proceedings of the Annual Hawaii International Conference on System Sciences, 2006. 223-230
[68] M. Schlosser, M. Sintek, S. Decker, and W. Nejdl. HyperCuP: Hypercubes, ontologies and efficient search on P2P networks. in Proceedings of the 2002 International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2002), ser. Lecture Notes in Computer Science, vol. 2530. Springer-Verlag, 2003. 112-124
[69] Yuh-Jzer Joung, Li-Wei Yang, Chien-Tse Fang. Keyword search in DHT-based peer-to-peer networks, Selected Areas in Communications. IEEE Journal on, 2007, 25(1): 46-61
[70] C. Tang and S. Dwarkadas. Hybrid global-local indexing for efficient peer-to-peer information retrieval. in Proceedings of the First Symposium on Networked Systems Design and Implementation (NSDI 2004). USENIX, 2004. 211-224
[71] Omprakash, D. Gnawali. A Keyword-set Search System for Peer-to-Peer Networks. MIT's thesis Lib, 2002
[72] Jinyang Li, Jeremy Stribling, Robert Morris, et al. A performance vs. cost framework for evaluating DHT design tradeoffs under churn. In Proceedings of the 24th Infocom, Miami, FL, March 2005. 9-18
[73] Jinyang Li, Jeremy Stribling, Thomer Gil, et al. Comparing the performance of distributed hash tables under churn. In Proceedings of the 3rd International Workshop on Peer-to-Peer Systems, 2004. 123-135
[74] Prakash Linga, Indranil Gupta, Ken Birman. A churn-resistant peer-to-peer web caching system. Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems, Fairfax, VA, USA, Oct 2003. 82-89
[75] Di Wu, Ye Tian and KamWing Ng. An analytical study on optimizing the lookup performance of distributed hash table systems under churn. Concurrency Computation Practice and Experience, 2007, 19(4): 543-569
[76] P. Brighten Godfrey, Scott Shenker, Ion Stoica. Minimizing Churn in Distributed Systems. Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications, 2006. 123-134
[77] Daniel Stutzbach, Reza Rejaie. Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, Rio de Janeriro, Brazil, Oct 2006. 79-91
[78] Hung-Chang Hsiao, Chung-Ta King, Mobility churn in DHTs, 25th IEEE International Conference on Distributed Computing Systems Workshops, Jun 2005. 799-805
[79] Li Dongsheng, Cao Jiannong, Lu Xicheng, et al. Delay-bounded range queries in DHT-based peer-to-peer systems. 26th IEEE International Conference on Distributed Computing Systems, ICDCS 2006, 2006. 64-70
[80] Frank Dabek, M. Frans Kaashoek, Jinyang Li, Robert Morris, James Robert-son, and Emil Sit.Designing a DHT for low latency and high throughput.In Proceedings of the 1st NSDI,March 2004.85-98
[81]林龙新,周杰,张凌.DOMulti:一种延迟优化的P2P应用层组播协议.华南理工大学学报(自然科学版),2007,35(9):78-84
[82]王传殊,王意洁.基于网络延迟的P2P路由算法的研究.计算机科学,2007,34(6):41-44
[83]王菁,杨寿保,郭磊涛等.基于延迟敏感的双向查询chord系统.小型微型计算机系统,2007,28(4):64-68
[84]Indranil Gupta,Ken Birman,Prakash Linga,etal,Kelips:Building an efficient and stable P2P DHT through increased memory and background overhead.In Proceedings of the 2nd IPTPS,2003.160-169
[85]M.Costa,M.Castro,A.Rowstron,and P.Key.PIC:Practical Internet coordinates for distance estimation.In Proceedings of the 24th International Conference on Distributed Computing Systems(ICDCS'04),Tokyo,Japan,2004.214-223
[86]L.Lehman.PCoord:A Decentralized Network Coordinate System for Internet Distance Prediction.PhD thesis,Massachusetts Institute of Technology,2005
[87]H.Lim,J.Hou,and C.-H.Choi.Constructing Internet coordinate system based on delay measurement.In Proceedings of Internet Measurement Conference(IMC'03),October 2003.189-197
[88]L.Lehman and S.Lerman.PALM:Predicting Internet network distances using peer-to-peer measurements.Technical report,appeared in Annual Singapore-MIT Alliance Sym,2003
[89]Z.Xu,C.Tang,and Z.Zhang.Building Topology-Aware Overlays using Global Soft-State.In ICDSC'2003,May 2003.47-57
[90]D Frank,C Russ,K Frans,et al.Vivaldi:A decentralized network coordinate system.IEEE SIGCOMM2005,Portland,USA,2005.236-248
[91]Krishna P.Gummadi,Stefan Saroiu,Steven D.Gribble.King:Estimating Latency between Arbitrary Internet End Hosts.Proceedings of the SIGCOMM Internet Measurement Workshop(IMW 2002).241-252
[92]P.Francis,S.Jamin,C.Jin,Y.Jin,D.Raz,Y.Shavitt,and L.Zhang.IDMAPS:a global Internet host distance estimation service.In IEEE/ACM Trans.on Networking,October 2001.174-181
[93]Nissanka B.Priyantha,Hari Balakrishnan,ErikDemaine.AnchorFree Distributed Localization in Sensor Networks.Technical Report TR-892,MIT LCS,2003.209-218
[94]胡迎松,郭守烈.一种层次式的低延迟Chord协议扩展算法.计算机工程与科学,2007,29(4):74-77
[95]Lua,Eng Keong,Securing Peer-to-Peer overlay networks from Sybil Attack,2007International Symposium on Communications and Information Technologies Proceedings,Sydney,Australia,Oct 2007.1213-1230
[96]Kristen Hildrum and John Kubiatowicz.Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks.In Proceedings of the 17th International Symposium on Distributed Computing,2004.241-252
[97]Moni Naor and Udi Wieder.A simple fault tolerant distributed hash table.In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS),2003.88-97
[98]Amos Fiat and Jared Saia.Censorship resistant peer-to-peer content addressable networks.In Proceedings of the Thirteenth ACM Symposium on Discrete Algorithms(SODA),2002.92-101
[99]Castro M,Druschel P,Hu Y.Topology-aware routing in structured peer-to-peer overlay networks.Microsoft research technical report msrr,2002.82-89
[100]M.Castro,P.Druschel,Y.C.Hu,and A.Rowstron.Exploiting Network Proximity in Peer-to-Peer Overlay Networks.International Workshop on Future Directions in Distributed Computing(FuDiCo),Bertinoro,Italy,June,2002.224-230
[101] Gummadi, K. P., Gummadi, R., Gribble, S., et al. The impact of DHT routing geometry on resilience and proximity. In Proc. of the 2003 ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003. 214-225
[102] Overnet. http: //www. overnet. com
[103] Iyer, S., Rowstron, A., And Druschel, P. Squirrel: A decentralized, peer-to-peer web cache. In Proc. 21st Annual ACM Symposium on Principles of Distributed Computing (PODC02), July 2002. 214-226
[104] Cox, L. P., And Noble, B. D. Pastiche: making backup cheap and easy. In Proc. of the 5th OSDI, Dec. 2002. 143-149
[105] Kirsten Hildrum, John D. Kubiatowicz, Satish Rao, et al. Distributed Object Location in a Dynamic Environment. In Proceedings of the ACM SPAA, 2002. 151-158
[106] Sushant Jain, Ratul Mahajan, David Wetherall. A Study of Performance Potential of DHT-based Overlays. In Proceedings of the 4th Usenix Symposium on Internet Technologies and Systems (USITS), Seattle, WA, USA, March 2003. 176-184
[107] David R. Karger and Matthias Ruhl. Finding Nearest Neighbours in Growth-restricted Metrics. In Proceedings of the ACM STOC, Montreal, May 2002. 165-172
[108] T. Ng and H. Zhang. A network positioning system for the Internet. In Proceedings of USENIX 2004 Annual Technical Conference, Boston, MA, June 2004. 141-154
[109] T. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In Proceedings of INFOCOM, 2002. 215-227
[110] M. Pias, J. Crowcroft, S. Wilbur, T. Harris, and S. Bhatti. Lighthouses for scalable distributed location. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems(IPTPS'03), Berkeley, CA, February 2003. 172-179
[111] Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in Euclidean space. In Proceedings of IEEE INFOCOM'03, Apr 2003. 356-367
[112] Li-wei Lehman, Steven Lerman. A Decentralized Network Coordinate System for Robust Internet Distance Prediction, Proceedings of the Third International Conference on Information Technology: New Generations (ITNG'06), 2006. 312-319
[113] M. Magennis and C. J. van Rijsbergen. The potential and actual effectiveness of interactive query expansion. in Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR '97). ACM Press, 1997. 324-332
[114] M. Mitra, A. Singhal, and C. Buckley. Improving automatic query expansion. in Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval (SIGIR'98). ACM Press, 1998. 206-214
[115] S. Gauch, J. Wang, and S. M. Rachakonda. A corpus analysis approach for automatic query expansion and its extension to multiple databases. ACM Transactions on Information Systems, 1999, 17(3): 250-269
[116] Zhang Q, Sun Y, Liu Z, et al. Design of a P2P-based grid content management architecture. In: Iiow J, ed. Proc. Of the 3rd Communication Networks and Services Research Conf. New York: IEEE Press, 2005. 339-344
[117] Clarke I, Sandberg O, Wiley B, et al. Freenet: A distributed anonymous information storage and retrieval system. In: Federrath H, ed. Proc. of the Workshop on Design Issues in Anonymity and Unobservability. Berlin, 2001. 46-66
[118] G. W. Furnas, T. K. Landauer, L. M. Gomez, et al. The vocabulary problem in human-system communication. Communications of the ACM, 1987, 30(11): 964-971
[119] 陈贵海,须成忠,沈海英等. 一种新的常数度数的P2P覆盖网络. 计算机学报,2005,28(7): 1084-1095
[120] FOX, E. A. Extending the Boolean and vector space models of information retrieval with pnorm queries and multiple concept types. Ph. D. Dissertation, Department of Computer Science, Cornell University, Ithaca, NY, 1983
[121] Wenlei Mao, PWesley W. Chu. The phrase-based vector space model for automatic retrieval of free-text medical documents. Data & Knowledge Engineering, 2007, 61(1): 76-92
[122] Ilmerio R. Silva, Joao Nunes Souza, Karina S. Santos, Dependence Among Terms in Vector Space Model, in the Proceedings of the International Database Engineering and Applications Symposium, Massachusetts Ave., NW Washington, DC USA, Jul 2004. 97-102
[123] G. Salton, A. Wang, C. Yang. A vector space model for information retrieval, Journal of the American Society for Information Science, 1975, 18(1): 613-620
[124] I. Witten, A. Moffat, and T. Bell. Managing Gigabytes: Compressing and Indexing Documents and Images. Morgan Kaufmann, San Francisco, second edition, 1999