网格资源发现关键技术研究
摘要
网格是当前分布式计算研究领域中的热点。如同Web起源于共享物理实验数据的需求那样,网格的研究起源于现代科学探索中对于高性能计算机、大型数据库、昂贵科学仪器灵活共享的要求。网格概念中体现出来的灵活、按需的异构资源集成的思想非常符合人们对更高层次资源共享的需求,因而在分布式超级计算、高吞吐率计算及数据密集型计算等领域得到接受和发展。
网格研究的核心是网格资源管理,而网格资源发现则是网格资源管理中的一个基本组成部分,是把资源和资源请求者联系起来的重要环节,是实现网格资源灵活按需调度的重要保障。
与传统的分布式系统相比,网格中集成的资源规模更大、种类更丰富,且分属于不同组织,参与网格的各个节点往往拥有不同的利益和资源管理策略。因此良好的可扩展性、分布性、自适应性等特点是大规模网格资源管理对资源发现技术的必然要求。然而,目前网格系统中的资源发现机制基本上仍是集中式的,尽管这种方式实现简单,但是随着网格规模的增大、网格资源种类及数量的增加,集中式的资源发现方式逐渐成为性能瓶颈,出现了可扩展性差的不足。因此,网格资源发现方法面临着新的挑战。
另外,随着开放网格服务体系结构OGSA(Open Grid Service Architecture)的提出,网格中的资源以服务的形式呈现给用户,网格资源发现的过程体现为网格服务的发现过程。现有的基于关键字的网格服务发现方式存在灵活性差、查全率和查准率低等缺点,在此基础上改进的基于语义的网格服务发现方式虽然在灵活性及查全率和查准率等方面得到了提高,但是存在服务发现时间耗费大的问题。
针对上述现有网格资源发现技术的不足,本文致力于解决集中式资源发现技术无法适应网格规模的增长、可扩展性差及传统网格服务发现技术查全率和查准率不高、服务发现时间耗费大等问题,主要创新工作包括:
(1)在提高网格资源发现技术的查找效率及成功率等性能指标方面,提出了一种基于自适应k近邻聚类的网格资源发现方法。
该方法使用了一种两层层叠网络来表示网格资源节点间的逻辑关系,其基本思想是采用自适应k近邻聚类算法对具有相似特征的资源进行聚类,并建立相应的类间消息转发机制,以此缩减资源发现的搜索规模和资源信息更新的扩散范围,从而提高资源发现性能。同时,我们还构造了一个用于研究网格资源发现方法性能的网格仿真环境,设计并实现了相应的仿真引擎,利用仿真对本文所提出的基于自适应k近邻聚类的网格资源发现方法和现有的其它网格资源发现方法进行了定量比较。仿真结果表明,本文所提出的网格资源发现方法具有较好的资源发现性能,能适应网格规模变化的需要,具有较高的资源发现效率和较好的自适应性。
(2)在增强网格资源发现技术的可扩展性方面,提出了一种基于P2P方法的网格资源发现方法。
为了适应网格系统的规模变化及资源动态性的特点,实现高效非集中式的网格资源发现,本文将P2P方法应用到网格资源发现领域,提出了一种基于P2P方法的网格资源发现方法。该方法使用二叉树来管理资源信息,网格中的每个节点都可以充当资源信息节点,都负责管理一部分资源信息,同时它还维护一张路由表,以便将资源请求转发给相应的邻居节点。在此基础上,本文还给出了网格资源信息的分配算法及资源信息更新算法,并对资源信息更新算法所产生的消息开销进行了研究;针对用户的资源请求,提出了一种与之相适应的区间查询算法,并对该算法进行了分析。实验结果表明该资源发现方法既能避免集中式资源发现机制中资源信息服务器负载过重,容易造成单点失效的问题,又具有良好的可扩展性。
(3)在提高服务发现的查全率和查准率及满足用户对服务请求的实时性要求方面,提出了一种基于本体的网格服务匹配方法。
针对传统的基于关键字匹配的网格服务发现方法存在灵活性差、查全率低等缺点及现有的基于语义的服务匹配方法耗时高的不足,本文提出了一种基于本体的网格服务发现方法。该方法使用本体描述语言OWL-S来描述网格服务,体现了网格服务的语义信息。在服务匹配之前,该方法利用描述逻辑推理机自动对网格服务本体中的概念和已经发布的网格服务进行分层预处理,并采用有向无环图来表示概念间和服务间的层次关系。对于用户提交的服务请求,在有向图上进行服务匹配比直接利用逻辑推理机进行服务匹配更为高效,能很好的满足用户对服务请求的实时性要求。实验结果表明,该方法在查全率和查准率等性能评价指标上比基于关键字匹配和其它基于语义的匹配方法要高;与直接基于OWL推理机的服务匹配方法相比,该方法以服务发布阶段构造概念分层和服务分层的时间开销为代价,换取了服务查找阶段用户请求响应时间的大幅度提高,更能满足用户对服务请求的实时性要求。
Grid is a hot topic in distributed computing nowadays. Just like Web, which is developed to meet the requirement of sharing scientific experimental datum at the beginning, Grid concept is motivated by the needs to share high-performance computer, large database and expensive instrument in modern scientificre research. The real and specific problems that underly the Grid concept are coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Since 1990s, considerable progress has been made on the construction of such an infrastructure, more over the Grid concept has been widely accepted and refined in many fields such as distributed supercomputing, high-throughput computing and data-intensive computing since then.
Resource discovery is a basic element in Grid resource management, which concerns discovering resources in Grid to meet the requirement of applications. Compared with traditional distributed systems, Grid aims to integrate much more resources of diverse varieties belonging to different organizations. In addition, providers and consumers of Grid resources usually have different or even contradictory interests. With further development of Grid, centralized Grid resource discovery schemes give birth to potential scalability problems. Therefore, in order to survive the dynamic and larger-scale Grid environment, resource discovery should be decentralized and should not rely on centralized coordination and control.
In addition, with the advancement of the concept of OGSA, resources in Grid are presented to users by the form of services. Therefore, Grid resource discovery show itself as Grid services discovery. The existing keyword-based Grid service discovery methods have some shortages, such as poor flexibility, low precision and low recall. Although the improved methods make some progress in the aspects of flexibility, precision and recall, it still has high time cost on service discovery.
Focusing on scalable and efficient decentralized resource discovery in Grid environment, this paper makes following contributions:
1. Proposes a novel grid resource discovery method based on adaptive k-Nearest Neighbors clustering, which improves the resource query efficiency and succeed rate.
This method uses a two-layer overlay to describe the logical relations between resource nodes. In our method, a class is formed by a collection of nodes with some similarities in their characteristics. Each class is managed by a leader and consists of members that serve as workers. At the same time, to reduce the resource search scope and the propagation scope when updating resource information, we propose a corresponding efficient requests dispatch mechanism. A simulation environment is constructed to study Grid resource discovey performance, and a simulation engine is also implemented. The experimental results show that our method achieves better scalability and efficient lookup performance.
2. Proposes a P2P-based Grid resource discovery method with well scalablity.
In order to suit the development of the Grid scale and resource dynamics, the P2P method is adopted, and a decentralized resource discovery method with well scalability is presented. This method uses binary tree to manage data, each node in Grid is responsible for managing a part of resource information. It maintains a routing table to guarantee that the search can start at any node as well. At the same time, an algorithm for Grid resource information manangemt is presented, and the message cost of resource information update is also analyzed. For users' resource request, a range query algorithm is proposed and analyzed. The experimental results show that this method resolves many problems that exist in centralized mechanism, such as poor scalability, heavy load on resource information server and single point failure.
3. Proposes an ontology-based Grid service discovery method, which improves precison and recall, and reduce the responding time of users' request.
To improve the efficiency of Grid service matching, a novel Grid service matching method based on ontology is presented. This method uses OWL-S to describe Grid service, which takes into account the service semantic information. Before matching Grid services, DL-reasoner is used to form concept hierarchy and service hierarchy. The experimental results show that compared with exsiting keyword-based methods and semantic methods, our method has better recall and precision. When compared with the methods based on reasoner directly, although our method has some shortages of time cost for constructing concept hierarchy and service hierarchy, the users' request responding time is notably reduced. Consequently, our method can better meet the needs of users.
网格研究的核心是网格资源管理,而网格资源发现则是网格资源管理中的一个基本组成部分,是把资源和资源请求者联系起来的重要环节,是实现网格资源灵活按需调度的重要保障。
与传统的分布式系统相比,网格中集成的资源规模更大、种类更丰富,且分属于不同组织,参与网格的各个节点往往拥有不同的利益和资源管理策略。因此良好的可扩展性、分布性、自适应性等特点是大规模网格资源管理对资源发现技术的必然要求。然而,目前网格系统中的资源发现机制基本上仍是集中式的,尽管这种方式实现简单,但是随着网格规模的增大、网格资源种类及数量的增加,集中式的资源发现方式逐渐成为性能瓶颈,出现了可扩展性差的不足。因此,网格资源发现方法面临着新的挑战。
另外,随着开放网格服务体系结构OGSA(Open Grid Service Architecture)的提出,网格中的资源以服务的形式呈现给用户,网格资源发现的过程体现为网格服务的发现过程。现有的基于关键字的网格服务发现方式存在灵活性差、查全率和查准率低等缺点,在此基础上改进的基于语义的网格服务发现方式虽然在灵活性及查全率和查准率等方面得到了提高,但是存在服务发现时间耗费大的问题。
针对上述现有网格资源发现技术的不足,本文致力于解决集中式资源发现技术无法适应网格规模的增长、可扩展性差及传统网格服务发现技术查全率和查准率不高、服务发现时间耗费大等问题,主要创新工作包括:
(1)在提高网格资源发现技术的查找效率及成功率等性能指标方面,提出了一种基于自适应k近邻聚类的网格资源发现方法。
该方法使用了一种两层层叠网络来表示网格资源节点间的逻辑关系,其基本思想是采用自适应k近邻聚类算法对具有相似特征的资源进行聚类,并建立相应的类间消息转发机制,以此缩减资源发现的搜索规模和资源信息更新的扩散范围,从而提高资源发现性能。同时,我们还构造了一个用于研究网格资源发现方法性能的网格仿真环境,设计并实现了相应的仿真引擎,利用仿真对本文所提出的基于自适应k近邻聚类的网格资源发现方法和现有的其它网格资源发现方法进行了定量比较。仿真结果表明,本文所提出的网格资源发现方法具有较好的资源发现性能,能适应网格规模变化的需要,具有较高的资源发现效率和较好的自适应性。
(2)在增强网格资源发现技术的可扩展性方面,提出了一种基于P2P方法的网格资源发现方法。
为了适应网格系统的规模变化及资源动态性的特点,实现高效非集中式的网格资源发现,本文将P2P方法应用到网格资源发现领域,提出了一种基于P2P方法的网格资源发现方法。该方法使用二叉树来管理资源信息,网格中的每个节点都可以充当资源信息节点,都负责管理一部分资源信息,同时它还维护一张路由表,以便将资源请求转发给相应的邻居节点。在此基础上,本文还给出了网格资源信息的分配算法及资源信息更新算法,并对资源信息更新算法所产生的消息开销进行了研究;针对用户的资源请求,提出了一种与之相适应的区间查询算法,并对该算法进行了分析。实验结果表明该资源发现方法既能避免集中式资源发现机制中资源信息服务器负载过重,容易造成单点失效的问题,又具有良好的可扩展性。
(3)在提高服务发现的查全率和查准率及满足用户对服务请求的实时性要求方面,提出了一种基于本体的网格服务匹配方法。
针对传统的基于关键字匹配的网格服务发现方法存在灵活性差、查全率低等缺点及现有的基于语义的服务匹配方法耗时高的不足,本文提出了一种基于本体的网格服务发现方法。该方法使用本体描述语言OWL-S来描述网格服务,体现了网格服务的语义信息。在服务匹配之前,该方法利用描述逻辑推理机自动对网格服务本体中的概念和已经发布的网格服务进行分层预处理,并采用有向无环图来表示概念间和服务间的层次关系。对于用户提交的服务请求,在有向图上进行服务匹配比直接利用逻辑推理机进行服务匹配更为高效,能很好的满足用户对服务请求的实时性要求。实验结果表明,该方法在查全率和查准率等性能评价指标上比基于关键字匹配和其它基于语义的匹配方法要高;与直接基于OWL推理机的服务匹配方法相比,该方法以服务发布阶段构造概念分层和服务分层的时间开销为代价,换取了服务查找阶段用户请求响应时间的大幅度提高,更能满足用户对服务请求的实时性要求。
Grid is a hot topic in distributed computing nowadays. Just like Web, which is developed to meet the requirement of sharing scientific experimental datum at the beginning, Grid concept is motivated by the needs to share high-performance computer, large database and expensive instrument in modern scientificre research. The real and specific problems that underly the Grid concept are coordinated resource sharing and problem solving in dynamic, multi-institutional virtual organizations. Since 1990s, considerable progress has been made on the construction of such an infrastructure, more over the Grid concept has been widely accepted and refined in many fields such as distributed supercomputing, high-throughput computing and data-intensive computing since then.
Resource discovery is a basic element in Grid resource management, which concerns discovering resources in Grid to meet the requirement of applications. Compared with traditional distributed systems, Grid aims to integrate much more resources of diverse varieties belonging to different organizations. In addition, providers and consumers of Grid resources usually have different or even contradictory interests. With further development of Grid, centralized Grid resource discovery schemes give birth to potential scalability problems. Therefore, in order to survive the dynamic and larger-scale Grid environment, resource discovery should be decentralized and should not rely on centralized coordination and control.
In addition, with the advancement of the concept of OGSA, resources in Grid are presented to users by the form of services. Therefore, Grid resource discovery show itself as Grid services discovery. The existing keyword-based Grid service discovery methods have some shortages, such as poor flexibility, low precision and low recall. Although the improved methods make some progress in the aspects of flexibility, precision and recall, it still has high time cost on service discovery.
Focusing on scalable and efficient decentralized resource discovery in Grid environment, this paper makes following contributions:
1. Proposes a novel grid resource discovery method based on adaptive k-Nearest Neighbors clustering, which improves the resource query efficiency and succeed rate.
This method uses a two-layer overlay to describe the logical relations between resource nodes. In our method, a class is formed by a collection of nodes with some similarities in their characteristics. Each class is managed by a leader and consists of members that serve as workers. At the same time, to reduce the resource search scope and the propagation scope when updating resource information, we propose a corresponding efficient requests dispatch mechanism. A simulation environment is constructed to study Grid resource discovey performance, and a simulation engine is also implemented. The experimental results show that our method achieves better scalability and efficient lookup performance.
2. Proposes a P2P-based Grid resource discovery method with well scalablity.
In order to suit the development of the Grid scale and resource dynamics, the P2P method is adopted, and a decentralized resource discovery method with well scalability is presented. This method uses binary tree to manage data, each node in Grid is responsible for managing a part of resource information. It maintains a routing table to guarantee that the search can start at any node as well. At the same time, an algorithm for Grid resource information manangemt is presented, and the message cost of resource information update is also analyzed. For users' resource request, a range query algorithm is proposed and analyzed. The experimental results show that this method resolves many problems that exist in centralized mechanism, such as poor scalability, heavy load on resource information server and single point failure.
3. Proposes an ontology-based Grid service discovery method, which improves precison and recall, and reduce the responding time of users' request.
To improve the efficiency of Grid service matching, a novel Grid service matching method based on ontology is presented. This method uses OWL-S to describe Grid service, which takes into account the service semantic information. Before matching Grid services, DL-reasoner is used to form concept hierarchy and service hierarchy. The experimental results show that compared with exsiting keyword-based methods and semantic methods, our method has better recall and precision. When compared with the methods based on reasoner directly, although our method has some shortages of time cost for constructing concept hierarchy and service hierarchy, the users' request responding time is notably reduced. Consequently, our method can better meet the needs of users.
引文
[1]Foster I,Kesselman C.The Grid:Blueprint for a Future Computing Infrastructure[M].San Francisco:Morgan Kaufmann Publishers,1999.
[2]Defanti T,Foster I,Papka M,Stevens R et al.Overview of the I-WAY:Wide Area Visual Supercomputing[J].International Journal of Supercomputing Applications,1996,Vol.10(2),pp.123-130.
[3]Foster I,Kesselman C.Globus:A Metacomputing Infrastructure Toolkit[J].International Journal of Supercomputing Applications,1997,Vol.11(2),pp.115-128.
[4]Grimshaw A,Wulf W,et al.The Legion Vision of a Worldwide Virtual Computer[J].Communications of the ACM,1997,Vol.40(1),pp.39-45.
[5]Foster I,Kesselman C,Nick J,Tuecke S.The physiology of the grid:An open grid services architecture for distributed systems integration[EB/OL].http://www.globus.org/research/papers/ogsa.pdf,2002.
[6]Global Grid Forum.http://www.gridforum.org.
[7]Vazhkudai S,Tuecke S,Foster I.Replica Selection in the Globus Data Grid[A].In:Proceedings of the First IEEE/ACM International Conference on Cluster Computing and the Grid[C].New York:IEEE Computer Society,2001,pp.106-113.
[8]Alleock W,Chervenak A,Foster I.The Data Grid:Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets[J].Journal of Network and Computer Application,2001,Vol.23,pp.187-200.
[9]Data Grid project,http://www.eu-datagrid.web.cern.cn/eu-datagrid.
[10]NASA Information Power Grid(IPG) Infrastructure.http://www.gloriad.org/gloriad/projects/project000053.html.
[11]李伟,徐志伟,唐志敏等.国家高性能计算环境的设计与实现[EB/OL].http://www.chinagrid.net/grid/paperppt/gct/dincg00.pdf.
[12]China National Grid.http://www.cngrid.org.
[13]徐志伟,李伟.织女星网格的体系结构研究.计算机研究与发展,2002,第39卷,第8期,pp.923-929.
[14]华中科技大学校园网格平台.http://gfid.hust.edu.cn/article_95.html
[15]Bote-Lorenzo M,Dimitriadis Y,G6mez-Sánchez E.Grid Characteristics and Uses:a Grid Definition[A].In:Proceedings of 1st European Across Grids Conference[C].Berlin:Springer-Verlag,2003,pp.291-298.
[16]Jarek Nabrzyski.Grid Resource Management-State of the Art and Future Trends[M].Boston:Kluwer Academic Publishers,2003.
[17]Mockapetris P.Domain names-concepts and facilities(RFC 1034)[EB/OL].http://www,faqs.org/rfcs/rfc 1034.html,1987.
[18]Vanthoumout K,Deconinck G,Belmans R.A Taxonomy for Resource Discovery[A].In:Proceedings of International Conference on Architecture of Computing Systems[C].Berlin:Springer-Verlay,2004.78-91.
[19]Napster Website.http://www.napster.com.
[20]Google Website.http://www.google.com.
[21]Gnutella Protocol Specification,version 0.4[EB/OL].http://www.clip2.corn/GnutellaProtocol04.pdf,2001.
[22]Heinz Johner,Larry Brown,Franz-Stefan Hinner.Understanding LDAP[EB/OL].http://jumpdoc.fz-juelich.de/doc_pdf/ldap/LDAP_Understanding.pdf.
[23]Keung H,Dyson J,Jarvis S.Predicting the Performance of Globus Monitoring and Discovery Service[A].In:Proceedings of 4th IEEE/ACM International Workshop on Grid Computing[C].New York:IEEE Computer Society,2003,pp.176-183.
[24]Zhang X,Freschl J,Schopf J.A Performance Study of Monitoring and Information Services for Distributed Systems[A].In:Proceedings of IEEE HPDC-12[C].New York:IEEE Computer Society,2003,pp.270-282.
[25]Bakker A,Amade E,Ballintijnq,et al.The Globe Distributed Network[A].In:Proceedings of USENIX Annual Conference[C].San Diego,2000,pp.141-152.
[26]Service Location Protocol[EB/OL].http://www.ietf.org/html.charters/svrloc-charter.html.
[27]Iamnitchi A,Foster I.On Fully Decentralized Resource Discovery in Grid Environments[A].In:Proceedings of 2nd IEEE/ACM International Workshop on G rid Computing[C].New York:IEEE Computer Society,2001,pp.51-62.
[28]Iamnitchi A.Resource Discovery in Large Resource-Sharing Environments[D].University of Chicago,2003.
[29]Donald McMullen,Randall Bramley,et al.Xport Collaboratory for X-ray Crystallography[EB/OL].http://www.iumsc.indiana.edu/XPort/xport_demo_talk.pdf
[30]Resource Specification Language[EB/OL].http://www.globus.org/gram/rsl_specl.html
[31]Roberto Chinnici,Martin Gudgin,Jean-Jacques Moreau,Sanjiva Weerawwarana.Web Services Description Language(WSDL) Version 1.2 Part 1:Core Language[EB/OL].http://www.w3.org/TR/wsdl12,2003.
[32]Jean-Jacques Moreau,Jeffrey Schlimmer.Web Services Description Language(WSDL) Version 1.2 Part 3:Bindings[EB/OL].http://w3.org/TR/wsdl 12-bingdings,2003.
[33]Martin Gudgin,Amy Lewis,Jeffrey Schlimmer.Web Services Description Language(WSDL) Version 1.2 Part 2:Message Patterns[EB/OL].http://w3.org/TR/wsdl 12-patterns,2003.
[34]Klyne G,Carroll J.Resource Description Framework(RDF):Concepts and Abstract Syntax[EB/OL].http://www.w3.org/TR/rdfconcepts/,2004.
[35] Uniform Resource Identifier (URI) Activity Statement[EB/OL].http://www.w3.org/Addressing/Activity.
[36] Raman R, Livny M, Solomon M. Matchmaking: distributed resource management for High throughput computing[A]. In: Proceedings of the 7th IEEE Symposium on High Performance Distributed Computing[C]. New York: IEEE Computer Society, 1998, pp.140-146.
[37] Ratnasamy S, Francis P, Handley M, et al. A scalable content addressable network[A]. In: Proceedings of ACM SIGCOMM[C]. New York: ACM Press,2001,pp.161-172.
[38] Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to -peer lookup service for Internet applications[A]. In: Proceedings of the ACM SIGCOMM[C]. New York: ACM Press, 2001, pp. 160-177.
[39] Zhao B Y, Kubiatowicz J D, Joseph A D. Tapestry: an infrastructure for fault resilient wide-area location and routing[R]. Technical Report UCB//CSD-01-1141,U.C. Berkeley, April 2001.
[40] Rowstron A, Druschel P. Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer system[A]. In: Proceedings of IFIP/ACM Middleware 2001[C]. Berlin: Springer-Verlay, 2001, pp.329-350.
[41] Iamnitchi A, Ripeanu M, Foster I. Locating data in ( small world?) peer-to-peer scientific collaborations [A]. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02)[C]. Berlin: Springer-Verlay, 2002, pp.232- 241.
[42] Lv Q, Cao P, Cohen E, et al. Search and replication in unstructured peer-to-peer networks[A]. In Proceedings of the 16th ACM International Conference on Super computing (ICS 2002)[C]. New York: ACM Press, 2002, pp.84-95.
[43] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems[A]. In: Proceedings of INFO COM03[C]. New York: IEEE Computer Society, 2003, pp.134-146.
[44] Argonne National Laboratory. Globus Toolkit~(?) 2.0[EB/OL].http://www.globus.Org/toolkit/downloads/2.0/
[45] The Globus Toolkit 3 Programmer's Tutoria[EB/OL].http://gdp.globus.org/gt3-tutorial/.
[46] Tuecke S, Czajkowski K, Foster I, et.al. Open Grid Service Infrastructure(OGSI),Version 1.0[EB/OL]. http://www.ggf.org/ogsi-wg.
[47] Foster I. Globus Toolkit Version 4: Software for Service-Oriented Systems[A]. In:Proceedings of NPC 2005[C]. Berlin: Springer-Verlag, 2005, pp.2-13.
[48] Karl C. The WS-Resource framework[EB/OL].http://www.globus.org/ wsrf/specs/ws-wsrf.pdf, 2004-9-2.
[49] Czajkowski K, Fitzgerald S, Foster I, et al. Grid Information Services for Distributed Resource Sharing[A]. In: Proceedings of 10th IEEE International Symposium on High-Performance Distributed Computing [C]. New York: IEEE Computer Society, 2001, pp. 181 -194.
[50] Jake Wu. GT 3.2 Index Service (MDS3) Evaluation[EB/OL]._________________ http://forge.nesc.ac.uk/,2004.
[51]Jennifer M.Schopf,et al.Carl Kesselman.Monitoring and Discovery in a Web Services Framework:Functionality and Performance of the Globus Toolkit's MDS4[R].Argonne National Laboratory Technical Report #ANL/MCS-P1248-0405.http://www-unix.mcs.anl.gov/-schopf/Pubs/mds-sc05.pdf.
[52]Thain D,Tannenbaum T,Livny M.Condor and the Grid.In:Berman F,Hey A,Fox G editors.Grid Computing:Making The Global Infrastructure a Reality,John Wiley,2003.
[53]Basney J,Livny M,Mazzanti P.Harnessing the Capacity of Computational Grids for High Energy Physics[A].In:Proceedings of the International Conference on Computing in High Energy and Nuclear Physics(CHEP 2000)[C],Italy,2000.
[54]Raman R,Livny M,Solomon M.Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching[A].In:Proceedings of IEEE HPDC-12[A].New York:IEEE Computer Society,2003,pp.80-89.
[55]Basney J,Livny M.Managing Network Resources in Condor[A].In:Proceedings of IEEE HPDC-9[C].New York:IEEE Computer Society,2000,pp.298-299.
[56]Chapin S,Katramatos D,Karpovich J.The Legion Resource Management System[A].In:Proceeding of the 5th Workshop on Job Scheduling Strategies for Parallel Processing(JSSPP'99)[A].Berlin:Springer-Verlay,1999,pp.162-178.
[57]Sujata B,Sujoy B,Shishir G.Scalable Grid Service Discovery Based on UDDI[A].In:Proceedings of International Workshop on Middleware for Grid Computing(MGC 2005)[C].New York:ACM Press,2005,pp.1-6.
[58]Brett Sinclair,Andrzej Goscinski,and Robert Dew.Enhancing UDDI for Grid Service Discovery by Using Dynamic Parameters[A].In:Proceedings of International Conference on Computational Science and its Applications(ICCSA 2005)[C].Berlin:Springer-Verlay,2005,pp.49-59.
[59]Beniamino Di Martino.An Ontology Matching Approach to Semantic Web Services Discovery[A].In:Proceedings of International Symposium on Parallel and Distributed Processing and Application(ISPA 2006)[C].Berlin:Springer-Verlay,2006,pp.550-558.
[60]Le Duy Ngan,Angela Goh.Matching Semantic Web Services Using Different Ontologies[A].In:Proceedings of ICWE 2005[C].Berlin:Springer-Verlay,2005,pp.302-307.
[61]Sonia Ben Mokhtar,Anupam Kaul Nikolaos Georgantas.Towards Efficient Matching of Semantic Web Service Capabilities[A].In:Proceedings of International Workshop on Web Services Modeling and Testing(WS-MaTe 2006)[C].2006,pp.138-152.
[62]胡建强.服务发现若干关键技术研究[D].长沙:国防科学技术大学.2005.
[63]UDDI.org.UDDI Spec TC,Version 3.0.2[EB/OL].http://www.uddi.org/pubs/uddi-v3.html,2004.
[64]Massimo P,Takahiro K,et al.Importing the Semantic Web in UDDI[A].In:Proceedings of Web Service,E-business and Semantic Web Workshop(CAiSE Workshop)[C].Berlin:Springer-Verlay,2002,pp.225-236.
[65]The DAML Service Coalition.DAML-s:Semantic Markup for Web Service[EB/OL].http://www.daml.org/services/daml-s/0.7/daml-s.pdf.
[66]Hung-Chang Hsiao,Chung-Ta King.Neuron-A Wide-Area Service Discovery Infrastructure[A].In:Proceedings of International Conference on Parallel Processing(ICPP 2002)[C].New York:IEEE Computer Society,2002,pp.455-462.
[67]The Tornado project,www.tomadoproject.com.
[68]D.Clark.Face-to-Face with Peer-to-Peer Networking[J].IEEE Computer,2001,Vol.34(1),pp.18-21.
[69]Dejan S.Milojicic,Vana Kalogeraki,et al.HP Laboratories Palo Alto[R].Tech.Rep.HPL-2002-57,March 2002.
[70]Detlef Schoder,Kai Fischbach.Peer-to-Peer Prospects.Communications of the ACM,2003,Vol.46(2),pp.27-29.
[71]Oram A.Peer-to-Peer:Harnessing the Power of Disruptive Technologies[M].O'Reilly Media,2001.
[72]Napster project,http://www.napster.com.
[73]Lime Wire Project.http://www.limewire.com.
[74]Kazza project,http://www.kazza.com.
[75]Anderson D;SETI@Home:An Experiment in Public Resource Computing System[J].Communications of the ACM,2002,Vol.45(11),pp.56-61.
[76]Talia D and Trunfio P.Towards A Synergy Between P2P and Grids[J].IEEE Internet Computing,2003,Vol.7(4),pp.94-95.
[77]李东升.基于对等模式的资源定位技术研究[D].长沙:国防科学技术大学.2005.
[78]Clarke I,Sandberg O,Wiley B,et al.Freenet:A Distributed Anonymous Information Storage and Retrieval System[A].In:Proceedings of ICSI Workshop on Design Issues in Anonymity and Unobservability[C].Berlin:Springer-Verlay,2000,pp.46-66.
[79]Markatos E P.Tracing a Large-scale Peer-to-Peer System:An Hour in the Life of Gnutella[A].In:Proceedings of Second International Symposium on Cluster Computing and the Grid[C].Berlin:Springer-Verlay,2002,pp.65-65.
[80]Gnutella:To the Bandwidth Barrier and Beyond[EB/OL].http://www.clip2.com/gnutella.html,2001.
[81]FastTrack Product Description[EB/OL].http://www.fasttrack.nu/index_int.html,2002.
[82]Yang B,Garcia-Molina H.Efficient Search in Peer-to-Peer Networks[A].In:Proceedings Of the 22nd IEEE International Conference on Distributed Computing Systems(ICDCS)[C].New York:IEEE Computer Society,2002,pp.5-14.
[83]Kalogeraki V,Gunopulos D,Zeinalipour-yazti D.A Local Search Mechanism for Peer-to-Peer Networks[A].In:Proceedings of the 11th ACM Conference on Information and Knowledge Management(CIKM'02)[C].New York:ACM Press,2002,pp.300-307.
[84]Ratnasamy S,Shenker S,Stoica I.Routing Algorithms for DHTs:Some Open Questions[A].In:Proceedings of First International Workshop on Peer-to-Peer Systems(IPTPS'02)[C].Berlin:Springer-Verlay,2002,pp.45-52.
[85]Had Balakrishnan,M.Frans Kaashoek,David Karger,et al.Looking up Data in P2P Systems[J].Communications of the ACM,2003,Vol.46(2),pp.43-48.
[86]Sean Rhea,Chris Wells,Patrick Eaton,et al.Maintenance-Free Global Data Storage[J].IEEE Internet Computing,2001,Vol.5(5),pp.40-49.
[87]Frank Dabek,M.Frans Kaashoek,David Karger,et al.Wide-area Cooperative Storage with CFS[A].In:Proceedings of ACM Symposium on Operating Systems Principles(SOSP 2001)[C].New York:ACM Press,2001,pp.202-215.
[88]Druschel P,Rowstron A.PAST:A Large-scale,Persistent Peer-to-Peer Storage Utility[A].In:Proceedings of HotOS Ⅷ,Schoss Elmau[C].New York:IEEE Computer Society,2001,pp.65-70.
[89]Zhuang S Q,Zhao B Y,Joseph A D,et al.Bayeux:An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination[A].In:Proceedings of the 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video(NOSSDAV 2001)[C].New York:ACM Press,2001,pp.11-20.
[90]Miguel Castro,Peter Druschel,Anne-Made Kermarrec and Antony Rowstron.Scribe:A Large-scale and Decentralized Application-level Multicast Infrastructure[J].IEEE Journal on Selected Areas in Communications(JSAC),2002,Vol.20(8),pp.1489-1499.
[91]Russ Cox,Athicha Muthitacharoen,Robert T.Morris.Serving DNS using a Peer-to-Peer Lookup Service[A].In:Proceedings of First International Workshop on Peer-to-Peer Systems(IPTPS'02),Berlin:Springer-Verlay,2002,pp.155-165.
[92]Huebsch R,Chun B,Hellerstein J M,et al.The Architecture of PIER:An Internet-Scale Query Processor[A].In:Proceedings of Conference on Innovative Data Systems Research(CIDR 2005)[C].New York:ACM Press,2005,pp.28-43.
[93]Alon Y.Halevy,Zachary G.Ives,Jayant Madhavan,et al.The Piazza Peer Data Management System[J].IEEE Transactions on Knowledge and Data Engineering,2004,Vol.16(7),pp.787-798.
[94]Eastlake D,Jones P.RFC3174:US Secure Hash Algorithm 1(SHA-1)[EB/OL].http://www.faqs.org/rfcs/rfc3174.html,2001.
[95]Petar Maymounkov,David Mazieres.Kademlia:A Peer-to-peer Information System Based on the XOR Metric[A].In:Proceedings of First International Workshop on Peer-to-Peer Systems(IPTPS'02)[C].Berlin:Springer-Verlay,2002,pp.153-161.
[96]Malkhi D,Naor M,Ratajczak D.Viceroy:A Scalable and Dynamic Lookup Network[A].In:Proceedings of 21st ACM Symposium on Principles of Distributed Computing (PODC)[C]. New York: ACM Press, 2002, pp.367-389.
[97] Kaashoek F, Karger D R. Koorde: A Simple Degree-optimal Hash Table[A]. In:Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03)[C]. Berlin: Springer-Verlay, 2003,pp.98-107.
[98] Abhishek Kumar, Shashidhar Merugu, Jun Jim Xu, et al. Ulysses: A Robust,Low-diameter, Low-latency Peer-to-Peer Network[A]. In: Proceedings of 11th IEEE International Conference on Network Protocols (ICNP 2003)[C]. New York:IEEE Computer Society, 2003, pp.258-267.
[99] Matthew Harren, Joseph M. Hellerstein, Ryan Huebsch, et al. Complex Queries in DHT-based Peer-to-Peer Networks[A]. In: Proceedings of First International Workshop on Peer-to-Peer Systems (IPTPS'02)[C]. Berlin: Springer-Verlay,2002, pp.242-259.
[100] Chunqiang Tang, Zhichen Xu, Sandhya Dwarkadas. Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks[A]. In: Proceedings of annual conference of the Special Interest Group on Data Communication(SIGCOMM 2003)[C]. Karlsruhe: ACM Press, 2003, pp.175-186.
[101] Patrick Reynolds and Amin Vahdat. Efficient Peer-to-Peer Keyword Searching[A]. In: Proceedings of Middleware'2003[C]. Berlin: Springer-Verlay,2003,pp.21-40.
[102] Shuming Shi, Guangwen Yang, Dingxing Wang, et al. Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning[A]. In: Proceedings of 3rd International Workshop on P2P Systems (IPTPS'04)[C]. Berlin:Springer-Verlay, 2004, pp. 151 -161.
[103] Austin Clements, Dan Ports, David Karger. Arpeggio: Metadata Searching and Content Sharing with Chord[A]. In: Proceedings of 4th International Workshop on Peer-to-Peer Systems (IPTPS'05)[C]. Berlin: Springer-Verlay, 2005, pp.58-68.
[104] Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi. Approximate Range Selection Queries in Peer-to-Peer Systems[A]. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR 2003)[C]. New York: ACM Press, 2003, pp.572-584.
[105] Cristina Schmidt, and Manish Parashar. Enabling Flexible Queries with Guarantees in P2P Systems[J]. IEEE Internet Computing, 2004, Vol.8(3),pp.19-26.
[106] Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, et al. A Case Study in Building Layered DHT Applications[A]. In: Proceedings of annual conference of the Special Interest Group on Data Communication (SIGCOMM 2005)[C].Philadelphia: ACM Press, 2005, pp.97-108.
[107] Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Seshan. Mercury: Supporting Scalable Multi-attribute Range Queries[A]. In: Proceedings of annual conference of the Special Interest Group on Data Communication (SIGCOMM 2004)[C]. Oregon: ACM Press, 2004, pp.1034-1056.
[108] Oppenheimer D, Albrecht J, Patterson D, et al. Distributed Resource Discovery on Planetlab with SWORD[A]. In: Proceedings of the First Workshop on Real Large Distributed Systems(WORLDS'04)[C].Santa Fe,New Mexico,USA,December 2004,pp.198-203.
[109]Chander A,Dawson S,Lincoln P et al.NEVRLATE:Scalable Resource Discovery[A].In:Proceedings of IEEE/ACM International Conference on Cluster and Computational Grid(CCGrid 2002)[C].CA:IEEE Computer Society,2002,pp.382-388.
[110]Li W,Xu Z,Dong F,et al.A Grid Resource Discovery Model based on the Routing-Transferring Method[A].In:Proceedings of 3rd IEEE/ACM International Workshop On Grid Computing 2002.Berlin:Springer-Vedag,2002,pp.145-156.
[111]李伟,徐志伟,卜冠英等,网格环境下一种有效的资源查找方法[J].计算机学报,2003,第26卷,第11期,PP.1546-1549.
[112]Crespo A,Garcia H.Routing Indices for Peer-to-Peer Systems[A].In:Proceedings of the 22nd International Conference on Distributed Computing Systems(ICDCS'02)[C].Arizona:IEEE Computer Society,2002,pp.23-34.
[113]Gupta I,Birman K,Linga P,Kelips:Building an Efficient and Stable P2P DHT through Increased Memory and Background overhead[A].In:Proceedings of the 2nd International Workshop on Peer-to-Peer Systems(IPTPS'03).Berlin:Springer-Verlag,2003,pp.160-169.
[114]边肇祺,张学工等.模式识别[M].北京:清华大学出版社,1999.
[115]Kermarre A,Massoulie L,Ganesh A.Reliable Probabilistic Communication in Large-scale Information Dissemination Systems[R].Microsoft Research Cambridge,Tech Rep:MST-TR-2000-105,2000.
[116]Schlosser M,Sintek M,Decker S,et al.A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services[A].In:Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing(P2P 2002)[C].Link(o|¨)ping,IEEE Computer Society,2002,pp.104-111.
[117]Huang L,Wu Z,Pan Y.A Scalable and Effective Architecture for Grid services'Discovery[A].In:Proceedings of the First Workshop on Semantics in Peer-to-Peer and Grid Computing 2003,pp.103-115.
[118]Iamnitchi A,Foster I.A Peer-to-Peer Approach to Resource Discovery in Grid Environments[A].In:Proceedings of the 11th Symposium on High Performance Distributed Computing[C].New York:IEEE Computer Society,2002,pp.360-374.
[119]Balazinska M,Balakrishnan M,Karger D.INS/Twine:A Scalable Peer-to-Peer architecture for Intentional Resource Discovery[A].In:Proceedings of International Conference on Pervasive Computing[C].Berlin:Springer-Vedag,2002,pp.195-210.
[120]Winoto W,Schwartz E,Balakrishnan H,et al.The Design and Implementation of an Intentional Naming System[J].Operating Systems Review,1999,Vol.34(5),pp.186-201.
[121]Andrzejak A,Xu Z.Scalable,Efficient Range Queries for Grid Information Services[A]. In: Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing(P2P 2002)[C]. Linkoping, IEEE Computer Society,2002, pp.33-40.
[122] Lv Q, Cao P, Cohen E. Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of ACM SIGMETRICS 2002(C). pp.84-95.
[123] Laherrere J, Sornete D. Stretched exponential distributions in Nature and Economy: 'Fat tails' with characteristic scales[J]. European Physical Journals,1998(B2),pp.525-539.
[124] Jovanovic M. Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella[D]. University of Cincinnati, 2001.
[125] Ripeanu M, Foster I. Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems[A]. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems(IPTPS'02)[C]. Berlin: Springer-Verlay, 2002,pp.85-93.
[126] Ripeanu M. Peer-to-peer architecture case study: Gnutella network[A]. In:Proceedings of Int'l Conference on Peer-to-Peer Computing(P2P 2001)[C].Sweden: IEEE Computer Press, 2001, pp.99-101.
[127] Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. ACM SIGCOMM Computer Communication Review, 1999,Vol.29(4),pp.251-262.
[128] Vaucher J, Kropf P, Babin G. Experimenting with Gnutella Communities[A]. In:Proceedings of 4th International Conference on Distributed Communities on the Web(DCW2002)[C]. Berlin: Springer-Verlag, 2002, pp.84-99.
[129] Strogatz S, Wats D. Characteristics of Small World Networks[J]. Nature, 1998,Vol.393(6), pp.440-442.
[130] Palmer C, Steffan J. Generating network topologies that obey power-law[A]. In:Proceedings of the IEEE Global Telecommunication Conference (GLOBECOM 2000)[C]. San Francisco: IEEE Computer Society, 2000, pp.434-438.
[131] Dou W, Jia Y, Wang H, et al. A P2P Approach for Global Computing[A]. In:Proceedings of the IPDPS03[C]. New York: IEEE Computer Society, 2003,pp.248-249.
[132] Khambatti M, Ryu K, Dasgupta P. Peer-to-Peer Communities: Formation and Discovery [A]. In: Proceedings of 14th IASTED Conference on Parallel and Distributed. Computing Systems (PDCS), Cambridge, Massachusetts, November 2002,pp.166-173.
[133] Buyya R, Murshed M. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing[J].Journal of Concurrency and Computation: Practice and Experience, 2002, Vol.14(13-15), pp.1175-1220.
[134] eMule project. http://www.emule-project.net/
[135] Carlo Mastroianni, Domenico Talia and Oreste Verta. A P2P Approach for Membership Management and Resource Discovery in Grids[A]. In: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05)[C]. Nevada: IEEE Computer Society, pp.168-174.
[136] Cheng Zhu, Zhong Liu, Weiming Zhang, Weidong Xiao, Jincai Huang. An Efficient Decentralized Grid Service Discovery Approach based on Service Ontology[A]. In: Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence(WI'04)[C]. Beijing: IEEE Computer Society, 2004,pp.570-573.
[137] Manfred Hauswirth, Roman Schmidt. An overlay network for resource discovery in Grids[A]. In: Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA'05)[C]. Copenhagen: IEEE Computer Society, 2005, pp.343-348.
[138] Abhishek Gupta, Divyakant Agrawal. Distributed Resource Discovery in Large Scale Computing Systems[A]. In: Proceedings of the 2005 Symposium on Applications and the Internet (SAINT'05). Trento: IEEE Computer Society, 2005,pp.320-326.
[139] Al-Dmour N A, Teahan W J. Peer-to-peer Protocols For Resource Discovery in the Grid[A]. In: Proceeding of Parallel and Distributed Computing and Networks[C]. Innsbruck, 2005, pp.319-324.
[140] Adeep Singh Cheema. Structured Naming and Peer-to-Peer Discovery of Resources in Grid Applications[D]. University of Illinois, 2005.
[141] Raman R, Livny M, Solomon M. Matchmaking: Distributed resource management for high throughput computing[A]. In: Proceedings of the 7th IEEE High Performance Distributed Computing (HPDC)[C]. New York: IEEE Computer Society, 1998, pp.40-147.
[142] Domenico Talia, Paolo Trunfio. Web Services for Peer-to-Peer Resource Discovery on the Grid[A]. DELOS Workshop: Digital Library Architectures,2004, pp.73-84.
[143] Balazinska M, Balakrishnan M, Karger D. INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery[A]. In: Proceedings of International Conference on Pervasive Computing[C]. Berlin: Springer-Verlag,2002, pp. 195-210.
[144] Winoto W, Schwartz E, Balakrishnan H, et al. The Design and Implementation of an Intentional Naming System[A]. In: Proceedings of 17th ACM SOSP. Kiawah Island, 1999, pp. 186-201.
[145] Karl Aberer. P-Grid: A Self-Organizing Access Structure for P2P Information Systems[A]. In: Proceedings of the Sixth International Conference on Cooperative Information Systems[C]. Berlin: Springer-Verlag, 2001, pp.179-194.
[146] McMullen D, Bramley R, et al. Xport Collaborator for X-ray Crystallography [EB/OL].http://www.iumsc.indiana.edu/XPort/xport_demo_talk.pdf.
[147] Ye Zhu, Junzhou Luo, and Teng Ma. Dividing Grid Service Discovery into 2-Stage Matchmaking[A]. In: Proceedings of International Symposium on Parallel and Distributed Processing and Application (ISPA 2004)[C]. Berlin:Springer-Verlag, 2004, pp.372-381.
[148]Fei Liu,Fan-yuan Ma,Ming-lu Li,and Lin-peng Huang.A Framework for Semantic Grid Service Discovery[A].In:Proceedings of Fifth International Conference on Web Information Systems Engineering(WISE2004)[C].Berlin:Springer-Verlag,2003,pp.3-10.
[149]Simone.A.Ludwig,S.M.S.Reyhani.Introduction of semantic matchmaking to Grid computing[J].Journal of Parallel and Distributed Computing,2005,Vol.65(12),pp.1533-1541.
[150]Simone.A.Ludwig,Peter van Santen.A Grid Service Discovery Matchmaker based on Ontology Description[EB/OL].http://datatag.web.cern.ch/datatag/papers/euro web2002.pdf.
[151]Le Duy Ngan and Angela Goh.Matching Semantic Web Services Using Different Ontologies[A].In:Proceedings of International Conference on Web Engineering(ICWE 2005)[C].Berlin:Springer-Verlag,2005,pp.302-307.
[152]Beniamino Di Martino.An Ontology Matching Approach to Semantic Web Services Discovery[A].In:Proceedings of International Symposium on Parallel and Distributed Processing and Application(ISPA 2006)[C].Berlin:Springer-Verlag,2006,pp.550-558.
[153]何儒汉,金海,廖振松,章勤.ChinaGrid图像处理网格平台中的语义信息服务研究[J].计算机研究与发展,2006,第43卷,第5期,pp.821-827.
[154]Andreas Harth,Yu He,Hongsuda Tangmunarunkit,Stefan Decker,Carl Kesselman.A Semantic Matchmaker Service on the Grid.In:Proceedings of International Conference on World Wide Web(WWW 2004)[C].New York,2004,pp.326-327.
[155]Zhengli Zhai,Yang Yang,and Zhimin Tian.A Multi-agent Based Grid Service Discovery Framework using fuzzy petri net and ontology[A].In:Proceedings of the 8th Asia-Pacific Web Conference(APWeb 2006)[C].Berlin:Springer-Verlag,2006,pp.911-916.
[156]Hongsuda Tangmunarunkit,Stefan Decker,Carl Kesselman.Ontology-based Resource Matching in the Grid-The Grid meets the Semantic Web[A].In:Prcoceedings of the 2nd International Semantic Web Conference(ISWC2003)[C].Berlin:Springer-Verlag,2003,pp.706-721.
[157]Song Zilin,Ai Weihua,Wang Yi,Wu Liang.Service Search Strategy Based on Graph in Grid Environment[A].In:Proceedings of the Second International Conference on Semantics,Knowledge,and Grid(SKG'06)[C].New York:IEEE Computer Society,2006,pp.96-97.
[158]Ye Zhang,William Song.Semantic Description and Matching of Grid Services Capabilities[EB/OL].http://www.allhands.org.uk/2004/proceedings/papers,2006-01-06.
[159]Ludwig S A,Reyhani S M S.Semantic Approach to Service Discovery in a Grid Environment[J].Journal of Web Semantics,2006,Vol.4(1),pp.1-13.
[160]Tim Bemers-Lee,James Hendler,Ora Lassila.The Semantic Web[J].Scientific American,2001,Vol.284(5),34-43.
[161]李善平,尹奇,胡玉杰等:本体论研究综述[J].计算机研究与发展,2004,第41卷,第7期,Pp.1041-1052.
[162]Studer R,Benjamins V R,Fensel D.Knowledge Engineering:principles and methods[J].Data and Knowledge Engineering,1998,Vol.25(12),pp.161-197.
[163]Gmber T R.Towards Principles for the Design of Ontologies used for Knowledge Sharing[J].International Journal of Human-Computer Studies,1995,Vol.43(5/6),907-928.
[164]Brickley D,Guha R RDF vocabulary description language 1.0:RDF Schema[EB/OL].http://www.w3.org/TR/rdf-schema/,2004.
[165]Fensel D,van Harmelen F,Horrocks I,et al.OIL:An ontology infrastructure for the semantic web[J].IEEE Intelligent Systems,2001,Vol.16(2),pp.38-45.
[166]Patel-Schneider P F,Hayes P,Horrocks I.OWL Web Ontology Language Semantics and Abstract Syntax[EB/OL].http://www.w3.org/TR/owl-semantics/,2004.
[167]OWL-S:Semantic Markup for Web Services[EB/OL].http://www.daml.org/services/owl-s/1.0/
[168]Massimo Paolucci,Takahiro Kawamura,Terry R.Payne,et al.Semantic Matching of Web Service Capabilities[A].In:Proceedings of 1st International Semantic Web Conference[C].Berlin:Springer-Verlag,2002,pp.333-347.
[169]史忠植,蒋运承,张海俊,董明楷.基于描述逻辑的主体服务匹配[J].计算机学报,2004,第27卷,第5期,pp.625-635.
[170]Fact++.http://owl.man.ac.uk/factplusplus/.
[171]Ludwig S A,Reyhani S M S.Introduction of semantic matchmaking to Grid computing[J].Journal of Parallel and Distributed Computing.2005,Vol.65(12),pp.1533-1541.
[172]OWL-S Service Retrieval Test Collection.http://www.dfiki.de/scallops.
[2]Defanti T,Foster I,Papka M,Stevens R et al.Overview of the I-WAY:Wide Area Visual Supercomputing[J].International Journal of Supercomputing Applications,1996,Vol.10(2),pp.123-130.
[3]Foster I,Kesselman C.Globus:A Metacomputing Infrastructure Toolkit[J].International Journal of Supercomputing Applications,1997,Vol.11(2),pp.115-128.
[4]Grimshaw A,Wulf W,et al.The Legion Vision of a Worldwide Virtual Computer[J].Communications of the ACM,1997,Vol.40(1),pp.39-45.
[5]Foster I,Kesselman C,Nick J,Tuecke S.The physiology of the grid:An open grid services architecture for distributed systems integration[EB/OL].http://www.globus.org/research/papers/ogsa.pdf,2002.
[6]Global Grid Forum.http://www.gridforum.org.
[7]Vazhkudai S,Tuecke S,Foster I.Replica Selection in the Globus Data Grid[A].In:Proceedings of the First IEEE/ACM International Conference on Cluster Computing and the Grid[C].New York:IEEE Computer Society,2001,pp.106-113.
[8]Alleock W,Chervenak A,Foster I.The Data Grid:Towards an Architecture for the Distributed Management and Analysis of Large Scientific Datasets[J].Journal of Network and Computer Application,2001,Vol.23,pp.187-200.
[9]Data Grid project,http://www.eu-datagrid.web.cern.cn/eu-datagrid.
[10]NASA Information Power Grid(IPG) Infrastructure.http://www.gloriad.org/gloriad/projects/project000053.html.
[11]李伟,徐志伟,唐志敏等.国家高性能计算环境的设计与实现[EB/OL].http://www.chinagrid.net/grid/paperppt/gct/dincg00.pdf.
[12]China National Grid.http://www.cngrid.org.
[13]徐志伟,李伟.织女星网格的体系结构研究.计算机研究与发展,2002,第39卷,第8期,pp.923-929.
[14]华中科技大学校园网格平台.http://gfid.hust.edu.cn/article_95.html
[15]Bote-Lorenzo M,Dimitriadis Y,G6mez-Sánchez E.Grid Characteristics and Uses:a Grid Definition[A].In:Proceedings of 1st European Across Grids Conference[C].Berlin:Springer-Verlag,2003,pp.291-298.
[16]Jarek Nabrzyski.Grid Resource Management-State of the Art and Future Trends[M].Boston:Kluwer Academic Publishers,2003.
[17]Mockapetris P.Domain names-concepts and facilities(RFC 1034)[EB/OL].http://www,faqs.org/rfcs/rfc 1034.html,1987.
[18]Vanthoumout K,Deconinck G,Belmans R.A Taxonomy for Resource Discovery[A].In:Proceedings of International Conference on Architecture of Computing Systems[C].Berlin:Springer-Verlay,2004.78-91.
[19]Napster Website.http://www.napster.com.
[20]Google Website.http://www.google.com.
[21]Gnutella Protocol Specification,version 0.4[EB/OL].http://www.clip2.corn/GnutellaProtocol04.pdf,2001.
[22]Heinz Johner,Larry Brown,Franz-Stefan Hinner.Understanding LDAP[EB/OL].http://jumpdoc.fz-juelich.de/doc_pdf/ldap/LDAP_Understanding.pdf.
[23]Keung H,Dyson J,Jarvis S.Predicting the Performance of Globus Monitoring and Discovery Service[A].In:Proceedings of 4th IEEE/ACM International Workshop on Grid Computing[C].New York:IEEE Computer Society,2003,pp.176-183.
[24]Zhang X,Freschl J,Schopf J.A Performance Study of Monitoring and Information Services for Distributed Systems[A].In:Proceedings of IEEE HPDC-12[C].New York:IEEE Computer Society,2003,pp.270-282.
[25]Bakker A,Amade E,Ballintijnq,et al.The Globe Distributed Network[A].In:Proceedings of USENIX Annual Conference[C].San Diego,2000,pp.141-152.
[26]Service Location Protocol[EB/OL].http://www.ietf.org/html.charters/svrloc-charter.html.
[27]Iamnitchi A,Foster I.On Fully Decentralized Resource Discovery in Grid Environments[A].In:Proceedings of 2nd IEEE/ACM International Workshop on G rid Computing[C].New York:IEEE Computer Society,2001,pp.51-62.
[28]Iamnitchi A.Resource Discovery in Large Resource-Sharing Environments[D].University of Chicago,2003.
[29]Donald McMullen,Randall Bramley,et al.Xport Collaboratory for X-ray Crystallography[EB/OL].http://www.iumsc.indiana.edu/XPort/xport_demo_talk.pdf
[30]Resource Specification Language[EB/OL].http://www.globus.org/gram/rsl_specl.html
[31]Roberto Chinnici,Martin Gudgin,Jean-Jacques Moreau,Sanjiva Weerawwarana.Web Services Description Language(WSDL) Version 1.2 Part 1:Core Language[EB/OL].http://www.w3.org/TR/wsdl12,2003.
[32]Jean-Jacques Moreau,Jeffrey Schlimmer.Web Services Description Language(WSDL) Version 1.2 Part 3:Bindings[EB/OL].http://w3.org/TR/wsdl 12-bingdings,2003.
[33]Martin Gudgin,Amy Lewis,Jeffrey Schlimmer.Web Services Description Language(WSDL) Version 1.2 Part 2:Message Patterns[EB/OL].http://w3.org/TR/wsdl 12-patterns,2003.
[34]Klyne G,Carroll J.Resource Description Framework(RDF):Concepts and Abstract Syntax[EB/OL].http://www.w3.org/TR/rdfconcepts/,2004.
[35] Uniform Resource Identifier (URI) Activity Statement[EB/OL].http://www.w3.org/Addressing/Activity.
[36] Raman R, Livny M, Solomon M. Matchmaking: distributed resource management for High throughput computing[A]. In: Proceedings of the 7th IEEE Symposium on High Performance Distributed Computing[C]. New York: IEEE Computer Society, 1998, pp.140-146.
[37] Ratnasamy S, Francis P, Handley M, et al. A scalable content addressable network[A]. In: Proceedings of ACM SIGCOMM[C]. New York: ACM Press,2001,pp.161-172.
[38] Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to -peer lookup service for Internet applications[A]. In: Proceedings of the ACM SIGCOMM[C]. New York: ACM Press, 2001, pp. 160-177.
[39] Zhao B Y, Kubiatowicz J D, Joseph A D. Tapestry: an infrastructure for fault resilient wide-area location and routing[R]. Technical Report UCB//CSD-01-1141,U.C. Berkeley, April 2001.
[40] Rowstron A, Druschel P. Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer system[A]. In: Proceedings of IFIP/ACM Middleware 2001[C]. Berlin: Springer-Verlay, 2001, pp.329-350.
[41] Iamnitchi A, Ripeanu M, Foster I. Locating data in ( small world?) peer-to-peer scientific collaborations [A]. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS'02)[C]. Berlin: Springer-Verlay, 2002, pp.232- 241.
[42] Lv Q, Cao P, Cohen E, et al. Search and replication in unstructured peer-to-peer networks[A]. In Proceedings of the 16th ACM International Conference on Super computing (ICS 2002)[C]. New York: ACM Press, 2002, pp.84-95.
[43] Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems[A]. In: Proceedings of INFO COM03[C]. New York: IEEE Computer Society, 2003, pp.134-146.
[44] Argonne National Laboratory. Globus Toolkit~(?) 2.0[EB/OL].http://www.globus.Org/toolkit/downloads/2.0/
[45] The Globus Toolkit 3 Programmer's Tutoria[EB/OL].http://gdp.globus.org/gt3-tutorial/.
[46] Tuecke S, Czajkowski K, Foster I, et.al. Open Grid Service Infrastructure(OGSI),Version 1.0[EB/OL]. http://www.ggf.org/ogsi-wg.
[47] Foster I. Globus Toolkit Version 4: Software for Service-Oriented Systems[A]. In:Proceedings of NPC 2005[C]. Berlin: Springer-Verlag, 2005, pp.2-13.
[48] Karl C. The WS-Resource framework[EB/OL].http://www.globus.org/ wsrf/specs/ws-wsrf.pdf, 2004-9-2.
[49] Czajkowski K, Fitzgerald S, Foster I, et al. Grid Information Services for Distributed Resource Sharing[A]. In: Proceedings of 10th IEEE International Symposium on High-Performance Distributed Computing [C]. New York: IEEE Computer Society, 2001, pp. 181 -194.
[50] Jake Wu. GT 3.2 Index Service (MDS3) Evaluation[EB/OL]._________________ http://forge.nesc.ac.uk/,2004.
[51]Jennifer M.Schopf,et al.Carl Kesselman.Monitoring and Discovery in a Web Services Framework:Functionality and Performance of the Globus Toolkit's MDS4[R].Argonne National Laboratory Technical Report #ANL/MCS-P1248-0405.http://www-unix.mcs.anl.gov/-schopf/Pubs/mds-sc05.pdf.
[52]Thain D,Tannenbaum T,Livny M.Condor and the Grid.In:Berman F,Hey A,Fox G editors.Grid Computing:Making The Global Infrastructure a Reality,John Wiley,2003.
[53]Basney J,Livny M,Mazzanti P.Harnessing the Capacity of Computational Grids for High Energy Physics[A].In:Proceedings of the International Conference on Computing in High Energy and Nuclear Physics(CHEP 2000)[C],Italy,2000.
[54]Raman R,Livny M,Solomon M.Policy Driven Heterogeneous Resource Co-Allocation with Gangmatching[A].In:Proceedings of IEEE HPDC-12[A].New York:IEEE Computer Society,2003,pp.80-89.
[55]Basney J,Livny M.Managing Network Resources in Condor[A].In:Proceedings of IEEE HPDC-9[C].New York:IEEE Computer Society,2000,pp.298-299.
[56]Chapin S,Katramatos D,Karpovich J.The Legion Resource Management System[A].In:Proceeding of the 5th Workshop on Job Scheduling Strategies for Parallel Processing(JSSPP'99)[A].Berlin:Springer-Verlay,1999,pp.162-178.
[57]Sujata B,Sujoy B,Shishir G.Scalable Grid Service Discovery Based on UDDI[A].In:Proceedings of International Workshop on Middleware for Grid Computing(MGC 2005)[C].New York:ACM Press,2005,pp.1-6.
[58]Brett Sinclair,Andrzej Goscinski,and Robert Dew.Enhancing UDDI for Grid Service Discovery by Using Dynamic Parameters[A].In:Proceedings of International Conference on Computational Science and its Applications(ICCSA 2005)[C].Berlin:Springer-Verlay,2005,pp.49-59.
[59]Beniamino Di Martino.An Ontology Matching Approach to Semantic Web Services Discovery[A].In:Proceedings of International Symposium on Parallel and Distributed Processing and Application(ISPA 2006)[C].Berlin:Springer-Verlay,2006,pp.550-558.
[60]Le Duy Ngan,Angela Goh.Matching Semantic Web Services Using Different Ontologies[A].In:Proceedings of ICWE 2005[C].Berlin:Springer-Verlay,2005,pp.302-307.
[61]Sonia Ben Mokhtar,Anupam Kaul Nikolaos Georgantas.Towards Efficient Matching of Semantic Web Service Capabilities[A].In:Proceedings of International Workshop on Web Services Modeling and Testing(WS-MaTe 2006)[C].2006,pp.138-152.
[62]胡建强.服务发现若干关键技术研究[D].长沙:国防科学技术大学.2005.
[63]UDDI.org.UDDI Spec TC,Version 3.0.2[EB/OL].http://www.uddi.org/pubs/uddi-v3.html,2004.
[64]Massimo P,Takahiro K,et al.Importing the Semantic Web in UDDI[A].In:Proceedings of Web Service,E-business and Semantic Web Workshop(CAiSE Workshop)[C].Berlin:Springer-Verlay,2002,pp.225-236.
[65]The DAML Service Coalition.DAML-s:Semantic Markup for Web Service[EB/OL].http://www.daml.org/services/daml-s/0.7/daml-s.pdf.
[66]Hung-Chang Hsiao,Chung-Ta King.Neuron-A Wide-Area Service Discovery Infrastructure[A].In:Proceedings of International Conference on Parallel Processing(ICPP 2002)[C].New York:IEEE Computer Society,2002,pp.455-462.
[67]The Tornado project,www.tomadoproject.com.
[68]D.Clark.Face-to-Face with Peer-to-Peer Networking[J].IEEE Computer,2001,Vol.34(1),pp.18-21.
[69]Dejan S.Milojicic,Vana Kalogeraki,et al.HP Laboratories Palo Alto[R].Tech.Rep.HPL-2002-57,March 2002.
[70]Detlef Schoder,Kai Fischbach.Peer-to-Peer Prospects.Communications of the ACM,2003,Vol.46(2),pp.27-29.
[71]Oram A.Peer-to-Peer:Harnessing the Power of Disruptive Technologies[M].O'Reilly Media,2001.
[72]Napster project,http://www.napster.com.
[73]Lime Wire Project.http://www.limewire.com.
[74]Kazza project,http://www.kazza.com.
[75]Anderson D;SETI@Home:An Experiment in Public Resource Computing System[J].Communications of the ACM,2002,Vol.45(11),pp.56-61.
[76]Talia D and Trunfio P.Towards A Synergy Between P2P and Grids[J].IEEE Internet Computing,2003,Vol.7(4),pp.94-95.
[77]李东升.基于对等模式的资源定位技术研究[D].长沙:国防科学技术大学.2005.
[78]Clarke I,Sandberg O,Wiley B,et al.Freenet:A Distributed Anonymous Information Storage and Retrieval System[A].In:Proceedings of ICSI Workshop on Design Issues in Anonymity and Unobservability[C].Berlin:Springer-Verlay,2000,pp.46-66.
[79]Markatos E P.Tracing a Large-scale Peer-to-Peer System:An Hour in the Life of Gnutella[A].In:Proceedings of Second International Symposium on Cluster Computing and the Grid[C].Berlin:Springer-Verlay,2002,pp.65-65.
[80]Gnutella:To the Bandwidth Barrier and Beyond[EB/OL].http://www.clip2.com/gnutella.html,2001.
[81]FastTrack Product Description[EB/OL].http://www.fasttrack.nu/index_int.html,2002.
[82]Yang B,Garcia-Molina H.Efficient Search in Peer-to-Peer Networks[A].In:Proceedings Of the 22nd IEEE International Conference on Distributed Computing Systems(ICDCS)[C].New York:IEEE Computer Society,2002,pp.5-14.
[83]Kalogeraki V,Gunopulos D,Zeinalipour-yazti D.A Local Search Mechanism for Peer-to-Peer Networks[A].In:Proceedings of the 11th ACM Conference on Information and Knowledge Management(CIKM'02)[C].New York:ACM Press,2002,pp.300-307.
[84]Ratnasamy S,Shenker S,Stoica I.Routing Algorithms for DHTs:Some Open Questions[A].In:Proceedings of First International Workshop on Peer-to-Peer Systems(IPTPS'02)[C].Berlin:Springer-Verlay,2002,pp.45-52.
[85]Had Balakrishnan,M.Frans Kaashoek,David Karger,et al.Looking up Data in P2P Systems[J].Communications of the ACM,2003,Vol.46(2),pp.43-48.
[86]Sean Rhea,Chris Wells,Patrick Eaton,et al.Maintenance-Free Global Data Storage[J].IEEE Internet Computing,2001,Vol.5(5),pp.40-49.
[87]Frank Dabek,M.Frans Kaashoek,David Karger,et al.Wide-area Cooperative Storage with CFS[A].In:Proceedings of ACM Symposium on Operating Systems Principles(SOSP 2001)[C].New York:ACM Press,2001,pp.202-215.
[88]Druschel P,Rowstron A.PAST:A Large-scale,Persistent Peer-to-Peer Storage Utility[A].In:Proceedings of HotOS Ⅷ,Schoss Elmau[C].New York:IEEE Computer Society,2001,pp.65-70.
[89]Zhuang S Q,Zhao B Y,Joseph A D,et al.Bayeux:An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination[A].In:Proceedings of the 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video(NOSSDAV 2001)[C].New York:ACM Press,2001,pp.11-20.
[90]Miguel Castro,Peter Druschel,Anne-Made Kermarrec and Antony Rowstron.Scribe:A Large-scale and Decentralized Application-level Multicast Infrastructure[J].IEEE Journal on Selected Areas in Communications(JSAC),2002,Vol.20(8),pp.1489-1499.
[91]Russ Cox,Athicha Muthitacharoen,Robert T.Morris.Serving DNS using a Peer-to-Peer Lookup Service[A].In:Proceedings of First International Workshop on Peer-to-Peer Systems(IPTPS'02),Berlin:Springer-Verlay,2002,pp.155-165.
[92]Huebsch R,Chun B,Hellerstein J M,et al.The Architecture of PIER:An Internet-Scale Query Processor[A].In:Proceedings of Conference on Innovative Data Systems Research(CIDR 2005)[C].New York:ACM Press,2005,pp.28-43.
[93]Alon Y.Halevy,Zachary G.Ives,Jayant Madhavan,et al.The Piazza Peer Data Management System[J].IEEE Transactions on Knowledge and Data Engineering,2004,Vol.16(7),pp.787-798.
[94]Eastlake D,Jones P.RFC3174:US Secure Hash Algorithm 1(SHA-1)[EB/OL].http://www.faqs.org/rfcs/rfc3174.html,2001.
[95]Petar Maymounkov,David Mazieres.Kademlia:A Peer-to-peer Information System Based on the XOR Metric[A].In:Proceedings of First International Workshop on Peer-to-Peer Systems(IPTPS'02)[C].Berlin:Springer-Verlay,2002,pp.153-161.
[96]Malkhi D,Naor M,Ratajczak D.Viceroy:A Scalable and Dynamic Lookup Network[A].In:Proceedings of 21st ACM Symposium on Principles of Distributed Computing (PODC)[C]. New York: ACM Press, 2002, pp.367-389.
[97] Kaashoek F, Karger D R. Koorde: A Simple Degree-optimal Hash Table[A]. In:Proceedings of 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03)[C]. Berlin: Springer-Verlay, 2003,pp.98-107.
[98] Abhishek Kumar, Shashidhar Merugu, Jun Jim Xu, et al. Ulysses: A Robust,Low-diameter, Low-latency Peer-to-Peer Network[A]. In: Proceedings of 11th IEEE International Conference on Network Protocols (ICNP 2003)[C]. New York:IEEE Computer Society, 2003, pp.258-267.
[99] Matthew Harren, Joseph M. Hellerstein, Ryan Huebsch, et al. Complex Queries in DHT-based Peer-to-Peer Networks[A]. In: Proceedings of First International Workshop on Peer-to-Peer Systems (IPTPS'02)[C]. Berlin: Springer-Verlay,2002, pp.242-259.
[100] Chunqiang Tang, Zhichen Xu, Sandhya Dwarkadas. Peer-to-Peer Information Retrieval Using Self-Organizing Semantic Overlay Networks[A]. In: Proceedings of annual conference of the Special Interest Group on Data Communication(SIGCOMM 2003)[C]. Karlsruhe: ACM Press, 2003, pp.175-186.
[101] Patrick Reynolds and Amin Vahdat. Efficient Peer-to-Peer Keyword Searching[A]. In: Proceedings of Middleware'2003[C]. Berlin: Springer-Verlay,2003,pp.21-40.
[102] Shuming Shi, Guangwen Yang, Dingxing Wang, et al. Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning[A]. In: Proceedings of 3rd International Workshop on P2P Systems (IPTPS'04)[C]. Berlin:Springer-Verlay, 2004, pp. 151 -161.
[103] Austin Clements, Dan Ports, David Karger. Arpeggio: Metadata Searching and Content Sharing with Chord[A]. In: Proceedings of 4th International Workshop on Peer-to-Peer Systems (IPTPS'05)[C]. Berlin: Springer-Verlay, 2005, pp.58-68.
[104] Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi. Approximate Range Selection Queries in Peer-to-Peer Systems[A]. In: Proceedings of the First Biennial Conference on Innovative Data Systems Research (CIDR 2003)[C]. New York: ACM Press, 2003, pp.572-584.
[105] Cristina Schmidt, and Manish Parashar. Enabling Flexible Queries with Guarantees in P2P Systems[J]. IEEE Internet Computing, 2004, Vol.8(3),pp.19-26.
[106] Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasamy, et al. A Case Study in Building Layered DHT Applications[A]. In: Proceedings of annual conference of the Special Interest Group on Data Communication (SIGCOMM 2005)[C].Philadelphia: ACM Press, 2005, pp.97-108.
[107] Ashwin R. Bharambe, Mukesh Agrawal, Srinivasan Seshan. Mercury: Supporting Scalable Multi-attribute Range Queries[A]. In: Proceedings of annual conference of the Special Interest Group on Data Communication (SIGCOMM 2004)[C]. Oregon: ACM Press, 2004, pp.1034-1056.
[108] Oppenheimer D, Albrecht J, Patterson D, et al. Distributed Resource Discovery on Planetlab with SWORD[A]. In: Proceedings of the First Workshop on Real Large Distributed Systems(WORLDS'04)[C].Santa Fe,New Mexico,USA,December 2004,pp.198-203.
[109]Chander A,Dawson S,Lincoln P et al.NEVRLATE:Scalable Resource Discovery[A].In:Proceedings of IEEE/ACM International Conference on Cluster and Computational Grid(CCGrid 2002)[C].CA:IEEE Computer Society,2002,pp.382-388.
[110]Li W,Xu Z,Dong F,et al.A Grid Resource Discovery Model based on the Routing-Transferring Method[A].In:Proceedings of 3rd IEEE/ACM International Workshop On Grid Computing 2002.Berlin:Springer-Vedag,2002,pp.145-156.
[111]李伟,徐志伟,卜冠英等,网格环境下一种有效的资源查找方法[J].计算机学报,2003,第26卷,第11期,PP.1546-1549.
[112]Crespo A,Garcia H.Routing Indices for Peer-to-Peer Systems[A].In:Proceedings of the 22nd International Conference on Distributed Computing Systems(ICDCS'02)[C].Arizona:IEEE Computer Society,2002,pp.23-34.
[113]Gupta I,Birman K,Linga P,Kelips:Building an Efficient and Stable P2P DHT through Increased Memory and Background overhead[A].In:Proceedings of the 2nd International Workshop on Peer-to-Peer Systems(IPTPS'03).Berlin:Springer-Verlag,2003,pp.160-169.
[114]边肇祺,张学工等.模式识别[M].北京:清华大学出版社,1999.
[115]Kermarre A,Massoulie L,Ganesh A.Reliable Probabilistic Communication in Large-scale Information Dissemination Systems[R].Microsoft Research Cambridge,Tech Rep:MST-TR-2000-105,2000.
[116]Schlosser M,Sintek M,Decker S,et al.A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services[A].In:Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing(P2P 2002)[C].Link(o|¨)ping,IEEE Computer Society,2002,pp.104-111.
[117]Huang L,Wu Z,Pan Y.A Scalable and Effective Architecture for Grid services'Discovery[A].In:Proceedings of the First Workshop on Semantics in Peer-to-Peer and Grid Computing 2003,pp.103-115.
[118]Iamnitchi A,Foster I.A Peer-to-Peer Approach to Resource Discovery in Grid Environments[A].In:Proceedings of the 11th Symposium on High Performance Distributed Computing[C].New York:IEEE Computer Society,2002,pp.360-374.
[119]Balazinska M,Balakrishnan M,Karger D.INS/Twine:A Scalable Peer-to-Peer architecture for Intentional Resource Discovery[A].In:Proceedings of International Conference on Pervasive Computing[C].Berlin:Springer-Vedag,2002,pp.195-210.
[120]Winoto W,Schwartz E,Balakrishnan H,et al.The Design and Implementation of an Intentional Naming System[J].Operating Systems Review,1999,Vol.34(5),pp.186-201.
[121]Andrzejak A,Xu Z.Scalable,Efficient Range Queries for Grid Information Services[A]. In: Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing(P2P 2002)[C]. Linkoping, IEEE Computer Society,2002, pp.33-40.
[122] Lv Q, Cao P, Cohen E. Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of ACM SIGMETRICS 2002(C). pp.84-95.
[123] Laherrere J, Sornete D. Stretched exponential distributions in Nature and Economy: 'Fat tails' with characteristic scales[J]. European Physical Journals,1998(B2),pp.525-539.
[124] Jovanovic M. Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella[D]. University of Cincinnati, 2001.
[125] Ripeanu M, Foster I. Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems[A]. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems(IPTPS'02)[C]. Berlin: Springer-Verlay, 2002,pp.85-93.
[126] Ripeanu M. Peer-to-peer architecture case study: Gnutella network[A]. In:Proceedings of Int'l Conference on Peer-to-Peer Computing(P2P 2001)[C].Sweden: IEEE Computer Press, 2001, pp.99-101.
[127] Faloutsos M, Faloutsos P, Faloutsos C. On power-law relationships of the Internet topology[J]. ACM SIGCOMM Computer Communication Review, 1999,Vol.29(4),pp.251-262.
[128] Vaucher J, Kropf P, Babin G. Experimenting with Gnutella Communities[A]. In:Proceedings of 4th International Conference on Distributed Communities on the Web(DCW2002)[C]. Berlin: Springer-Verlag, 2002, pp.84-99.
[129] Strogatz S, Wats D. Characteristics of Small World Networks[J]. Nature, 1998,Vol.393(6), pp.440-442.
[130] Palmer C, Steffan J. Generating network topologies that obey power-law[A]. In:Proceedings of the IEEE Global Telecommunication Conference (GLOBECOM 2000)[C]. San Francisco: IEEE Computer Society, 2000, pp.434-438.
[131] Dou W, Jia Y, Wang H, et al. A P2P Approach for Global Computing[A]. In:Proceedings of the IPDPS03[C]. New York: IEEE Computer Society, 2003,pp.248-249.
[132] Khambatti M, Ryu K, Dasgupta P. Peer-to-Peer Communities: Formation and Discovery [A]. In: Proceedings of 14th IASTED Conference on Parallel and Distributed. Computing Systems (PDCS), Cambridge, Massachusetts, November 2002,pp.166-173.
[133] Buyya R, Murshed M. GridSim: A Toolkit for the Modeling and Simulation of Distributed Resource Management and Scheduling for Grid Computing[J].Journal of Concurrency and Computation: Practice and Experience, 2002, Vol.14(13-15), pp.1175-1220.
[134] eMule project. http://www.emule-project.net/
[135] Carlo Mastroianni, Domenico Talia and Oreste Verta. A P2P Approach for Membership Management and Resource Discovery in Grids[A]. In: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05)[C]. Nevada: IEEE Computer Society, pp.168-174.
[136] Cheng Zhu, Zhong Liu, Weiming Zhang, Weidong Xiao, Jincai Huang. An Efficient Decentralized Grid Service Discovery Approach based on Service Ontology[A]. In: Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence(WI'04)[C]. Beijing: IEEE Computer Society, 2004,pp.570-573.
[137] Manfred Hauswirth, Roman Schmidt. An overlay network for resource discovery in Grids[A]. In: Proceedings of the 16th International Workshop on Database and Expert Systems Applications (DEXA'05)[C]. Copenhagen: IEEE Computer Society, 2005, pp.343-348.
[138] Abhishek Gupta, Divyakant Agrawal. Distributed Resource Discovery in Large Scale Computing Systems[A]. In: Proceedings of the 2005 Symposium on Applications and the Internet (SAINT'05). Trento: IEEE Computer Society, 2005,pp.320-326.
[139] Al-Dmour N A, Teahan W J. Peer-to-peer Protocols For Resource Discovery in the Grid[A]. In: Proceeding of Parallel and Distributed Computing and Networks[C]. Innsbruck, 2005, pp.319-324.
[140] Adeep Singh Cheema. Structured Naming and Peer-to-Peer Discovery of Resources in Grid Applications[D]. University of Illinois, 2005.
[141] Raman R, Livny M, Solomon M. Matchmaking: Distributed resource management for high throughput computing[A]. In: Proceedings of the 7th IEEE High Performance Distributed Computing (HPDC)[C]. New York: IEEE Computer Society, 1998, pp.40-147.
[142] Domenico Talia, Paolo Trunfio. Web Services for Peer-to-Peer Resource Discovery on the Grid[A]. DELOS Workshop: Digital Library Architectures,2004, pp.73-84.
[143] Balazinska M, Balakrishnan M, Karger D. INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery[A]. In: Proceedings of International Conference on Pervasive Computing[C]. Berlin: Springer-Verlag,2002, pp. 195-210.
[144] Winoto W, Schwartz E, Balakrishnan H, et al. The Design and Implementation of an Intentional Naming System[A]. In: Proceedings of 17th ACM SOSP. Kiawah Island, 1999, pp. 186-201.
[145] Karl Aberer. P-Grid: A Self-Organizing Access Structure for P2P Information Systems[A]. In: Proceedings of the Sixth International Conference on Cooperative Information Systems[C]. Berlin: Springer-Verlag, 2001, pp.179-194.
[146] McMullen D, Bramley R, et al. Xport Collaborator for X-ray Crystallography [EB/OL].http://www.iumsc.indiana.edu/XPort/xport_demo_talk.pdf.
[147] Ye Zhu, Junzhou Luo, and Teng Ma. Dividing Grid Service Discovery into 2-Stage Matchmaking[A]. In: Proceedings of International Symposium on Parallel and Distributed Processing and Application (ISPA 2004)[C]. Berlin:Springer-Verlag, 2004, pp.372-381.
[148]Fei Liu,Fan-yuan Ma,Ming-lu Li,and Lin-peng Huang.A Framework for Semantic Grid Service Discovery[A].In:Proceedings of Fifth International Conference on Web Information Systems Engineering(WISE2004)[C].Berlin:Springer-Verlag,2003,pp.3-10.
[149]Simone.A.Ludwig,S.M.S.Reyhani.Introduction of semantic matchmaking to Grid computing[J].Journal of Parallel and Distributed Computing,2005,Vol.65(12),pp.1533-1541.
[150]Simone.A.Ludwig,Peter van Santen.A Grid Service Discovery Matchmaker based on Ontology Description[EB/OL].http://datatag.web.cern.ch/datatag/papers/euro web2002.pdf.
[151]Le Duy Ngan and Angela Goh.Matching Semantic Web Services Using Different Ontologies[A].In:Proceedings of International Conference on Web Engineering(ICWE 2005)[C].Berlin:Springer-Verlag,2005,pp.302-307.
[152]Beniamino Di Martino.An Ontology Matching Approach to Semantic Web Services Discovery[A].In:Proceedings of International Symposium on Parallel and Distributed Processing and Application(ISPA 2006)[C].Berlin:Springer-Verlag,2006,pp.550-558.
[153]何儒汉,金海,廖振松,章勤.ChinaGrid图像处理网格平台中的语义信息服务研究[J].计算机研究与发展,2006,第43卷,第5期,pp.821-827.
[154]Andreas Harth,Yu He,Hongsuda Tangmunarunkit,Stefan Decker,Carl Kesselman.A Semantic Matchmaker Service on the Grid.In:Proceedings of International Conference on World Wide Web(WWW 2004)[C].New York,2004,pp.326-327.
[155]Zhengli Zhai,Yang Yang,and Zhimin Tian.A Multi-agent Based Grid Service Discovery Framework using fuzzy petri net and ontology[A].In:Proceedings of the 8th Asia-Pacific Web Conference(APWeb 2006)[C].Berlin:Springer-Verlag,2006,pp.911-916.
[156]Hongsuda Tangmunarunkit,Stefan Decker,Carl Kesselman.Ontology-based Resource Matching in the Grid-The Grid meets the Semantic Web[A].In:Prcoceedings of the 2nd International Semantic Web Conference(ISWC2003)[C].Berlin:Springer-Verlag,2003,pp.706-721.
[157]Song Zilin,Ai Weihua,Wang Yi,Wu Liang.Service Search Strategy Based on Graph in Grid Environment[A].In:Proceedings of the Second International Conference on Semantics,Knowledge,and Grid(SKG'06)[C].New York:IEEE Computer Society,2006,pp.96-97.
[158]Ye Zhang,William Song.Semantic Description and Matching of Grid Services Capabilities[EB/OL].http://www.allhands.org.uk/2004/proceedings/papers,2006-01-06.
[159]Ludwig S A,Reyhani S M S.Semantic Approach to Service Discovery in a Grid Environment[J].Journal of Web Semantics,2006,Vol.4(1),pp.1-13.
[160]Tim Bemers-Lee,James Hendler,Ora Lassila.The Semantic Web[J].Scientific American,2001,Vol.284(5),34-43.
[161]李善平,尹奇,胡玉杰等:本体论研究综述[J].计算机研究与发展,2004,第41卷,第7期,Pp.1041-1052.
[162]Studer R,Benjamins V R,Fensel D.Knowledge Engineering:principles and methods[J].Data and Knowledge Engineering,1998,Vol.25(12),pp.161-197.
[163]Gmber T R.Towards Principles for the Design of Ontologies used for Knowledge Sharing[J].International Journal of Human-Computer Studies,1995,Vol.43(5/6),907-928.
[164]Brickley D,Guha R RDF vocabulary description language 1.0:RDF Schema[EB/OL].http://www.w3.org/TR/rdf-schema/,2004.
[165]Fensel D,van Harmelen F,Horrocks I,et al.OIL:An ontology infrastructure for the semantic web[J].IEEE Intelligent Systems,2001,Vol.16(2),pp.38-45.
[166]Patel-Schneider P F,Hayes P,Horrocks I.OWL Web Ontology Language Semantics and Abstract Syntax[EB/OL].http://www.w3.org/TR/owl-semantics/,2004.
[167]OWL-S:Semantic Markup for Web Services[EB/OL].http://www.daml.org/services/owl-s/1.0/
[168]Massimo Paolucci,Takahiro Kawamura,Terry R.Payne,et al.Semantic Matching of Web Service Capabilities[A].In:Proceedings of 1st International Semantic Web Conference[C].Berlin:Springer-Verlag,2002,pp.333-347.
[169]史忠植,蒋运承,张海俊,董明楷.基于描述逻辑的主体服务匹配[J].计算机学报,2004,第27卷,第5期,pp.625-635.
[170]Fact++.http://owl.man.ac.uk/factplusplus/.
[171]Ludwig S A,Reyhani S M S.Introduction of semantic matchmaking to Grid computing[J].Journal of Parallel and Distributed Computing.2005,Vol.65(12),pp.1533-1541.
[172]OWL-S Service Retrieval Test Collection.http://www.dfiki.de/scallops.