P2P覆盖网拓扑优化技术研究
|
摘要
P2P计算是近年来兴起的一种重要的网络计算技术,它不依赖中心服务器,而是利用所有参与节点的计算能力和网络带宽构建的应用体系,具有鲁棒性好,可扩展性强,易于部署等特点。目前,P2P计算已经发展成Internet上最重要的应用模式之一,并成为近年来的研究热点。
P2P覆盖网拓扑的特性是影响P2P系统服务质量的关键因素。首先,P2P系统具有强动态性,为保证应用稳定可靠,不会因节点的随意离开导致系统崩溃或服务质量明显下降,要求覆盖网拓扑具有良好的弹性,没有明显的缺陷。其次,资源搜索是P2P系统中最重要的操作,提高资源搜索效率能够显著改善系统的性能和可扩展性,而覆盖网的拓扑结构对资源搜索具有全方位的影响,拓扑优化是提高搜索效率的主要手段之一。因此,本文以提高系统可靠性和资源搜索效率为目标,对P2P环境下拓扑优化技术进行了深入研究。本文贡献如下:
提出了一种P2P环境下被动式分布式割点发现算法,该算法仅依靠局部信息,可使P2P覆盖网中的每个节点自主判断自己是否为割点,并采取相应措施来消除对覆盖网连通性的危害。通过理论分析和模拟实验证明,该算法具有准确率高、开销低、自适应性强等优点。在静态网络中,它能够发现所有的割点,且普通节点被误判为割点的几率极低。在动态环境下,也能获得非常高的准确率。
提出了一种P2P环境下分布式点割集发现和消除算法。该算法通过节点巧妙地计算其邻居间点不相交道路的情况,判定自己是否是割点或发现其所属的2点割,并采取修补措施来消除其对覆盖网的不利影响。实验证明,该算法准确率高,割集消除对提高覆盖网可靠性的效果显著。
提出了一种基于连接选择的覆盖网拓扑优化算法ILS。ILS算法利用P2P文件共享应用呈现的基于兴趣的局部性特征,提出了节点间兴趣相似度评价模型和连接价值评价模型,通过动态自适应地在覆盖网中增加同兴趣节点间连接,删除低价值连接的方法,构成兴趣聚集。实验证明,ILS能使搜索在小范围内获得高成功率,显著缩短搜索响应时间,降低通信开销,与其它算法相比具有显著优势。
提出了一种基于超立方体结构的P2P数据网格信息服务模型及拓扑优化算法。该算法能够用最多O(logN)的代价完成基于关键字的查找,并通过追踪访问的热点和调换节点位置,使得彼此访问量最大的节点在覆盖网中始终距离最近。分析和模拟证明,这种信息服务组织模式充分利用了数据网格的特点,能够有效保证服务性能和系统可扩展性,而自适应换位算法能大幅提高资源搜索效率。
Peer-to-peer (P2P), an emerging model that relies primarily on computing power and bandwidth of participating peers instead of centralized infrastructures, is scalable, robust, and can be easily deployed. P2P computing is a promising architecture for distributed services over the Internet, and become the hottest topic of network computing in recent years.
The topology of a P2P overlay network is the most important character which influences the performance of a P2P system. First, as a P2P system is highly dynamic, the resilience of overlay network is of great importance, so as to make sure that the system will not crash due to the peers' leaving, and is not vulnerable to any attacks. Second, search is the most important operation in P2P environments. The efficiency of searching would determine the performance and scalability of a P2P system. The topology optimization is one of the major approaches for improving search efficiency. In order to improve the system's reliability and search efficiency, we study the topology optimization in depth. The major contributions of this research are as follows.
We propose a distributed cut vertex discovery and neutralization algorithm in P2P environment, which depends on local knowledge to enable every single node be able to determine whether it is a cut vertex or not, and adapt effective methods to clear up its badness to the network. We prove the correctness of this algorithm and evaluate the performance of our design through trace driven simulations. Our design is self adaptive, high veracity and with minimal overhead, and it can discover all cut vertices with very small proportion of the peers wrongly treated as cut vertex in static network. It is also highly accurate in active networks.
We propose a distributed mechanism which efficiently detects the vertex cutset with 1 or 2 vertices and neutralize them into normal nodes, by smartly counting the number of disjoint paths between the neighbors of the selected peers. We evaluate the performance of our design through trace driven simulations. The results show that our algorithm greatly improves the reliability of an overlay network upon the failure of vertex cutset.
We also propose a topology optimization algorithm ILS by link selection in Gnutella-like systems, to address the search efficiency problem by exploiting the principle of interest-based locality. We prove a model to evaluate the similarity of peers and value of the connections. Peers build new connections with others which have similar interests and disconnect those with minimal values. Our simulation study shows that ILS can significantly reduce the reply path lengths, achieving high search success rate, as well as reducing the total communication cost in unstructured P2P systems.
We propose a novel model for Data Grid Information Service using a deterministic P2P based hypercube topology, which realizes the keyword-based searching in the cost of O(logN). Furthermore, we propose a transposition algorithm to optimize the overlay network's topology according to the access statistics between peers, making the peers neighbors when they often visit each other. The simulation and analysis shows that our approach could sufficiently utilize the special character of Date Grid Information Service, and guarantee the QoS and scalability of the system effectively. Also, the transposition algorithm significantly improves search efficiency.
P2P覆盖网拓扑的特性是影响P2P系统服务质量的关键因素。首先,P2P系统具有强动态性,为保证应用稳定可靠,不会因节点的随意离开导致系统崩溃或服务质量明显下降,要求覆盖网拓扑具有良好的弹性,没有明显的缺陷。其次,资源搜索是P2P系统中最重要的操作,提高资源搜索效率能够显著改善系统的性能和可扩展性,而覆盖网的拓扑结构对资源搜索具有全方位的影响,拓扑优化是提高搜索效率的主要手段之一。因此,本文以提高系统可靠性和资源搜索效率为目标,对P2P环境下拓扑优化技术进行了深入研究。本文贡献如下:
提出了一种P2P环境下被动式分布式割点发现算法,该算法仅依靠局部信息,可使P2P覆盖网中的每个节点自主判断自己是否为割点,并采取相应措施来消除对覆盖网连通性的危害。通过理论分析和模拟实验证明,该算法具有准确率高、开销低、自适应性强等优点。在静态网络中,它能够发现所有的割点,且普通节点被误判为割点的几率极低。在动态环境下,也能获得非常高的准确率。
提出了一种P2P环境下分布式点割集发现和消除算法。该算法通过节点巧妙地计算其邻居间点不相交道路的情况,判定自己是否是割点或发现其所属的2点割,并采取修补措施来消除其对覆盖网的不利影响。实验证明,该算法准确率高,割集消除对提高覆盖网可靠性的效果显著。
提出了一种基于连接选择的覆盖网拓扑优化算法ILS。ILS算法利用P2P文件共享应用呈现的基于兴趣的局部性特征,提出了节点间兴趣相似度评价模型和连接价值评价模型,通过动态自适应地在覆盖网中增加同兴趣节点间连接,删除低价值连接的方法,构成兴趣聚集。实验证明,ILS能使搜索在小范围内获得高成功率,显著缩短搜索响应时间,降低通信开销,与其它算法相比具有显著优势。
提出了一种基于超立方体结构的P2P数据网格信息服务模型及拓扑优化算法。该算法能够用最多O(logN)的代价完成基于关键字的查找,并通过追踪访问的热点和调换节点位置,使得彼此访问量最大的节点在覆盖网中始终距离最近。分析和模拟证明,这种信息服务组织模式充分利用了数据网格的特点,能够有效保证服务性能和系统可扩展性,而自适应换位算法能大幅提高资源搜索效率。
Peer-to-peer (P2P), an emerging model that relies primarily on computing power and bandwidth of participating peers instead of centralized infrastructures, is scalable, robust, and can be easily deployed. P2P computing is a promising architecture for distributed services over the Internet, and become the hottest topic of network computing in recent years.
The topology of a P2P overlay network is the most important character which influences the performance of a P2P system. First, as a P2P system is highly dynamic, the resilience of overlay network is of great importance, so as to make sure that the system will not crash due to the peers' leaving, and is not vulnerable to any attacks. Second, search is the most important operation in P2P environments. The efficiency of searching would determine the performance and scalability of a P2P system. The topology optimization is one of the major approaches for improving search efficiency. In order to improve the system's reliability and search efficiency, we study the topology optimization in depth. The major contributions of this research are as follows.
We propose a distributed cut vertex discovery and neutralization algorithm in P2P environment, which depends on local knowledge to enable every single node be able to determine whether it is a cut vertex or not, and adapt effective methods to clear up its badness to the network. We prove the correctness of this algorithm and evaluate the performance of our design through trace driven simulations. Our design is self adaptive, high veracity and with minimal overhead, and it can discover all cut vertices with very small proportion of the peers wrongly treated as cut vertex in static network. It is also highly accurate in active networks.
We propose a distributed mechanism which efficiently detects the vertex cutset with 1 or 2 vertices and neutralize them into normal nodes, by smartly counting the number of disjoint paths between the neighbors of the selected peers. We evaluate the performance of our design through trace driven simulations. The results show that our algorithm greatly improves the reliability of an overlay network upon the failure of vertex cutset.
We also propose a topology optimization algorithm ILS by link selection in Gnutella-like systems, to address the search efficiency problem by exploiting the principle of interest-based locality. We prove a model to evaluate the similarity of peers and value of the connections. Peers build new connections with others which have similar interests and disconnect those with minimal values. Our simulation study shows that ILS can significantly reduce the reply path lengths, achieving high search success rate, as well as reducing the total communication cost in unstructured P2P systems.
We propose a novel model for Data Grid Information Service using a deterministic P2P based hypercube topology, which realizes the keyword-based searching in the cost of O(logN). Furthermore, we propose a transposition algorithm to optimize the overlay network's topology according to the access statistics between peers, making the peers neighbors when they often visit each other. The simulation and analysis shows that our approach could sufficiently utilize the special character of Date Grid Information Service, and guarantee the QoS and scalability of the system effectively. Also, the transposition algorithm significantly improves search efficiency.
引文
[1] Napster website: http://www.napster.com
[2] Gnutella website: http://www.gnutella.co.uk/.
[3] Clarke I, Sandberg O, Wiley B, Hong T W. Freenet: A distributed anonymous information storage and retrieval system. ICSI workshop On Design Issues in Anonymity and Unobservability 2000, Berkeley, CA, USA: 46-66.
[4] Bittorrent website: http://www.bittorrent.com
[5] KaZaA website: http://www.kazaa.com
[6] Skype website: http://www.skype.com
[7] QQ website: http://www.qq.com/
[8] A. Oram. Peer-to-Peer: Harnessing the Power of Disruptive Technologies: O'Reily& Associates, March 2001.
[9] eDonkey website: http://www.edonkey.com
[10] emule website: http://www.emule.org
[11] Rhea, Chris Wells, Patrick Eaton, Dennis Geels, Ben Zhao, Hakim Weatherspoon,John Kubiatowicz. Maintenance-Free Global Data Storage. IEEE Internet Computing 2001: 40-49.
[12] P. Druschel, A. Rowstron. PAST: A Large-scale, Persistent Peer-to-Peer Storage Utility. HotOS VIII May 2001, Schoss Elmau, Germany.
[13] Groove website: http://www.groove.net/home/index.cfm
[14] MSN Messager website: http://www.msn.com
[15] X. Zhang, J. Liu, B. Li, T.-S. P. Yum. CoolStreaming/DONet: A Data-driven Overlay Network for Live Media Streaming. IEEE INFOCOM 2005, Miami, FL, USA.
[16] Gridmedia Project Website: http://www.gridmedia.com.cn/
[17] SETI@home website: http://setiathome.berkeley.edu/index.php
[18] David P. Anderson, Jeff Cobb, Eric Korpela, Matt Lebofsky , Kan Werthimer.SETI@home: An Experiment in Public-Resource Computing. Communications of the ACM 2002.
[19] Folding@home website: http://folding.stanford.edu/.
[20] distributed.net website: http://distributed.net/.
[21]李东升.基于对等模式的资源定位技术研究.博士论文2005.
[22]Bittorrent protocol specication:http://bitconjurer.org/BitTorrent/protocol.html
[23]FastTrack Product Description:http://www.fasttrack.nu/index_int.html
[24]The Gnutella Protocol Specification v0.4.
[25]Stoica I,Morris R,Liben-Nowell D,Karger DR,Kaashoek MF,Dabek F and Balakrishnan H.Chord:A scalable peer-to-peer lookup protocol for internet applications.IEEE/ACM Transactions on Networking 2003;11(1):17-32.
[26]S.Ratnasamy,S.Shenker,I.Stoica.Routing Algorithm for DHTs:Some Open Questions.1sth International Workshop on Peer-to-Peer System(IPTPS'02) 2002,Cambridge,USA.
[27]Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content addressable network.Confrence of Applicatoins,Technologies,Architectures,and Protocols for Computer Communication,SIGCOMM 2001,San Diego,CA,USA:161-172.
[28]Rowstron A,Druschel P.Pastry:Scalable,decentralized object location and routing for largescale peer-to-peer systems.International Conference on Distributed System Platforms(Middleware) 2001,Heidelberg,Germany.
[29]Ben Zhao,John Kubiatowicz,Anthony Joseph.Tapestry:An infrastructure for fault-tolerant wide-wide location and routing.Technical Report,U.C.Berkeley 2001.
[30]Y.Zhao,Ling Huang,Jeremy Stribling.Tapestry:A Resilient Global-scale Overlay for Service Deployment.Journal on Selected Areas in Communications(JSAC),2004:41-53.
[31]Chunqiang Tang,Sandhya Dwarkadas.Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval.NSDI 2004.
[32]Shuming Shi,Guangwen Yang,Dingxing Wang,Jin Yu,Shaogang Qu,Ming Chen.Making Peer-to-Peer Searching Feasible Using Multi-level Partitioning.IPTPS 2004.
[33]Loo B T,Huebsch R,Stoica I,Hellerstein J.The Case for a hybrid P2P search infrastructure 3th International Workshop on Peer-to-Peer System 2004,La Jolla,CA,USA:141-150.
[34]B.Yang,H.Garcia-Molina.Efficient Search in Peer-to-Peer Networks.22nd IEEE International Conference on Distributed Computing Systems(ICDCS) July 2002,Vienna,Austria.
[35]Q.Lv,P.Cao,E.Cohen,K.Li,S.Shenker.Search and Replication in Unstructured Peer-to-Peer Networks.16th ACM International Conference on Supercomputing (ICS'02) June 2002.,New York,USA.
[36] Christos Gkantsidis, Milena Mihail, Amin Saberi. Random walks in peer-to-peer networks. IEEE INFOCOM 2004.
[37] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. 16th ACM International Conference on Supercomputing 2002.
[38] S. Boyd, A. Ghosh, B. Prabhakar, D. Shah,. Gossip Algorithms: Design, Analysis,and Applications,". IEEE INFOCOM 2005.
[39] D. Eastlake, P. Jones. RFC3174: US Secure Hash Algorithm 1( SHA-1):Http://www.faqs.org/rfcs/rfc3174.html.
[40] Aberer, Karl. P-Grid: A self-organizing access structure for P2P information system. Sixth International Conference on Cooperative Information Systems (CoopIS 2001) 2001, Trento, Italy.
[41] D. Malkhi, M. Naor, D. Ratajczak. Viceroy: A Scalable and Dynamic Lookup Network. 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002,Monterey, CA.
[42] F. Kaashoek, D. R. Karger. Koorde: A Simple Degree-optimal Hash Table. IPTPS 2003, Berkeley, CA, USA.
[43] Dongsheng Li, Xicheng Lu. FISSIONE: A Scalable Constant Degree and Low Congestion DHT Scheme Based on Kautz Graphs. IEEE INFOCOM 2005, Miami,Florida, USA: 1677-1688.
[44] Gupta, Divyakant Agrawal, Amr El Abbadi. Approximate Range Selection Queries in Peer-to-Peer Systems. First Biennial Conference on Innovative Data Systems Research (CIDR) 2003, Asilomar, California, USA.
[45] Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony LaMarcay,Scott Shenker, Joseph Hellersteinz. Case Study in Building Layered DHT Applications.ACM SIGCOMM 2005, Philadelphia, Pennsylvania, USA.
[46] Milgram, S. The small world problem. Psychology Today 1 1967.
[47] A L. Barabasi, R. Albert. Emergence of scaling in random networks. Science 509-512 1999.
[48] Reka Albert, Albert-La szlo Baraba. Statistical Mechanics of Complex Networks.Reviews of Modern Physics 2002: 48-94.
[49] Eytan Adar, Bernardo A. Huberman. Free Riding on Gnutella. Technical Report 2000.
[50] S. Saroiu, P. Gnmmadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. Multimedia Computing and Networking(MMCN), 2002.
[51]Korfhage,Robert R.Information Storage and Retrieval.John Wiley and Sons 1997.
[52]R.Bhagwan,S.Savage,G M.Voelker Understanding availability.IPTPS 2003,Berkeley,CA,USA:256-267.
[53]A.Crespo,H.Garcia-Molina.Semantic Overlay Networks.3rd Int'l Workshop on Agents and Peer-to-Peer Computing 2004,Berlin.
[54]Sripanidkulchai,Kunwadee.The popularity of Gnutella queries and its implications on scalability 2001.
[55]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.SOSP 2003,Bolton Landing,NY:19-22.
[56]J.Chu,K.Labonte,B.Levine.Availability and locality measurements of peer-to-peer file systems.ITCom:Scalability and Traffic Control in IP Networks 2002,Boston,MA.
[57]A.Klemm,C.Lindemann,M K.Vernon,O P.Waldhorst.Characterizing the query behavior in peer-to-peer file sharing systems.4th ACM SIGCOMM 2004,Taormina,Sicily,Italy:55-67.
[58]Markatos,E.Tracing a large-scale peer-to-peer systems an hour in the life of Gnutella.CCGrid 2002,Berlin,Germany:65-74.
[59]GT-ITM website:http://www.cc.gatech.edu/projects/gtitm/.
[60]ns-2 website:http://www.isi.edu/nsnam/ns/.
[61]Nyik San Ting,Ralph Deters.3LS-A Peer-to-Peer Network Simulator.Third International Conference on Peer-to-Peer Computing 2003.
[62]Neurogrid website:http://www.neurogrid.net/php/index.php.
[63]P2Psim website:http:/www.pdos.lcs.mit.edu/p2psim/.
[64]Peersim simulator website:http://sourceforge.net/projects/peersim/.
[65]B.Krishnamurthy,S.Sen,Y.Zhang,and Y.Chen,.Sketch-based Change Detection:Methods,Evaluation,and Applications.SIGCOMM Internet Measurement Conference(IMC) 2003.
[66]E.Al-Shaer,Y.Tang.QoS Path Monitoring for Multicast Networks.Journal of Network and System Management(JNSM) 2002.
[67]K.Xu,Z.Duan,Z.Zhang,and J.Chandrashekar.On Properties of Internet Exchange Points and Their Impact on AS Topology and Relationship.Networking 2004.
[68] J. Liu, X. Zhang, B. Li, Q. Zhang, and W. Zhu. Distributed Distance Estimation for Large-Scale Networks. Elsevier Computer Networks 2003;41:177-193.
[69] Li Xiao, K. Nahrstedt. Reliability Models and Evaluation of Internal BGP Networks. IEEE INFOCOM 2004.
[70] S. Kim, A. L. N. Reddy. Image-based Anomlay Detection Technique: Algorithm, Implementation and Effectiveness. IEEE JSAC 2006.
[71] F. Xing , W. Wang. Modeling and Analysis of Connectivity in Mobile Ad Hoc Networks with Misbehaving Nodes. IEEE International Conference on Communications(ICC) 2006.
[72] M. Lad, A. Nanavati, D. Massey, L. Zhang. An Algorithmic Approach to Identifying Link Failures. 10th Pacific Rim Dependable Computing Symposium (PRDC) 2004.
[73] N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, J. Wang. Locating Internet Bottlenecks:Algorithms, Measurements, and Implications. ACM SIGCOMM 2004.
[74] S. Birrer, F. E. Bustamante. Resilience in Overlay Multicast Protocols. 14th IEEE/ACM International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) 2006.
[75] D. Dumitriu, E. Knightly, I. Stoica, W. Zwaenepoel. Denial of Service Resilience in Peer-to-Peer File Sharing Systems. ACM SIGMETRICS 2005.
[76] K. T. Law, C. S. Lui, and K. Y. Yau. You Can Run, But You Can't Hide: An Effective Methodology to Traceback DDoS Attackers. The Tenth IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) 2002.
[77] Y. Lin, B. Liang, B. Li. Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes. IEEE INFOCOM 2007.
[78] S. Lee, Y. Yu, S. Nelakuditi, Z. L. Zhang, C. N. Chuah. Proactive vs. Reactive Approaches to Failure Resilient Routing. IEEE INFOCOM 2004.
[79] B. Y. Zhao, L. Huang, J. Stribling, A. D. Joseph, J. D. Kubiatowicz,. Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays. ICNP 2003.
[80] Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou. Resilient Peer-to-Peer Streaming. ICNP 2003.
[81] Mee Young Sung, Jong Hyuk Lee, Jong Seung Park, Seung Sik Choi, Sungtek Kahng. Reliable Mobile Ad Hoc P2P Data Sharing. Networking 2005.
[82] J. Mirkovic, G. Prier, P. Reiher. Attacking DDoS at the Source. ICNP 2002.
[83] Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S. Making Gnutella-like P2P systems scalable. SIGCOMM, Applications, Techonlogies,Architectures, and Protocol for Computer Communication 2003, Karlsruhe, Germany:407-418.
[84] S. Ratnasamy, S. Shenker, S. McCanne. Towards an Evolvable Internet Architecture. ACM SIGCOMM 2005.
[85] P. Keyani, B. Larson, M. Senthil. Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems. IFIP Workshop on Peer-to-Peer Computing 2002.
[86] G. Pandurangan, P. Raghavan, E. Upfal. Building Low Diameter Peer-to-Peer Networks. 42nd Annual IEEE Symposium on the Foundations of Computer Science(FOCS) 2001, Las Vegas, Nevada.
[87] Beverly Yang, Hector Garcia-Molina. Designing a Super-Peer Network. 19th International Conference on Data Engineering (ICDE) March 2003, Bangalore, India.
[88] Rita H. Wouhaybi, Andrew T. Campbell. Phenix: Supporting resilient low-diameter peer-to-peer topologies. IEEE INFOCOM 2004, Hong Kong, China:108-119.
[89] Hui Zhang, Ashish Goel, Ramesh Govindan. the Small-World Model to Improve Freenet Performance. IEEE INFOCOM 2002, New York, USA.
[90] Gurmeet S Manku, Mayank Bawa, Prabhakar Raghavan. Symphony: Distributed Hashing in a Small World. USENIX Symposium on Internet Technologies and Systems(USITS) March, 2003, Seattle, Washington, USA.
[91] Kleinberg, J. M. Navigation in the Small World. Nature 406 2000: 845.
[92] V.N. Padmanabhan , L. Subramanian An investigation of geographic mapping techniques for internet hosts. ACM SIGCOMM Conference on Applications,Technologies, Architectures and Protocols for Computer Communication 2001, San Diego, CA, USA: 173-185.
[93] B. Krishnamurthy, J. Wang. Topology Modeling via Cluster Graphs. 2001,SIGCOMM Internet Measurement Workshop.
[94] B. Krishnamurthy, J. Wang. On network-aware clustering of web clients. ACM SIGCOMM 2000, Stockholm, Sweden: 97-110.
[95] B. Krishnamurthy, J. Wang, Y. Xie. Early measurements of a cluster-based architecture for P2P systems. 1st ACM SIGCOMM workshop on Internet Measurement(IMW) 2001, San Francisco, California, USA: 105-109.
[96] S. Ratnasamy, M. Handley, R. Karp, S. Shenker. Topologically-aware overlay construction and server selection. IEEE INFOCOM 2002, New York, USA: 1190-1199.
[97] ZhiChen Xu, CHunqing Tang, Zheng Zhang. Building Topology-Aware Overlays using Global Soft-State. The 23rd International Conference on Distributed Computing Systems(ICDCS),2003.
[98]Yunhao Liu,Zhenyun Zhuang,Li Xiao,Lionel M Ni.AOTO:Adaptive Overlay Topology Optimization in Unstructured P2P Systems.IEEE GLOBECOM December 2003,San Francisco,USA.
[99]Yunhao Liu,Zhenyun Zhuang,Li Xiao,Lionel M Ni A Distributed Approach to Solving Overlay Mismatching Problem.24th International Conference on Distributed Computing Systems(IEEE ICDCS) March 2004,Tokyo,Japan:132-139.
[100]Yunhao Liu,Xiaomei Liu,LI Xiao,Lionel M NI,Xiaodong Zhang.Location-Aware Topology Matching in P2P Systems.INFOCOM,2004.
[101]Zhenyun Zhuang,Yunhao Liu,and Li Xiao.Building a Scalable Bipartite P2P Overlay Network.18th International Parallel and Distributed Processing Symposium (IEEE IPDPS) 2004,Santa Fe,New Mexico,USA.
[102]Irwin King,Cheuk Hang Ng,Ka Cheung Sia.Distributed Content-Based VisualInformation Retrieval System on Peer-to-Peer Networks.ACM Transactions on Information Systems(TOIS) 2004;22(3):477-501.
[103]黄维维 黄铭钧 陈建利 王晓宇 凌波 周傲英,一种基于自配置策略的新型Peer-to-Peer平台系统.软件学报2003,14:237-246.
[104]Murali Krishna Ramanathan,Vana Kalogeraki,Jim Pruyne.Finding Good Peers in Peer-to-Peer Network.IPDPS 2002.
[105]Marcelo Werneck Barbosa,Melissa Morgado Costa,Jussara M.Almeida,Virgilio A.F.Almeida.Using Locality of Reference to Improve Performance of Peer-to-Peer Applications.ACM SIGSOFT Software Engineering Notes archive 2004:216-227.
[106]Kunwadee Sripanidkulchai,Bruce Maggs,Hui Zhang.Efficient Content Location Using Interest-Based Locality in Peer-to-Peer System.IEEE INFOCOM 2003.
[107]Xiaomei Liu,Li Xiao,Andrew Kreling,Yunhao Liu.Optimizing Overlay Topology by Reducing Cut Vertices.NOSSDAV:ACM,2006.
[108]F.Buckley,M.Lewinter,ed.A Friendly Introducation to Graph Theory,2002.
[109]H.Wang,T.Lin.On Efficiency in Searching Networks.IEEE INFOCOM 2005.
[110]For S.Servetto and G.Barenechea.Constrained Random Walks on Random Graphs:Routing Algorithms for Large Scale Wireless Sensor Networks.1st ACM International Workshop on Wireless Sensor Networks and Applications(WSNA) 2002.
[111]A.Iamnitchi,M.Ripeanu,I.Foster.Small-World File sharing Communities.IEEE INFOCOM 2004.
[112]T.Bu,D.Towsley.On Distinguishing between Internet power law topology generators.IEEE INFOCOM 2004.
[113]F.Stann,J.Heidemann,R.Shroff,M.Z.Murtaza.RBP:Robust Broadcast Propagation in Wireless Networks.SenSys:ACM,2006.
[114]J.Watts,Steven H.Strogatz.Collective Dynamics of "Small-World" Networks.Nature 393 1998:440-442.
[115]Watts DJ,Strogatz SH.Collective dynamics of small-world networks.Nature 1998.
[116]a free-scale topology product algorithm:http://arxiv.org/abs/cond-mat/0106096,http://arxiv.org/pdf/cond-mat/0408391
[117]王意洁 肖侬 任浩.数据网格及其关键技术研究.计算机研究发展2002;11.
[118]globus website:http://www.globus.org
[119]SRB website:http://www.sdsc.edu/srb/
[120]A.Iamnitchi,I.Foster.A peer-to-peer approach to resource location in Grid environments,2003.
[121]A.Andrzejak,Z.Xu.Scalable,efficient range queries for Grid information services.IEEE P2P 2002.
[122]PIER website:http://pier.cs.berkeley.edu/.
[123]D.Oppenheimer,J.Albrecht,D.Patterson,A.Vahdat.Distributed resource discovery on planetlab with SWORD.First Workshop on Real,Large Distributed Systems(WORLDS) 2004.
[124]Planet-Lab website:http://www.planet-lab.org/.
[125]Qi Xia,Ruijun Yang,Weinong Wang,De Yang.Fully Decentralized DHT based Approach to Grid Service Discovery using Overlay Networks.The Fifth International Conference on Computer and Information Technology(CIT'05),2005.
[126]Mario Schlosser,Michael Sintek,Stefan Decker,Wolfgang Nejdl.HyperCup-Hypercubes,ontologies and Efficient Search on P2P Networks.AP2PC,2002.
[127]Mario Schlosser,Michael Sintek,Stefan Decker,Wolfgang Nejdl.Ontology-Based Search and Broadcast in HyperCup.ISWC,2002.
[128]Mario Schlosser,Michael Sintek,Stefan Decker,Wolfgang Nejdl.HyperCup-Shaping Up Peer-to-Peer Network.DISC,2002.
[2] Gnutella website: http://www.gnutella.co.uk/.
[3] Clarke I, Sandberg O, Wiley B, Hong T W. Freenet: A distributed anonymous information storage and retrieval system. ICSI workshop On Design Issues in Anonymity and Unobservability 2000, Berkeley, CA, USA: 46-66.
[4] Bittorrent website: http://www.bittorrent.com
[5] KaZaA website: http://www.kazaa.com
[6] Skype website: http://www.skype.com
[7] QQ website: http://www.qq.com/
[8] A. Oram. Peer-to-Peer: Harnessing the Power of Disruptive Technologies: O'Reily& Associates, March 2001.
[9] eDonkey website: http://www.edonkey.com
[10] emule website: http://www.emule.org
[11] Rhea, Chris Wells, Patrick Eaton, Dennis Geels, Ben Zhao, Hakim Weatherspoon,John Kubiatowicz. Maintenance-Free Global Data Storage. IEEE Internet Computing 2001: 40-49.
[12] P. Druschel, A. Rowstron. PAST: A Large-scale, Persistent Peer-to-Peer Storage Utility. HotOS VIII May 2001, Schoss Elmau, Germany.
[13] Groove website: http://www.groove.net/home/index.cfm
[14] MSN Messager website: http://www.msn.com
[15] X. Zhang, J. Liu, B. Li, T.-S. P. Yum. CoolStreaming/DONet: A Data-driven Overlay Network for Live Media Streaming. IEEE INFOCOM 2005, Miami, FL, USA.
[16] Gridmedia Project Website: http://www.gridmedia.com.cn/
[17] SETI@home website: http://setiathome.berkeley.edu/index.php
[18] David P. Anderson, Jeff Cobb, Eric Korpela, Matt Lebofsky , Kan Werthimer.SETI@home: An Experiment in Public-Resource Computing. Communications of the ACM 2002.
[19] Folding@home website: http://folding.stanford.edu/.
[20] distributed.net website: http://distributed.net/.
[21]李东升.基于对等模式的资源定位技术研究.博士论文2005.
[22]Bittorrent protocol specication:http://bitconjurer.org/BitTorrent/protocol.html
[23]FastTrack Product Description:http://www.fasttrack.nu/index_int.html
[24]The Gnutella Protocol Specification v0.4.
[25]Stoica I,Morris R,Liben-Nowell D,Karger DR,Kaashoek MF,Dabek F and Balakrishnan H.Chord:A scalable peer-to-peer lookup protocol for internet applications.IEEE/ACM Transactions on Networking 2003;11(1):17-32.
[26]S.Ratnasamy,S.Shenker,I.Stoica.Routing Algorithm for DHTs:Some Open Questions.1sth International Workshop on Peer-to-Peer System(IPTPS'02) 2002,Cambridge,USA.
[27]Ratnasamy S,Francis P,Handley M,Karp R,Shenker S.A scalable content addressable network.Confrence of Applicatoins,Technologies,Architectures,and Protocols for Computer Communication,SIGCOMM 2001,San Diego,CA,USA:161-172.
[28]Rowstron A,Druschel P.Pastry:Scalable,decentralized object location and routing for largescale peer-to-peer systems.International Conference on Distributed System Platforms(Middleware) 2001,Heidelberg,Germany.
[29]Ben Zhao,John Kubiatowicz,Anthony Joseph.Tapestry:An infrastructure for fault-tolerant wide-wide location and routing.Technical Report,U.C.Berkeley 2001.
[30]Y.Zhao,Ling Huang,Jeremy Stribling.Tapestry:A Resilient Global-scale Overlay for Service Deployment.Journal on Selected Areas in Communications(JSAC),2004:41-53.
[31]Chunqiang Tang,Sandhya Dwarkadas.Hybrid Global-Local Indexing for Efficient Peer-to-Peer Information Retrieval.NSDI 2004.
[32]Shuming Shi,Guangwen Yang,Dingxing Wang,Jin Yu,Shaogang Qu,Ming Chen.Making Peer-to-Peer Searching Feasible Using Multi-level Partitioning.IPTPS 2004.
[33]Loo B T,Huebsch R,Stoica I,Hellerstein J.The Case for a hybrid P2P search infrastructure 3th International Workshop on Peer-to-Peer System 2004,La Jolla,CA,USA:141-150.
[34]B.Yang,H.Garcia-Molina.Efficient Search in Peer-to-Peer Networks.22nd IEEE International Conference on Distributed Computing Systems(ICDCS) July 2002,Vienna,Austria.
[35]Q.Lv,P.Cao,E.Cohen,K.Li,S.Shenker.Search and Replication in Unstructured Peer-to-Peer Networks.16th ACM International Conference on Supercomputing (ICS'02) June 2002.,New York,USA.
[36] Christos Gkantsidis, Milena Mihail, Amin Saberi. Random walks in peer-to-peer networks. IEEE INFOCOM 2004.
[37] Qin Lv, Pei Cao, Edith Cohen, Kai Li, Scott Shenker. Search and Replication in Unstructured Peer-to-Peer Networks. 16th ACM International Conference on Supercomputing 2002.
[38] S. Boyd, A. Ghosh, B. Prabhakar, D. Shah,. Gossip Algorithms: Design, Analysis,and Applications,". IEEE INFOCOM 2005.
[39] D. Eastlake, P. Jones. RFC3174: US Secure Hash Algorithm 1( SHA-1):Http://www.faqs.org/rfcs/rfc3174.html.
[40] Aberer, Karl. P-Grid: A self-organizing access structure for P2P information system. Sixth International Conference on Cooperative Information Systems (CoopIS 2001) 2001, Trento, Italy.
[41] D. Malkhi, M. Naor, D. Ratajczak. Viceroy: A Scalable and Dynamic Lookup Network. 21st ACM Symposium on Principles of Distributed Computing (PODC), 2002,Monterey, CA.
[42] F. Kaashoek, D. R. Karger. Koorde: A Simple Degree-optimal Hash Table. IPTPS 2003, Berkeley, CA, USA.
[43] Dongsheng Li, Xicheng Lu. FISSIONE: A Scalable Constant Degree and Low Congestion DHT Scheme Based on Kautz Graphs. IEEE INFOCOM 2005, Miami,Florida, USA: 1677-1688.
[44] Gupta, Divyakant Agrawal, Amr El Abbadi. Approximate Range Selection Queries in Peer-to-Peer Systems. First Biennial Conference on Innovative Data Systems Research (CIDR) 2003, Asilomar, California, USA.
[45] Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, Anthony LaMarcay,Scott Shenker, Joseph Hellersteinz. Case Study in Building Layered DHT Applications.ACM SIGCOMM 2005, Philadelphia, Pennsylvania, USA.
[46] Milgram, S. The small world problem. Psychology Today 1 1967.
[47] A L. Barabasi, R. Albert. Emergence of scaling in random networks. Science 509-512 1999.
[48] Reka Albert, Albert-La szlo Baraba. Statistical Mechanics of Complex Networks.Reviews of Modern Physics 2002: 48-94.
[49] Eytan Adar, Bernardo A. Huberman. Free Riding on Gnutella. Technical Report 2000.
[50] S. Saroiu, P. Gnmmadi, and S. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. Multimedia Computing and Networking(MMCN), 2002.
[51]Korfhage,Robert R.Information Storage and Retrieval.John Wiley and Sons 1997.
[52]R.Bhagwan,S.Savage,G M.Voelker Understanding availability.IPTPS 2003,Berkeley,CA,USA:256-267.
[53]A.Crespo,H.Garcia-Molina.Semantic Overlay Networks.3rd Int'l Workshop on Agents and Peer-to-Peer Computing 2004,Berlin.
[54]Sripanidkulchai,Kunwadee.The popularity of Gnutella queries and its implications on scalability 2001.
[55]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.SOSP 2003,Bolton Landing,NY:19-22.
[56]J.Chu,K.Labonte,B.Levine.Availability and locality measurements of peer-to-peer file systems.ITCom:Scalability and Traffic Control in IP Networks 2002,Boston,MA.
[57]A.Klemm,C.Lindemann,M K.Vernon,O P.Waldhorst.Characterizing the query behavior in peer-to-peer file sharing systems.4th ACM SIGCOMM 2004,Taormina,Sicily,Italy:55-67.
[58]Markatos,E.Tracing a large-scale peer-to-peer systems an hour in the life of Gnutella.CCGrid 2002,Berlin,Germany:65-74.
[59]GT-ITM website:http://www.cc.gatech.edu/projects/gtitm/.
[60]ns-2 website:http://www.isi.edu/nsnam/ns/.
[61]Nyik San Ting,Ralph Deters.3LS-A Peer-to-Peer Network Simulator.Third International Conference on Peer-to-Peer Computing 2003.
[62]Neurogrid website:http://www.neurogrid.net/php/index.php.
[63]P2Psim website:http:/www.pdos.lcs.mit.edu/p2psim/.
[64]Peersim simulator website:http://sourceforge.net/projects/peersim/.
[65]B.Krishnamurthy,S.Sen,Y.Zhang,and Y.Chen,.Sketch-based Change Detection:Methods,Evaluation,and Applications.SIGCOMM Internet Measurement Conference(IMC) 2003.
[66]E.Al-Shaer,Y.Tang.QoS Path Monitoring for Multicast Networks.Journal of Network and System Management(JNSM) 2002.
[67]K.Xu,Z.Duan,Z.Zhang,and J.Chandrashekar.On Properties of Internet Exchange Points and Their Impact on AS Topology and Relationship.Networking 2004.
[68] J. Liu, X. Zhang, B. Li, Q. Zhang, and W. Zhu. Distributed Distance Estimation for Large-Scale Networks. Elsevier Computer Networks 2003;41:177-193.
[69] Li Xiao, K. Nahrstedt. Reliability Models and Evaluation of Internal BGP Networks. IEEE INFOCOM 2004.
[70] S. Kim, A. L. N. Reddy. Image-based Anomlay Detection Technique: Algorithm, Implementation and Effectiveness. IEEE JSAC 2006.
[71] F. Xing , W. Wang. Modeling and Analysis of Connectivity in Mobile Ad Hoc Networks with Misbehaving Nodes. IEEE International Conference on Communications(ICC) 2006.
[72] M. Lad, A. Nanavati, D. Massey, L. Zhang. An Algorithmic Approach to Identifying Link Failures. 10th Pacific Rim Dependable Computing Symposium (PRDC) 2004.
[73] N. Hu, L. E. Li, Z. M. Mao, P. Steenkiste, J. Wang. Locating Internet Bottlenecks:Algorithms, Measurements, and Implications. ACM SIGCOMM 2004.
[74] S. Birrer, F. E. Bustamante. Resilience in Overlay Multicast Protocols. 14th IEEE/ACM International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS) 2006.
[75] D. Dumitriu, E. Knightly, I. Stoica, W. Zwaenepoel. Denial of Service Resilience in Peer-to-Peer File Sharing Systems. ACM SIGMETRICS 2005.
[76] K. T. Law, C. S. Lui, and K. Y. Yau. You Can Run, But You Can't Hide: An Effective Methodology to Traceback DDoS Attackers. The Tenth IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) 2002.
[77] Y. Lin, B. Liang, B. Li. Data Persistence in Large-scale Sensor Networks with Decentralized Fountain Codes. IEEE INFOCOM 2007.
[78] S. Lee, Y. Yu, S. Nelakuditi, Z. L. Zhang, C. N. Chuah. Proactive vs. Reactive Approaches to Failure Resilient Routing. IEEE INFOCOM 2004.
[79] B. Y. Zhao, L. Huang, J. Stribling, A. D. Joseph, J. D. Kubiatowicz,. Exploiting Routing Redundancy via Structured Peer-to-Peer Overlays. ICNP 2003.
[80] Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou. Resilient Peer-to-Peer Streaming. ICNP 2003.
[81] Mee Young Sung, Jong Hyuk Lee, Jong Seung Park, Seung Sik Choi, Sungtek Kahng. Reliable Mobile Ad Hoc P2P Data Sharing. Networking 2005.
[82] J. Mirkovic, G. Prier, P. Reiher. Attacking DDoS at the Source. ICNP 2002.
[83] Chawathe Y, Ratnasamy S, Breslau L, Lanham N, Shenker S. Making Gnutella-like P2P systems scalable. SIGCOMM, Applications, Techonlogies,Architectures, and Protocol for Computer Communication 2003, Karlsruhe, Germany:407-418.
[84] S. Ratnasamy, S. Shenker, S. McCanne. Towards an Evolvable Internet Architecture. ACM SIGCOMM 2005.
[85] P. Keyani, B. Larson, M. Senthil. Peer Pressure: Distributed Recovery from Attacks in Peer-to-Peer Systems. IFIP Workshop on Peer-to-Peer Computing 2002.
[86] G. Pandurangan, P. Raghavan, E. Upfal. Building Low Diameter Peer-to-Peer Networks. 42nd Annual IEEE Symposium on the Foundations of Computer Science(FOCS) 2001, Las Vegas, Nevada.
[87] Beverly Yang, Hector Garcia-Molina. Designing a Super-Peer Network. 19th International Conference on Data Engineering (ICDE) March 2003, Bangalore, India.
[88] Rita H. Wouhaybi, Andrew T. Campbell. Phenix: Supporting resilient low-diameter peer-to-peer topologies. IEEE INFOCOM 2004, Hong Kong, China:108-119.
[89] Hui Zhang, Ashish Goel, Ramesh Govindan. the Small-World Model to Improve Freenet Performance. IEEE INFOCOM 2002, New York, USA.
[90] Gurmeet S Manku, Mayank Bawa, Prabhakar Raghavan. Symphony: Distributed Hashing in a Small World. USENIX Symposium on Internet Technologies and Systems(USITS) March, 2003, Seattle, Washington, USA.
[91] Kleinberg, J. M. Navigation in the Small World. Nature 406 2000: 845.
[92] V.N. Padmanabhan , L. Subramanian An investigation of geographic mapping techniques for internet hosts. ACM SIGCOMM Conference on Applications,Technologies, Architectures and Protocols for Computer Communication 2001, San Diego, CA, USA: 173-185.
[93] B. Krishnamurthy, J. Wang. Topology Modeling via Cluster Graphs. 2001,SIGCOMM Internet Measurement Workshop.
[94] B. Krishnamurthy, J. Wang. On network-aware clustering of web clients. ACM SIGCOMM 2000, Stockholm, Sweden: 97-110.
[95] B. Krishnamurthy, J. Wang, Y. Xie. Early measurements of a cluster-based architecture for P2P systems. 1st ACM SIGCOMM workshop on Internet Measurement(IMW) 2001, San Francisco, California, USA: 105-109.
[96] S. Ratnasamy, M. Handley, R. Karp, S. Shenker. Topologically-aware overlay construction and server selection. IEEE INFOCOM 2002, New York, USA: 1190-1199.
[97] ZhiChen Xu, CHunqing Tang, Zheng Zhang. Building Topology-Aware Overlays using Global Soft-State. The 23rd International Conference on Distributed Computing Systems(ICDCS),2003.
[98]Yunhao Liu,Zhenyun Zhuang,Li Xiao,Lionel M Ni.AOTO:Adaptive Overlay Topology Optimization in Unstructured P2P Systems.IEEE GLOBECOM December 2003,San Francisco,USA.
[99]Yunhao Liu,Zhenyun Zhuang,Li Xiao,Lionel M Ni A Distributed Approach to Solving Overlay Mismatching Problem.24th International Conference on Distributed Computing Systems(IEEE ICDCS) March 2004,Tokyo,Japan:132-139.
[100]Yunhao Liu,Xiaomei Liu,LI Xiao,Lionel M NI,Xiaodong Zhang.Location-Aware Topology Matching in P2P Systems.INFOCOM,2004.
[101]Zhenyun Zhuang,Yunhao Liu,and Li Xiao.Building a Scalable Bipartite P2P Overlay Network.18th International Parallel and Distributed Processing Symposium (IEEE IPDPS) 2004,Santa Fe,New Mexico,USA.
[102]Irwin King,Cheuk Hang Ng,Ka Cheung Sia.Distributed Content-Based VisualInformation Retrieval System on Peer-to-Peer Networks.ACM Transactions on Information Systems(TOIS) 2004;22(3):477-501.
[103]黄维维 黄铭钧 陈建利 王晓宇 凌波 周傲英,一种基于自配置策略的新型Peer-to-Peer平台系统.软件学报2003,14:237-246.
[104]Murali Krishna Ramanathan,Vana Kalogeraki,Jim Pruyne.Finding Good Peers in Peer-to-Peer Network.IPDPS 2002.
[105]Marcelo Werneck Barbosa,Melissa Morgado Costa,Jussara M.Almeida,Virgilio A.F.Almeida.Using Locality of Reference to Improve Performance of Peer-to-Peer Applications.ACM SIGSOFT Software Engineering Notes archive 2004:216-227.
[106]Kunwadee Sripanidkulchai,Bruce Maggs,Hui Zhang.Efficient Content Location Using Interest-Based Locality in Peer-to-Peer System.IEEE INFOCOM 2003.
[107]Xiaomei Liu,Li Xiao,Andrew Kreling,Yunhao Liu.Optimizing Overlay Topology by Reducing Cut Vertices.NOSSDAV:ACM,2006.
[108]F.Buckley,M.Lewinter,ed.A Friendly Introducation to Graph Theory,2002.
[109]H.Wang,T.Lin.On Efficiency in Searching Networks.IEEE INFOCOM 2005.
[110]For S.Servetto and G.Barenechea.Constrained Random Walks on Random Graphs:Routing Algorithms for Large Scale Wireless Sensor Networks.1st ACM International Workshop on Wireless Sensor Networks and Applications(WSNA) 2002.
[111]A.Iamnitchi,M.Ripeanu,I.Foster.Small-World File sharing Communities.IEEE INFOCOM 2004.
[112]T.Bu,D.Towsley.On Distinguishing between Internet power law topology generators.IEEE INFOCOM 2004.
[113]F.Stann,J.Heidemann,R.Shroff,M.Z.Murtaza.RBP:Robust Broadcast Propagation in Wireless Networks.SenSys:ACM,2006.
[114]J.Watts,Steven H.Strogatz.Collective Dynamics of "Small-World" Networks.Nature 393 1998:440-442.
[115]Watts DJ,Strogatz SH.Collective dynamics of small-world networks.Nature 1998.
[116]a free-scale topology product algorithm:http://arxiv.org/abs/cond-mat/0106096,http://arxiv.org/pdf/cond-mat/0408391
[117]王意洁 肖侬 任浩.数据网格及其关键技术研究.计算机研究发展2002;11.
[118]globus website:http://www.globus.org
[119]SRB website:http://www.sdsc.edu/srb/
[120]A.Iamnitchi,I.Foster.A peer-to-peer approach to resource location in Grid environments,2003.
[121]A.Andrzejak,Z.Xu.Scalable,efficient range queries for Grid information services.IEEE P2P 2002.
[122]PIER website:http://pier.cs.berkeley.edu/.
[123]D.Oppenheimer,J.Albrecht,D.Patterson,A.Vahdat.Distributed resource discovery on planetlab with SWORD.First Workshop on Real,Large Distributed Systems(WORLDS) 2004.
[124]Planet-Lab website:http://www.planet-lab.org/.
[125]Qi Xia,Ruijun Yang,Weinong Wang,De Yang.Fully Decentralized DHT based Approach to Grid Service Discovery using Overlay Networks.The Fifth International Conference on Computer and Information Technology(CIT'05),2005.
[126]Mario Schlosser,Michael Sintek,Stefan Decker,Wolfgang Nejdl.HyperCup-Hypercubes,ontologies and Efficient Search on P2P Networks.AP2PC,2002.
[127]Mario Schlosser,Michael Sintek,Stefan Decker,Wolfgang Nejdl.Ontology-Based Search and Broadcast in HyperCup.ISWC,2002.
[128]Mario Schlosser,Michael Sintek,Stefan Decker,Wolfgang Nejdl.HyperCup-Shaping Up Peer-to-Peer Network.DISC,2002.