非结构化对等网络中的路由优化技术研究
|
摘要
非结构化对等网络(P2P:Peer to Peer)是目前对等计算应用领域最重要的网络模型之一。由于在非结构化P2P中,即没有中心索引,也没有对网络拓扑和文件位置的精确控制,发起查询的请求结点(Requester),多采用泛洪式路由向其逻辑邻居结点(Neighbor),广播查询请求。邻居结点收到请求后,如果能够满足该请求,就成为响应结点(Responder),返回查询结果;如果不能响应该请求,就成为转发结点(Relayer),采用与请求结点相同的方法继续向自己的邻居结点广播请求。该过程直至请求得以满足或者发生某些错误为止。研究表明,在适度连接的P2P网络中,使用盲目泛洪查询(BFS:Blind Flooding Search)算法会产生大量的查询消息,且70%以上都是冗余的。这些冗余消息占用网络带宽、消耗结点的处理时间,却对扩展查询范围毫无益处。因此,如何减轻泛洪引起的网络负担,同时保证一定的查询命中率,已经成为一个研究的热点。基于对上述问题的考虑,本文提出了自适应泛洪路由算法(AFRA:Adaptive Flooding Routing Algorithm)和基于主动推荐机制的近似索引算法(ARMBDAI:Active Recommendation Mechanism Based Distributed Approximate Indexing)。
本文提出的自适应泛洪路由算法结合了深度调整和广度调整。所谓深度调整,就是通过调整每条消息的生命期(TTL:Time to Live)来限制消息的传播范围。所谓广度调整,就是通过调整接收消息的邻结点数来减少消息的转发数量。现有文献虽然也提及广度调整和深度调整,但据我们所知,如何结合广度调整和深度调整,达到路由优化目的,还未见成熟方案。为此本文就相关问题进行了讨论,并详细阐述算法的原理和实现,最后通过仿真实验验证了算法的有效性。
本文提出的基于主动推荐机制的近似索引算法以面向服务的主动推荐机制为基础,在保留泛洪查询动态性好、可维护性高和可靠性强等优点的前提下,构建了一种由信誉评估代理和信息索引代理组成的两级代理结构。该结构有效地结合了查询和信誉两种机制,提高了查询的准确性和系统的可靠性。仿真实验验证了算法的有效性和对网络拓扑的优化。
In unstructured P2P systems, it is hard to find the desired files without distributing queries widely, since there is neither a centralized directory nor any precise control over the network topology or file placement. Flooding-based routing and search approach is widely used in unstructured P2P systems. In blind flooding, each peer sends query message to all of its neighbor peers, which in turn continuously forwarded to all neighbors. The query is executed hop-to-hop through the unstructured network until success, failure or timeout. By flooding the whole P2P network, many messages are generated. It is shown that more than 70% of the generated messages are redundant for a flooding with a fixed TTL (Time-to-Live) in a moderately connected network. These redundant messages consume bandwidth and waste processing power, but it is useless to enlarge the search range and improve the searching coverage. To address the above problems, many researchers have been studying how to reduce flooding radius while maintaining the satisfactory search quality.
In this dissertation, we propose a new routing and search algorithm, Adaptive Flooding Routing Algorithm (AFRA). AFRA combines depth adjustment and width adjustment. The depth adjustment is a method that reduces the number of routing messages by adjusting TTL value. The width adjustment means that a peer does not relay a query to all neighbors, but define the number of neighbors before forwarding the query. To our knowledge, although the existing documents have mentioned width adjustment and depth adjustment, there is no practical solution on how to combine width and depth adjustment to optimize search mechanisms. Experimental results show that our AFRA scheme can reduce flooding message by about 65% while maintaining the acceptable high search quality.
To address the severe performance limitation of flooding search mechanism, we propose an Active Recommendation Mechanism Based Distributed Approximate Indexing (ARMBDAI) method. Our scheme can work in high dynamic P2P networks and enable users to share valuable information with others. By Active Recommendation Mechanism (ARM), we build a two-tier proxy architecture consisting of reputation evaluating proxies and content indexing proxies. Based on ARM and the new architecture, we purpose a Distributed Approximate Indexing (DAI) method to support efficient search without the need for a single centralized index host. The effectiveness of DAI is demonstrated through simulation studies. Our experimental results show that DAI solution can improve search efficiency and optimize network topology.
本文提出的自适应泛洪路由算法结合了深度调整和广度调整。所谓深度调整,就是通过调整每条消息的生命期(TTL:Time to Live)来限制消息的传播范围。所谓广度调整,就是通过调整接收消息的邻结点数来减少消息的转发数量。现有文献虽然也提及广度调整和深度调整,但据我们所知,如何结合广度调整和深度调整,达到路由优化目的,还未见成熟方案。为此本文就相关问题进行了讨论,并详细阐述算法的原理和实现,最后通过仿真实验验证了算法的有效性。
本文提出的基于主动推荐机制的近似索引算法以面向服务的主动推荐机制为基础,在保留泛洪查询动态性好、可维护性高和可靠性强等优点的前提下,构建了一种由信誉评估代理和信息索引代理组成的两级代理结构。该结构有效地结合了查询和信誉两种机制,提高了查询的准确性和系统的可靠性。仿真实验验证了算法的有效性和对网络拓扑的优化。
In unstructured P2P systems, it is hard to find the desired files without distributing queries widely, since there is neither a centralized directory nor any precise control over the network topology or file placement. Flooding-based routing and search approach is widely used in unstructured P2P systems. In blind flooding, each peer sends query message to all of its neighbor peers, which in turn continuously forwarded to all neighbors. The query is executed hop-to-hop through the unstructured network until success, failure or timeout. By flooding the whole P2P network, many messages are generated. It is shown that more than 70% of the generated messages are redundant for a flooding with a fixed TTL (Time-to-Live) in a moderately connected network. These redundant messages consume bandwidth and waste processing power, but it is useless to enlarge the search range and improve the searching coverage. To address the above problems, many researchers have been studying how to reduce flooding radius while maintaining the satisfactory search quality.
In this dissertation, we propose a new routing and search algorithm, Adaptive Flooding Routing Algorithm (AFRA). AFRA combines depth adjustment and width adjustment. The depth adjustment is a method that reduces the number of routing messages by adjusting TTL value. The width adjustment means that a peer does not relay a query to all neighbors, but define the number of neighbors before forwarding the query. To our knowledge, although the existing documents have mentioned width adjustment and depth adjustment, there is no practical solution on how to combine width and depth adjustment to optimize search mechanisms. Experimental results show that our AFRA scheme can reduce flooding message by about 65% while maintaining the acceptable high search quality.
To address the severe performance limitation of flooding search mechanism, we propose an Active Recommendation Mechanism Based Distributed Approximate Indexing (ARMBDAI) method. Our scheme can work in high dynamic P2P networks and enable users to share valuable information with others. By Active Recommendation Mechanism (ARM), we build a two-tier proxy architecture consisting of reputation evaluating proxies and content indexing proxies. Based on ARM and the new architecture, we purpose a Distributed Approximate Indexing (DAI) method to support efficient search without the need for a single centralized index host. The effectiveness of DAI is demonstrated through simulation studies. Our experimental results show that DAI solution can improve search efficiency and optimize network topology.
引文
[ART02] Arturo Crespo, Hector Garcia-Molina, Routing Indices for Peer-to-Peer Systems, in Proc. of ICDCS, 2002
[BEV01] Beverly Yang, Hector Garcia-Molina, Comparing Hybrid Peer-to-Peer Systems, in Proc. of VLDB, 2001
[BEV02] Beverly Yang, Hector Garcia-Molina, Improving Search in Peer-to-Peer Networks, in Proc. of ICDCS, 2002
[BEV03] Beverly Yang, Hector Garcia-Molina, Designing a Super-Peer Network, in Proc. of ICDE, 2003
[BEV05] Beverly Yang, Tyson Condie, Sepandar Kamvar, Hector Garcia-Molina, Non-Cooperation in Competitive P2P Networks, in Proc. of ICDCS, 2005
[CLA00] Clarke I, Sandberg O, Wiley B and Hong T W., FreeNet: A Distributed Anonymous Information Storage and Retrieval System. In Proc. of ICSI, 2000
[DAV01] David Clark, Face-to-Face with Peer-to-Peer Networking, IEEE Computer Journal, 2001
[DAN05] Daniel Stutzbach and Reza Rejaie, Characterizing the Two-tier Gnutella Topology, in Proc. of ACM SIGMETRICS, 2005
[DUB03] Dublin, D. D. a. D. O. M. T. C., Overlay Networks A Scalable Alternative for P2P, IEEE Internet Computing Journal, 2003
[EDI02] Edith Cohen Scott Shenker, Replication Strategies in Unstructured Peer to Peer Networks, in Proc. of ACM SIGCOMM, 2002
[FAB04] Fabricio Benevenuto, J. e. I. J., Jussara Almeida, Quantitative Evaluation of Unstructured Peer-to-Peer Architectures, in Proc. of HOT-P2P, 2004
[FLE04] F. Le Fessant, S. Handurukande, A.-M. Kermarrec, and L. Massouli, Clustering in peer-to-peer file sharing workloads, in Proc. of IPTPS, 2004
[GOP01] Gopal Pandurangan, P. R., Eli Upfal, Building Low-Diameter P2P Networks, in Proc. of IEEE FOCS, 2001
[GNUTE] Gnutella, http://gnutella.wego.com
[IAN02] Ian Clarke, Scott G. Miller, Theodore W. Hong, Oskar Sandberg, Brandon Wiley, Protecting Free Expression Online with Freenet, IEEE Internet Computing Journal, 2002
[JIA03] Jian Yang, Yiping Zhong, Shiyong Zhang, An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks, in Proc. of ICCNMC, 2003
[JUA04] Juan Li, S. V., An Efficient Clustered Architecture for P2P Networks, in Proc. of AINA, 2004
[JOR01] Jordan Ritter, Why Gnutella can't scale. No, really. http://www.tch.org/gnutella.html
[KAZAA] KaZaA, http://www.kazaa.com
[KEN05] Kenichi Watanabe, N. H., Tomoya Enokido, Makoto Takizawa, Kane Kim, Acquaintance-based Protocol for Manipulating Multimedia Objects in Peer-to-Peer Overlay Networks, in Proc. of ISORC, 2005
[KRI03] Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, John Zahorjan, Measurement, modeling, and analysis of a peer-to-peer file-sharing workload, in Proc. of ACM SOSP, 2003
[KUN03] Kunwadee Sripanidkulchai, Bruce Maggs, Hui Zhang, Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems, in Proc. of IEEE INFOCOM, 2000
[KUM05] Kumar, A., Xu, J., Zegura, E.W., Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks, in Proc. of IEEE INFOCOM, 2005
[LIU04] Liu, L. M. N. a. Y., Efficient Peer-to-Peer Overlay Construction, in Proc. of IEEE CEC-East, 2004
[LIX05] Li Xiao, M., Yunhao Liu, and Lionel M. Ni, Fellow, Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment, IEEE Transactions on Computers, 2005
[LUO06a] Luo Jiaqing, Zhou Shijie, Adaptive Flooding Routing Algorithm in Unstructured P2P, in Proc. of IEEE ICCCAS, 2006
[LUO06b] Luo Jiaqing, Zhou Shijie, An Experimental Study of The Active Recommendation Mechanism Based Distributed Approximate Indexing in Unstructured P2P Networks, in Proc. of IEEE/WIC/ACM WI-IATW, 2006
[MAT02] Matei Ripeanu, Ian Foster and Adriana Iamnitchi, Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design, IEEE Internet Computing Journal, 2002
[MAY05] Mayank Bawa, Hector Garcia-Molina, Query processing with guarantees in query-centric networks, Doctoral Thesis, Stanford University, 2005, http://www-db.stanford.edu/~bawa/dissertation/bawa-qpde-05.pdf
[MIC05a] Mical Feldman, John Chuang, Overcoming Free-Riding Behavior in Peer-to-Peer Systems, ACM SIGecom Exchanges, 2005
[MIC05b] Michael Kleis, Eng Keong Lua, Xiaoming Zhou, Hierarchical Peer-to-Peer Networks using Lightweight SuperPeer Topologies, in Proc. of IEEE ISCC, 2005
[MIC06] Michele Amoretti, Francesco Zanichelli, Gianni Conte, Routing and spreading: Performance evaluation of advanced routing algorithms for unstructured peer-to-peer networks, in Proc. of VALUETOOLS, 2006
[MORPH] Morpheus, http://www.musiccity.com
[MUD04] Mudhakar Srivatsa, Bugra Gedik, Ling Liu, Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies, in Proc. of ICPADS, 2004
[MUD06] Mudhakar Srivatsa, Bugra Gedik, Ling Liu, Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing, in Proc. of IEEE TPDS, 2006
[NAB05] Nabhendra Bisnik, Alhussein Abouzeid, Modeling and Analysis of Random Walk Search Algorithms in P2P Networks, in Proc. of HOT-P2P, 2005
[PEERS] PeerSim, http://sourceforge.net/projects/peersim
[PTH03] P. Th. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, A.-M. Kermarrec, Lightweight probabilistic broadcast, in Proc. of ACM TOCS, 2003
[QIN01] Qin Lv, S. R., Scott Shenker, Can Heterogeneity Make Gnutella Scalable?, in Proc. of IPTPS, 2001
[QIN02] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker, Search and Replication in Unstructured Peer-to-Peer NetWorks, in Proc. of ACM ICS, 2002
[RIP 01] Ripeanu, M., Peer-to-Peer Architecture Case Study: Gnutella Network, in Proc. of IEEE P2P, 2001
[ROM02] Roman Kurmanowytsch, Mehdi Jazayeri, Engin Kirda, Towards a Hierarchical, Semantic Peer-to-Peer Topology, in Proc. of IEEE P2P, 2002
[RSC01] R. Schollmeier, A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications, in Proc. of P2P, 2001
[SER05]Sergio Marti, Trust and Reputation in Peer-to-Peer Networks, Doctoral Thesis, Stanford University, 2005, http://dbpubs.stanford.edu:8090/pub/2005-20
[SHA03] Shahabi, F. B.-K. a. C., Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as Complex Systems, in Proc. of CCGRID, 2003
[SON03a] Song Jiang and Xiaodong Zhang, FloodTrail: an Efficient File Search Technique in Unstructured Peer-to-Peer Systems, in Proc. of IEEE GLOBECOM, 2003
[SON03b]Song Jiang, Lei Guo and Xiaodong Zhang, LightFlood: an Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems, in Proc. of ICPP, 2003
[STE04] Stephanos Androutsellis-Theotokis, Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, in Proc. of ACM CSUR, 2004
[TSU03] Tsungnan Lin, Hsinping Wang, Search Performance Analysis in Peer-to-Peer Networks, in Proc. of IEEE P2P, 2003
[TSU04] Tsungnan Lin, Hsinping Wang, Jianming Wang, Search performance analysis and robust search algorithm in unstructured peer-to-peer networks, in Proc. of IEEE ISCCG, 2004
[VIC04] Vicent Cholvi Pascal Felber Ernst Biersack, Efficient Search in Unstructured Peer-to-Peer Networks, in Proc. of ACM SPAA, 2004
[VIT05] Vitaly Shmatikov, Carolyn Talcott, Reputation-based trust management, Journal of Computer Security, 2005
[YAT03] Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, Scott Shenker, Peer-to-peer: Making gnutella-like P2P systems scalable, in Proc. of SIGCOMM, 2003
[YIN06] Yinglin Sun, Liang Sun, Xiaohui Huang, Yu Lin, Resource discovery in locality-aware group-based semantic overlay of peer-to-peer networks, in Proc. of INFOSCALE, 2006
[YIH06] Yihong Tan, Yaping Lin, Zhiping Chen, Ting Dong, Research and Implementation on Routing Scheme Based on Interest Mining in Unstructured P2P Systems, in Proc. of WAIMW, 2006
[YUN05] Yunhao Liu, M., Li Xiao, Member, Xiaomei Liu, Lionel M. Ni, and Xiaodong Zhang, Location Awareness in Unstructured Peer-to-Peer Systems, in Proc. of IEEE TPDS, 2005
[ZHE03] Zhenyun Zhuang, Yunhao Liu, Li Xiao and Lionel M. Ni, Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks, in Proc. of ICPP, 2003
[ZHO06] Zhou Shijie,Qin Zhiguang. Interconnected Peer-to-Peer Network: A Community Based Scheme, in Proc. of ICIW, 2006
[罗 04] 罗杰文,Peer to Peer (P2P) 综述,中科院计算技术研究所,技术报告,2004
[周 04] 周世杰,对等计算中的分布式路由算法及其安全性研究,电子科技大学,博士学位论文,2004
[郑 05] 郑倩冰,非结构化对等系统的资源定位技术研究,国防科技大学,博士学位论文,2005
[BEV01] Beverly Yang, Hector Garcia-Molina, Comparing Hybrid Peer-to-Peer Systems, in Proc. of VLDB, 2001
[BEV02] Beverly Yang, Hector Garcia-Molina, Improving Search in Peer-to-Peer Networks, in Proc. of ICDCS, 2002
[BEV03] Beverly Yang, Hector Garcia-Molina, Designing a Super-Peer Network, in Proc. of ICDE, 2003
[BEV05] Beverly Yang, Tyson Condie, Sepandar Kamvar, Hector Garcia-Molina, Non-Cooperation in Competitive P2P Networks, in Proc. of ICDCS, 2005
[CLA00] Clarke I, Sandberg O, Wiley B and Hong T W., FreeNet: A Distributed Anonymous Information Storage and Retrieval System. In Proc. of ICSI, 2000
[DAV01] David Clark, Face-to-Face with Peer-to-Peer Networking, IEEE Computer Journal, 2001
[DAN05] Daniel Stutzbach and Reza Rejaie, Characterizing the Two-tier Gnutella Topology, in Proc. of ACM SIGMETRICS, 2005
[DUB03] Dublin, D. D. a. D. O. M. T. C., Overlay Networks A Scalable Alternative for P2P, IEEE Internet Computing Journal, 2003
[EDI02] Edith Cohen Scott Shenker, Replication Strategies in Unstructured Peer to Peer Networks, in Proc. of ACM SIGCOMM, 2002
[FAB04] Fabricio Benevenuto, J. e. I. J., Jussara Almeida, Quantitative Evaluation of Unstructured Peer-to-Peer Architectures, in Proc. of HOT-P2P, 2004
[FLE04] F. Le Fessant, S. Handurukande, A.-M. Kermarrec, and L. Massouli, Clustering in peer-to-peer file sharing workloads, in Proc. of IPTPS, 2004
[GOP01] Gopal Pandurangan, P. R., Eli Upfal, Building Low-Diameter P2P Networks, in Proc. of IEEE FOCS, 2001
[GNUTE] Gnutella, http://gnutella.wego.com
[IAN02] Ian Clarke, Scott G. Miller, Theodore W. Hong, Oskar Sandberg, Brandon Wiley, Protecting Free Expression Online with Freenet, IEEE Internet Computing Journal, 2002
[JIA03] Jian Yang, Yiping Zhong, Shiyong Zhang, An Efficient Interest-Group Based Search Mechanism in Unstructured Peer-to-Peer Networks, in Proc. of ICCNMC, 2003
[JUA04] Juan Li, S. V., An Efficient Clustered Architecture for P2P Networks, in Proc. of AINA, 2004
[JOR01] Jordan Ritter, Why Gnutella can't scale. No, really. http://www.tch.org/gnutella.html
[KAZAA] KaZaA, http://www.kazaa.com
[KEN05] Kenichi Watanabe, N. H., Tomoya Enokido, Makoto Takizawa, Kane Kim, Acquaintance-based Protocol for Manipulating Multimedia Objects in Peer-to-Peer Overlay Networks, in Proc. of ISORC, 2005
[KRI03] Krishna P. Gummadi, Richard J. Dunn, Stefan Saroiu, Steven D. Gribble, Henry M. Levy, John Zahorjan, Measurement, modeling, and analysis of a peer-to-peer file-sharing workload, in Proc. of ACM SOSP, 2003
[KUN03] Kunwadee Sripanidkulchai, Bruce Maggs, Hui Zhang, Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems, in Proc. of IEEE INFOCOM, 2000
[KUM05] Kumar, A., Xu, J., Zegura, E.W., Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks, in Proc. of IEEE INFOCOM, 2005
[LIU04] Liu, L. M. N. a. Y., Efficient Peer-to-Peer Overlay Construction, in Proc. of IEEE CEC-East, 2004
[LIX05] Li Xiao, M., Yunhao Liu, and Lionel M. Ni, Fellow, Improving Unstructured Peer-to-Peer Systems by Adaptive Connection Establishment, IEEE Transactions on Computers, 2005
[LUO06a] Luo Jiaqing, Zhou Shijie, Adaptive Flooding Routing Algorithm in Unstructured P2P, in Proc. of IEEE ICCCAS, 2006
[LUO06b] Luo Jiaqing, Zhou Shijie, An Experimental Study of The Active Recommendation Mechanism Based Distributed Approximate Indexing in Unstructured P2P Networks, in Proc. of IEEE/WIC/ACM WI-IATW, 2006
[MAT02] Matei Ripeanu, Ian Foster and Adriana Iamnitchi, Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design, IEEE Internet Computing Journal, 2002
[MAY05] Mayank Bawa, Hector Garcia-Molina, Query processing with guarantees in query-centric networks, Doctoral Thesis, Stanford University, 2005, http://www-db.stanford.edu/~bawa/dissertation/bawa-qpde-05.pdf
[MIC05a] Mical Feldman, John Chuang, Overcoming Free-Riding Behavior in Peer-to-Peer Systems, ACM SIGecom Exchanges, 2005
[MIC05b] Michael Kleis, Eng Keong Lua, Xiaoming Zhou, Hierarchical Peer-to-Peer Networks using Lightweight SuperPeer Topologies, in Proc. of IEEE ISCC, 2005
[MIC06] Michele Amoretti, Francesco Zanichelli, Gianni Conte, Routing and spreading: Performance evaluation of advanced routing algorithms for unstructured peer-to-peer networks, in Proc. of VALUETOOLS, 2006
[MORPH] Morpheus, http://www.musiccity.com
[MUD04] Mudhakar Srivatsa, Bugra Gedik, Ling Liu, Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies, in Proc. of ICPADS, 2004
[MUD06] Mudhakar Srivatsa, Bugra Gedik, Ling Liu, Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing, in Proc. of IEEE TPDS, 2006
[NAB05] Nabhendra Bisnik, Alhussein Abouzeid, Modeling and Analysis of Random Walk Search Algorithms in P2P Networks, in Proc. of HOT-P2P, 2005
[PEERS] PeerSim, http://sourceforge.net/projects/peersim
[PTH03] P. Th. Eugster, R. Guerraoui, S. B. Handurukande, P. Kouznetsov, A.-M. Kermarrec, Lightweight probabilistic broadcast, in Proc. of ACM TOCS, 2003
[QIN01] Qin Lv, S. R., Scott Shenker, Can Heterogeneity Make Gnutella Scalable?, in Proc. of IPTPS, 2001
[QIN02] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker, Search and Replication in Unstructured Peer-to-Peer NetWorks, in Proc. of ACM ICS, 2002
[RIP 01] Ripeanu, M., Peer-to-Peer Architecture Case Study: Gnutella Network, in Proc. of IEEE P2P, 2001
[ROM02] Roman Kurmanowytsch, Mehdi Jazayeri, Engin Kirda, Towards a Hierarchical, Semantic Peer-to-Peer Topology, in Proc. of IEEE P2P, 2002
[RSC01] R. Schollmeier, A Definition of Peer-to-Peer Networking for the Classification of Peer-to-Peer Architectures and Applications, in Proc. of P2P, 2001
[SER05]Sergio Marti, Trust and Reputation in Peer-to-Peer Networks, Doctoral Thesis, Stanford University, 2005, http://dbpubs.stanford.edu:8090/pub/2005-20
[SHA03] Shahabi, F. B.-K. a. C., Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as Complex Systems, in Proc. of CCGRID, 2003
[SON03a] Song Jiang and Xiaodong Zhang, FloodTrail: an Efficient File Search Technique in Unstructured Peer-to-Peer Systems, in Proc. of IEEE GLOBECOM, 2003
[SON03b]Song Jiang, Lei Guo and Xiaodong Zhang, LightFlood: an Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems, in Proc. of ICPP, 2003
[STE04] Stephanos Androutsellis-Theotokis, Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, in Proc. of ACM CSUR, 2004
[TSU03] Tsungnan Lin, Hsinping Wang, Search Performance Analysis in Peer-to-Peer Networks, in Proc. of IEEE P2P, 2003
[TSU04] Tsungnan Lin, Hsinping Wang, Jianming Wang, Search performance analysis and robust search algorithm in unstructured peer-to-peer networks, in Proc. of IEEE ISCCG, 2004
[VIC04] Vicent Cholvi Pascal Felber Ernst Biersack, Efficient Search in Unstructured Peer-to-Peer Networks, in Proc. of ACM SPAA, 2004
[VIT05] Vitaly Shmatikov, Carolyn Talcott, Reputation-based trust management, Journal of Computer Security, 2005
[YAT03] Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, Scott Shenker, Peer-to-peer: Making gnutella-like P2P systems scalable, in Proc. of SIGCOMM, 2003
[YIN06] Yinglin Sun, Liang Sun, Xiaohui Huang, Yu Lin, Resource discovery in locality-aware group-based semantic overlay of peer-to-peer networks, in Proc. of INFOSCALE, 2006
[YIH06] Yihong Tan, Yaping Lin, Zhiping Chen, Ting Dong, Research and Implementation on Routing Scheme Based on Interest Mining in Unstructured P2P Systems, in Proc. of WAIMW, 2006
[YUN05] Yunhao Liu, M., Li Xiao, Member, Xiaomei Liu, Lionel M. Ni, and Xiaodong Zhang, Location Awareness in Unstructured Peer-to-Peer Systems, in Proc. of IEEE TPDS, 2005
[ZHE03] Zhenyun Zhuang, Yunhao Liu, Li Xiao and Lionel M. Ni, Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks, in Proc. of ICPP, 2003
[ZHO06] Zhou Shijie,Qin Zhiguang. Interconnected Peer-to-Peer Network: A Community Based Scheme, in Proc. of ICIW, 2006
[罗 04] 罗杰文,Peer to Peer (P2P) 综述,中科院计算技术研究所,技术报告,2004
[周 04] 周世杰,对等计算中的分布式路由算法及其安全性研究,电子科技大学,博士学位论文,2004
[郑 05] 郑倩冰,非结构化对等系统的资源定位技术研究,国防科技大学,博士学位论文,2005