Internet环境下的资源管理模型及算法研究
|
摘要
网络管理理论与技术是管理科学与工程的一个重要研究领域,随着互联网技术日益成熟,网络资源越来越丰富,从管理科学角度研究如何有效地进行网络资源管理、提高网络资源利用率具有重要意义,因此新一代网络应用平台和网络管理理论及关键技术是目前网络管理技术的一个重要研究方向。迄今为止,现存的技术主要为资源集中管理提供了有效的管理方法,但很多情况下资源都分布存放在不同地点,需要实施分布管理的方法和技术。例如,考虑我国中小学教育资源共享问题,目前各个学校拥有丰富的教学资源,包括各学科教学课件、优秀教学案例、实验案例、精品课程的教学录像以及各类教学管理软件等,如何利用网络资源管理技术高效的共享这些资源,避免盲目重复开发,是迫切需要研究的问题。因此,研究基于分布式资源管理的网络体系结构,开发标准的网络资源管理平台具有重要意义。作为一个典型应用,可以利用该平台实现中小学教育资源的分布管理,为我国基础教育资源管理提供一个通用开放的软件支撑平台,对于加强各地中小学之间的交流与合作,提高整体教学水平具有重要作用。
目前,不同机构的资源一般都集中存储在各自的服务器上,以Web方式供用户访问。这种集中式资源管理具有很高的效率,但是Web服务器瓶颈问题、资源副本管理问题、资源发现问题和网络带宽问题等若干因素给这种应用模式带来很大的挑战,诸多技术问题亟待解决。网格作为一种日益流行的网络计算平台,为网络资源管理提供了一种有效的解决方案。在不改变现有资源存储模式的前提下,建立一个分布式资源管理平台来整合这些资源,需要研究网络环境下分布式资源管理的网络体系结构、资源管理机制和服务理论。
论文以我国中小学教育资源管理为应用背景,重点研究了网络环境下进行资源共享的系统拓扑结构、资源发现机制、资源感知模型及资源副本管理技术等,为建立互联网络环境下网格资源管理平台探索有效的方法和途径。论文主要研究内容及创新工作包括:
1.研究了资源共享系统的拓扑结构,以网络节点处理能力和物理网络参数为依据构建了RP(k)C-Grid系统,设计了高效的消息路由算法MR-RP(k),解决了现有拓扑结构的系统瓶颈、可扩展性差及拓扑失配问题。
目前网络资源管理系统主要有集中式、分布式非结构化和分布式结构化等结构形式。这些结构各有其不足:集中式结构的服务器是系统瓶颈;分布式非结构化网络基于泛洪的查询机制容易造成网络拥塞,系统可扩展性差;分布式结构化网络目前主要采用DHT机制组织网络节点和资源,这种方式使得物理上相邻的节点经过哈希算法处理后逻辑上可能相距很远,降低了网络的运行效率。分布式结构化网络的DHT路由策略、节点的动态离开与加入给系统带来的震荡也是需要深入研究的问题。由于RP(k)结构充分利用了Petersen的稳定性和环的简单性,具有短的网络直径、简单的拓扑结构及高效的路由策略,基于RP(k)构建的RP(k)C-Grid系统和其它拓扑结构相比具有更好的稳定性和更高的通信效率。
2.针对资源搜索问题,设计了RP(k)C-Grid上的PFS资源发现算法,提出了查询登记机制避免重复泛洪。和其它搜索算法相比,PFS算法有效降低了资源搜索延迟时间,减少了查询消息跳数,在系统规模增大时有更高的搜索效率。
目前资源搜索方法主要有集中式方法和分布式方法,集中式资源搜索效率较高,但可扩展性差,存在单一故障点;基于DHT的分布式系统资源定位方法可伸缩性好,但分布式哈希表的拓扑失配问题降低了系统的资源搜索效率。PFS搜索算法充分利用了RP(k)C-Grid系统的结构特点,有效发挥簇头节点的性能优势,采取簇头探察、簇头泛洪和RP(k)C轮询相结合的方法减少泛洪次数。查询登记机制使得对同一资源的重复查询请求可以在簇头节点进行高效处理而避免重复泛洪。
3.为提高簇头节点的资源感知能力,设计了资源目录全局广告算法,使得簇头节点能够快速获取全局资源目录视图,以良好的资源感知能力实现对资源搜索的快速响应。
资源需求者对共享资源信息的感知能力是影响资源发现效率的重要因素。广告使得供应商以最快捷的方式把商品介绍给用户,用户也以最小的搜索代价从广告中获取满意的商品信息。基于这种市场模式的启发,建立了资源目录广告模型,设计了RP(k)C上的资源目录全局广告算法RP(k)C-DA,该算法分两部分实现:Petersen内目录广告和RP(k)C目录广告。针对不同系统规模进行了实验分析,和其它文献的方法进行了比较,验证了资源目录全局广告算法的优势。
4.从提高副本利用率、降低副本维护代价角度入手,提出了基于资源访问热度队列策略的自适应关口副本算法,把访问热度高的资源在其它节点建立副本,均衡访问负载,降低当前资源节点的副本替换频率。
资源副本是网络环境下文件资源共享时保证资源可用性和降低访问迟延的有效方式,但是副本如何放置才能达到更高的使用效率而不浪费网络带宽和存储空间,这需要在特定拓扑结构下进行分析。针对RP(k)C-Grid拓扑结构,提出了自适应关口副本机制,对成功跨簇查询的资源文件在簇头节点建立副本以提高查询响应速度。由于频繁的关口副本建立与替换会增加簇头节点的存储代价及性能损耗,提出采用资源访问热度队列策略对副本进行管理维护,实验证明该策略有效改善了系统副本管理性能。
5.以教育资源共享管理为应用背景,利用研究的网络资源管理技术建立了一个教育资源网格系统RP(k)C-Grid,实现了网络环境下的资源管理、副本管理以及资源搜索等。
根据都柏林元数据标准和CELTS-42规范提出了一种实用的基础教育资源元数据模型,用来表示教育资源网格中文件资源的元数据信息。目前我国各省市及县区的中小学和各级教育管理部门一般都拥有较高性能的服务器,并积累了大量的教学资源。这些服务器在物理位置的分布上相对规则,适合建立结构化拓扑。利用研究的网络资源管理技术设计了一个教育资源网格应用实例,分析了网格构建的关键技术,给出了系统主要模块设计。RP(k)C-Grid系统的建立和运行方式更适合目前我国中小学教育资源管理现状。
本文的研究进一步丰富和完善了网络环境下资源管理技术的模型及算法,为网络环境下资源共享探索有效的方法。
Theories and technologies of network management is an important research field in management science and engineering. With the development of the Internet, network resources are getting richer day by day. And the research on how to carry out network resources management effectively from the perspective of management science has an important significance in improving resource utilization ratio. Therefore, a new generation network application platform and theories as well as key technologies of network management is a significant research direction on present network management. Up to now, existing technologies focuse on providing effective ways for centralized management resources. In most circumstances, resources are stored in different places and call for methods and techniques of distributed management. For instance, every school, nowadays, occupies a variety of educational resources, including courseware, excellent teachers’teaching cases, experiment cases, first-rate classes video tapes and education management software, etc. So, it’s an urgent problem to be discussed that how to share those resources efficiently by means of network management and avoid developing repeatedly and blindly. It is necessary to do some research on network architecture based on distributed resource management and develop standard platform of distributed resource storage and management. As a typical application, it can make use of the platform to realize the distributed management of educational resources in primary and secondary schools and provide a universal software support platform to our country’s basic education resource management. This platform will play an important role in the exchange and cooperation between primary and secondary schools across the country, and help to reach a higher teaching level.
At present, most of the institutions’resources are used to store in their own Web servers for user access. It’s an effective resource management method for the centralized files, but the web server bottleneck problem, the resource replica management problem, the problems of resource discovery and the network bandwidth bring challenges to this application model, and there are still many technical problems to be solved. Grid, as a network computing platform, is becoming more and more popular, and it will come up with an effective way for network resource management. On the premise of unchanging resource storage model, it is considerable to build a distributed resource management platform to integrate these resources. Therefore, we need to study the network architecture, resource management mechanism and service theory in network environment.
My thesis choose the primary and secondary schools’educational resource management as background, focuses mainly on resource sharing system topology, resource discovery mechanism, resource awareness model, resource replica management model and algorithm in order to explore an effective method of resource grid platform under the Internet environment. Followings are the main details and new ideas.
1. Topologies of resource sharing systems are investigated, the RP(k)C-Grid system according to network nodes processing ability and physical network parameters is built up, efficient message routing algorithm- MR-RP(k) is designed, and system bottleneck, limited extendibility as well as topology mismatch of existing topology structures are solved.
Present resource management systems mainly have forms of topology including centralized, decentralized unstructured and structured mode, which have their own weaknesses: the central server is system bottleneck of centralized structure; the decentralized structure network based on the flooding mechanism is easy to lead network congestion and has limited extensibility; while structured network mainly adopts DHT mechanism to organize system nodes and resource, which may enlarge the distance with the physical adjacent connection nodes and decline the network efficiency. At the same time for the routing policy of DHT, dynamical node departure and arrival bring instabilities to the system, which call for a further research. RP(k) structure takes full advantage of Petersen’s stability and ring’s simplicity, which has short network diameter, simple topology structure and efficient routing policy. Compared with the other topologies, the RP(k)C-Grid system has better stability and higher communication efficiency.
2. PFS resource discovery algorithm of RP(k)C-Grid is designed in the point of problem on resource searching, and the query registration mechanism is proposed to avoid repeated flooding. Compared with other searching algorithms, PFS algorithm decreases searching delay effectively, reduces hop count of searching messages, and has an excellent searching efficiency especially when the system scale is increasing.
Centralized and distributed methods are the two main ways of present resource searching. The centralized resource searching has a lower extensibility and single-point failure though it is more efficient; while the distributed resource searching method based on DHT has good scalability but bad efficiency in searching on the reason of topology mismatch. PFS searching algorithm makes full use of structure characteristic of the RP(k)C-Grid system and performance advantage of the cluster head nodes, adopt a combined mechanism of cluster head probe exploration, cluster head flooding and RP(k)C scan to decrease flooding times. The query registration mechanism makes it possible for the repeated query of same resource to be responded efficiently on the cluster head nodes and make the repeated flooding avoidable.
3. A global advertising algorithm of resource directory is designed to improve the resource awareness ability of the cluster head nodes, which makes nodes get a global view of the resource directory rapidly and realize quick respond of resource searching.
It’s an important factor of resource discovery efficiency that how the resource requester apperceives the shared resource information. By using advertisement, the supplier can promote their products in the fastest way to the consumer, and the consumer can get product information with a lowest cost through advertisement. Inspired by this marketing mode, a resource directory advertising model is proposed and a global resource directory advertising algorithm of RP(k)C-DA is designed, which is divided into two parts including Petersen inner directory advertisement and RP(k)C directory advertisement. From experiments of different system scales and comparison with methods of other papers, the advantages of the global advertising algorithm of resource directory is verified.
4. A self-adaptive gateway replica algorithm based on resource access popularity queue policy is proposed from the perspective of improving replica utilization ratio and decreasing replica maintenance cost. By creating replica in other nodes for resources having hot popularity, it can balance access load and reduce replica replacement frequency of current resource node.
Resource replica is an efficient way to guarantee the availability and decrease the access delay in network environment. However, it’s really a tough work to deal with the replicas placement in order to achieve its highest-performance and avoid storage waste, which asks for analysis under particular topology. In the point of topology structure of RP(k)C-Grid, a self-adaptive gateway replica mechanism is proposed which creates replica in the cluster head nodes for resources from successful cross-cluster query to improve system response speed. For frequent gateway replica may increase the storage cost and the performance loss of the cluster head nodes whereas the system uses resource access popularity queue policy to manage the replica. Experiment proves that this strategy improves the system replica management performance efficiently.
5. On the application background of educational resource sharing, the educational resource grid is built supported by network resource management technologies of my thesis, which realizes resource management, replica management, and resource query under network environment.
On the basis of the DC metadata standard and the CELTS-42 norm, an educational resource data model is put forward to describe file resource metadata. At present, primary and secondary schools as well as educational management departments of various provinces and cities generally have high-performance servers, and accumulate amount of teaching resources. These servers have relative rule distribution in physical location, which is fit to build the structured topology. An educational resource grid instance, RP(k)C-Grid, is constructed based on research technologies of network resource management, the key technologies are analyzed and the main system models are designed. The establishment and operation way of RP(k)C-Grid system are more suitable to the present management situation of educational resources sharing for primary and secondary schools of our country.
My thesis steps further to enrich and perfect the resource management model and algorithm in network environment, and provide an effective method to the exploration of network resources sharing.
目前,不同机构的资源一般都集中存储在各自的服务器上,以Web方式供用户访问。这种集中式资源管理具有很高的效率,但是Web服务器瓶颈问题、资源副本管理问题、资源发现问题和网络带宽问题等若干因素给这种应用模式带来很大的挑战,诸多技术问题亟待解决。网格作为一种日益流行的网络计算平台,为网络资源管理提供了一种有效的解决方案。在不改变现有资源存储模式的前提下,建立一个分布式资源管理平台来整合这些资源,需要研究网络环境下分布式资源管理的网络体系结构、资源管理机制和服务理论。
论文以我国中小学教育资源管理为应用背景,重点研究了网络环境下进行资源共享的系统拓扑结构、资源发现机制、资源感知模型及资源副本管理技术等,为建立互联网络环境下网格资源管理平台探索有效的方法和途径。论文主要研究内容及创新工作包括:
1.研究了资源共享系统的拓扑结构,以网络节点处理能力和物理网络参数为依据构建了RP(k)C-Grid系统,设计了高效的消息路由算法MR-RP(k),解决了现有拓扑结构的系统瓶颈、可扩展性差及拓扑失配问题。
目前网络资源管理系统主要有集中式、分布式非结构化和分布式结构化等结构形式。这些结构各有其不足:集中式结构的服务器是系统瓶颈;分布式非结构化网络基于泛洪的查询机制容易造成网络拥塞,系统可扩展性差;分布式结构化网络目前主要采用DHT机制组织网络节点和资源,这种方式使得物理上相邻的节点经过哈希算法处理后逻辑上可能相距很远,降低了网络的运行效率。分布式结构化网络的DHT路由策略、节点的动态离开与加入给系统带来的震荡也是需要深入研究的问题。由于RP(k)结构充分利用了Petersen的稳定性和环的简单性,具有短的网络直径、简单的拓扑结构及高效的路由策略,基于RP(k)构建的RP(k)C-Grid系统和其它拓扑结构相比具有更好的稳定性和更高的通信效率。
2.针对资源搜索问题,设计了RP(k)C-Grid上的PFS资源发现算法,提出了查询登记机制避免重复泛洪。和其它搜索算法相比,PFS算法有效降低了资源搜索延迟时间,减少了查询消息跳数,在系统规模增大时有更高的搜索效率。
目前资源搜索方法主要有集中式方法和分布式方法,集中式资源搜索效率较高,但可扩展性差,存在单一故障点;基于DHT的分布式系统资源定位方法可伸缩性好,但分布式哈希表的拓扑失配问题降低了系统的资源搜索效率。PFS搜索算法充分利用了RP(k)C-Grid系统的结构特点,有效发挥簇头节点的性能优势,采取簇头探察、簇头泛洪和RP(k)C轮询相结合的方法减少泛洪次数。查询登记机制使得对同一资源的重复查询请求可以在簇头节点进行高效处理而避免重复泛洪。
3.为提高簇头节点的资源感知能力,设计了资源目录全局广告算法,使得簇头节点能够快速获取全局资源目录视图,以良好的资源感知能力实现对资源搜索的快速响应。
资源需求者对共享资源信息的感知能力是影响资源发现效率的重要因素。广告使得供应商以最快捷的方式把商品介绍给用户,用户也以最小的搜索代价从广告中获取满意的商品信息。基于这种市场模式的启发,建立了资源目录广告模型,设计了RP(k)C上的资源目录全局广告算法RP(k)C-DA,该算法分两部分实现:Petersen内目录广告和RP(k)C目录广告。针对不同系统规模进行了实验分析,和其它文献的方法进行了比较,验证了资源目录全局广告算法的优势。
4.从提高副本利用率、降低副本维护代价角度入手,提出了基于资源访问热度队列策略的自适应关口副本算法,把访问热度高的资源在其它节点建立副本,均衡访问负载,降低当前资源节点的副本替换频率。
资源副本是网络环境下文件资源共享时保证资源可用性和降低访问迟延的有效方式,但是副本如何放置才能达到更高的使用效率而不浪费网络带宽和存储空间,这需要在特定拓扑结构下进行分析。针对RP(k)C-Grid拓扑结构,提出了自适应关口副本机制,对成功跨簇查询的资源文件在簇头节点建立副本以提高查询响应速度。由于频繁的关口副本建立与替换会增加簇头节点的存储代价及性能损耗,提出采用资源访问热度队列策略对副本进行管理维护,实验证明该策略有效改善了系统副本管理性能。
5.以教育资源共享管理为应用背景,利用研究的网络资源管理技术建立了一个教育资源网格系统RP(k)C-Grid,实现了网络环境下的资源管理、副本管理以及资源搜索等。
根据都柏林元数据标准和CELTS-42规范提出了一种实用的基础教育资源元数据模型,用来表示教育资源网格中文件资源的元数据信息。目前我国各省市及县区的中小学和各级教育管理部门一般都拥有较高性能的服务器,并积累了大量的教学资源。这些服务器在物理位置的分布上相对规则,适合建立结构化拓扑。利用研究的网络资源管理技术设计了一个教育资源网格应用实例,分析了网格构建的关键技术,给出了系统主要模块设计。RP(k)C-Grid系统的建立和运行方式更适合目前我国中小学教育资源管理现状。
本文的研究进一步丰富和完善了网络环境下资源管理技术的模型及算法,为网络环境下资源共享探索有效的方法。
Theories and technologies of network management is an important research field in management science and engineering. With the development of the Internet, network resources are getting richer day by day. And the research on how to carry out network resources management effectively from the perspective of management science has an important significance in improving resource utilization ratio. Therefore, a new generation network application platform and theories as well as key technologies of network management is a significant research direction on present network management. Up to now, existing technologies focuse on providing effective ways for centralized management resources. In most circumstances, resources are stored in different places and call for methods and techniques of distributed management. For instance, every school, nowadays, occupies a variety of educational resources, including courseware, excellent teachers’teaching cases, experiment cases, first-rate classes video tapes and education management software, etc. So, it’s an urgent problem to be discussed that how to share those resources efficiently by means of network management and avoid developing repeatedly and blindly. It is necessary to do some research on network architecture based on distributed resource management and develop standard platform of distributed resource storage and management. As a typical application, it can make use of the platform to realize the distributed management of educational resources in primary and secondary schools and provide a universal software support platform to our country’s basic education resource management. This platform will play an important role in the exchange and cooperation between primary and secondary schools across the country, and help to reach a higher teaching level.
At present, most of the institutions’resources are used to store in their own Web servers for user access. It’s an effective resource management method for the centralized files, but the web server bottleneck problem, the resource replica management problem, the problems of resource discovery and the network bandwidth bring challenges to this application model, and there are still many technical problems to be solved. Grid, as a network computing platform, is becoming more and more popular, and it will come up with an effective way for network resource management. On the premise of unchanging resource storage model, it is considerable to build a distributed resource management platform to integrate these resources. Therefore, we need to study the network architecture, resource management mechanism and service theory in network environment.
My thesis choose the primary and secondary schools’educational resource management as background, focuses mainly on resource sharing system topology, resource discovery mechanism, resource awareness model, resource replica management model and algorithm in order to explore an effective method of resource grid platform under the Internet environment. Followings are the main details and new ideas.
1. Topologies of resource sharing systems are investigated, the RP(k)C-Grid system according to network nodes processing ability and physical network parameters is built up, efficient message routing algorithm- MR-RP(k) is designed, and system bottleneck, limited extendibility as well as topology mismatch of existing topology structures are solved.
Present resource management systems mainly have forms of topology including centralized, decentralized unstructured and structured mode, which have their own weaknesses: the central server is system bottleneck of centralized structure; the decentralized structure network based on the flooding mechanism is easy to lead network congestion and has limited extensibility; while structured network mainly adopts DHT mechanism to organize system nodes and resource, which may enlarge the distance with the physical adjacent connection nodes and decline the network efficiency. At the same time for the routing policy of DHT, dynamical node departure and arrival bring instabilities to the system, which call for a further research. RP(k) structure takes full advantage of Petersen’s stability and ring’s simplicity, which has short network diameter, simple topology structure and efficient routing policy. Compared with the other topologies, the RP(k)C-Grid system has better stability and higher communication efficiency.
2. PFS resource discovery algorithm of RP(k)C-Grid is designed in the point of problem on resource searching, and the query registration mechanism is proposed to avoid repeated flooding. Compared with other searching algorithms, PFS algorithm decreases searching delay effectively, reduces hop count of searching messages, and has an excellent searching efficiency especially when the system scale is increasing.
Centralized and distributed methods are the two main ways of present resource searching. The centralized resource searching has a lower extensibility and single-point failure though it is more efficient; while the distributed resource searching method based on DHT has good scalability but bad efficiency in searching on the reason of topology mismatch. PFS searching algorithm makes full use of structure characteristic of the RP(k)C-Grid system and performance advantage of the cluster head nodes, adopt a combined mechanism of cluster head probe exploration, cluster head flooding and RP(k)C scan to decrease flooding times. The query registration mechanism makes it possible for the repeated query of same resource to be responded efficiently on the cluster head nodes and make the repeated flooding avoidable.
3. A global advertising algorithm of resource directory is designed to improve the resource awareness ability of the cluster head nodes, which makes nodes get a global view of the resource directory rapidly and realize quick respond of resource searching.
It’s an important factor of resource discovery efficiency that how the resource requester apperceives the shared resource information. By using advertisement, the supplier can promote their products in the fastest way to the consumer, and the consumer can get product information with a lowest cost through advertisement. Inspired by this marketing mode, a resource directory advertising model is proposed and a global resource directory advertising algorithm of RP(k)C-DA is designed, which is divided into two parts including Petersen inner directory advertisement and RP(k)C directory advertisement. From experiments of different system scales and comparison with methods of other papers, the advantages of the global advertising algorithm of resource directory is verified.
4. A self-adaptive gateway replica algorithm based on resource access popularity queue policy is proposed from the perspective of improving replica utilization ratio and decreasing replica maintenance cost. By creating replica in other nodes for resources having hot popularity, it can balance access load and reduce replica replacement frequency of current resource node.
Resource replica is an efficient way to guarantee the availability and decrease the access delay in network environment. However, it’s really a tough work to deal with the replicas placement in order to achieve its highest-performance and avoid storage waste, which asks for analysis under particular topology. In the point of topology structure of RP(k)C-Grid, a self-adaptive gateway replica mechanism is proposed which creates replica in the cluster head nodes for resources from successful cross-cluster query to improve system response speed. For frequent gateway replica may increase the storage cost and the performance loss of the cluster head nodes whereas the system uses resource access popularity queue policy to manage the replica. Experiment proves that this strategy improves the system replica management performance efficiently.
5. On the application background of educational resource sharing, the educational resource grid is built supported by network resource management technologies of my thesis, which realizes resource management, replica management, and resource query under network environment.
On the basis of the DC metadata standard and the CELTS-42 norm, an educational resource data model is put forward to describe file resource metadata. At present, primary and secondary schools as well as educational management departments of various provinces and cities generally have high-performance servers, and accumulate amount of teaching resources. These servers have relative rule distribution in physical location, which is fit to build the structured topology. An educational resource grid instance, RP(k)C-Grid, is constructed based on research technologies of network resource management, the key technologies are analyzed and the main system models are designed. The establishment and operation way of RP(k)C-Grid system are more suitable to the present management situation of educational resources sharing for primary and secondary schools of our country.
My thesis steps further to enrich and perfect the resource management model and algorithm in network environment, and provide an effective method to the exploration of network resources sharing.
引文
[1]张玲玲,房勇,杨涛等.管理科学与工程热点研究领域的文献计量分析[J].管理学报,2005,Vol.2(4):379-385.
[2]佘从国,席酉民.国内外管理科学与工程研究热点的比较分析[J].科学学研究, 2002(8):406-410.
[3]陈磊,李三立.数据网格中一种填空式副本分配算法[J].电子学报, 2006,Vol.34(11):1951-1954.
[4] Romberg, Mathilde. The UNICORE Grid infrastructure. Scientific programming [J]. Special Issue on Grid Computing, 2002, Vol.10(2) :149-157.
[5] I. Foster, C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure[M]. Morgan Kaufmann, San Fransisco,CA,1999.
[6] I. Foster, C. Kesselman. The Grid 2: Blueprint for a New Computing Infrastructure[M]. Morgan Kaufmann, San Fransisco,CA,2004.
[7] Foster, I., Kesselman, C., Nick, J.M., et al. Grid services for distributed system integration[J]. Computer, Vol.35(6), June 2002:37-46.
[8]徐志伟,冯百明,李伟.网格计算技术[M].北京:电子工业出版社,2004.5.
[9] I. Foster, C. Kesselman, S. Tuecke. The Anatomy of the Grid: Enabling Scalable Virtual Organizations[J]. International Journal of High Performance Computing Applications, 2001,Vol.15(3): 200-222.
[10] Ion Stoica, et al, Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications[J], IEEE/ACM Transactions on Networking, Feb 2003, Vol.11, 17-32.
[11] Ratnasamy, S., et al. A Scalable Content Addressable Network [C]. In SIGCOMM Conference. New York: ACM Press, 2001:161-172.
[12]闫晓东,徐惠民,徐雅静等.基于价值模型的数据副本替换算法[J].北京邮电大学学报, 2006,Vol.29(4):41-44.
[13] M. Ripeanu. Peer-to-Peer Architecture Case Study: Gnutella [C]. In Proceedings of International Conference on P2P Computing, 2001.
[14] I. Foster, C. Kesselman. Globus: A Metacomputing Infrastructure Toolkit [J]. Supercomputer Applications, 1997, vol.11(2):115-128.
[15]李东升,李春江,肖侬等.数据网格环境下一种动态自适应的副本定位方法[J].计算机研究与发展, 2003, Vol.40(12):1775-1780.
[16]吕锋,柴洁.基于小世界模型和对等代理的副本定位模型[J].武汉理工大学学报, 2007,Vol.29(7):130-132.
[17]王嫚.网格环境资源管理关键技术的研究[D].北京邮电大学博士学位论文2006.4.
[18]冯国富,张金城,顾庆.一种基于覆盖网络拓扑的无结构主动复制策略[J].软件学报2007, Vol.18(9):2226-2234.
[19] http://free.napster.com/.
[20] Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale Peer-to-Peer systems [C]. IFIP/ACM International Conference on Distributed Systems Platforms, 2001.
[21] B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing [C]. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.
[22] Kaashoek M.F., Karger R.. Koorde: A simple degree optimal distributed hash table [C]. In: Proceedings of the 2nd International Workshop on P2P Systems (IPIPS’03), Berkeley, CA,2003,98-107.
[23]陈贵海须成忠等.一种新的常数度数的P2P覆盖网络[J].计算机学报,2005 Vol.28 (7):1084-1095.
[24] Frank Dabek, M. Frans Kaashoek, Davie Karger, et al. Wide-area cooperative storage with CFS [C]. In Proceedings of ACM SOSP 2001.
[25] Antony Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility [C]. In Proceedings of ACM SOSP 2001.
[26] John Kubiatowicz, et al. OceanStore: An Architecture for Global-Scale Persistent Storage [C], In Proc. of ASPLOS 2000 Conference, November 2000.
[27] Sean Rhea, Chris Wells, Patrick Eaton, et al. Maintenance-Free Global Data Storage [C]. IEEE Internet Computing Sep/Oct 2001.
[28] Lv Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks [C]. In: Proc. of the 16th ACM Int'l Conf. on Supercomputing (ICS'02). New York: ACM Press, 2002:84-95.
[29] Kumar, A.; Xu, J.; Zegura, E.W., Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks[C]. In Proc. of IEEEInfocom, 2005, Vol.2:13-17.
[30] Qianbing Zheng, Xicheng Lu, Peidong Zhu, Wei Peng, An efficient random walks based approach to reducing file locating delay in unstructured P2P network [C]. IEEE Global Telecommunication Conf., 2005, Vol.2.
[31] Xiaomei Liu, Yunhao Liu, Li Xiao, Improving Query Response Delivery Quality in Peer-to-Peer Systems[C]. IEEE Trans. On Parallel and Distributed Systems, 2006, Vol.17:1335–1347.
[32] Freenet Website. [Online]. Available: http://freenet.sourceforge.net.
[33] Morpheus Website. [Online]. Available: http://www.musiccity.com.
[34] Androutsellis-Theotokis S, Spinellis D. A survey of peer-to-peer content distribution technologies[J]. ACM Computing Surveys,2004, 36 (4):335-371.
[35] Liang J, Kumar R, Ross KW. The Kazaa overlay: a measurement study [C]. In Proc of the 19th IEEE Annual Computer Communications Workshop, Florida, US,2004.
[36] Singh, A. Ling Liu . A hybrid topology architecture for P2P systems[C]. In Proc of ICCCN 2004, Chicago, IL , 2004:475-480.
[37] Heather Kreger.Web Services Conceptual Architecture (WSCA 1.0),2001.
[38] http://www.w3.org/2002/ws/.
[39] http://www.eu-datagrid.org/.
[40] Clarke I, Sandberg O, Wiley B. Hong TW. Freenet: A distributed anonymous information storage and retrieval system [C], In: Federrath H, ed. Proc. Of the Workshop on Design Issues in Anonymity and Unobservability. Berlin: Springer-Verlag,2001:46-66.
[41]徐志伟,李伟.织女星网格的体系结构研究[J].计算机研究与发展. 2002,Vol. 139(18):923-929.
[42] J. Han, M. Kamber. Data Mining Concept and Techniques. Beijing:Higher Education Press,2001.
[43] D.Gibson,J.Kleinberg,P.Raghavan.Inferring Web communities from link topology.The 9th ACM Conf.on Hypertext and Hypermedia,Pittsburgh,PA,USA,1998.
[44] R.Kumar,P.Raghavan,S.Rajagopalan,et al..Trawling the web for emerging cyber-communities. The 8th Int'l WWW Conf., Toronto,Canada,1999:403-415.
[45] R.Kumar,P.Raghavan,S.Rajagopalan,et al..Extracting large-scale knowledge base from the web. The 25th Int' l Conf.on Very Large Data Bases (VLDB' 99 ), Edinburgh,Scotland,1999:639-650.
[46] G.W.Flake,S.Lawrence,C.L.Giles. Efficient identification of Web communities. The 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, Boston, MA,USA,2000:150-160.
[47] S.Chakrabarti,B.E.Dom,P.Raghavan,et al.. Automatic resource compilation by analyzing hyperlink structure and associated text. Computer Networks and ISDN Systems, 1998,Vol.30(1):65-74.
[48] S.Chakrabarti,B.E.Dom,S.R.Kumar,et al.. Mining the Web's link structure.IEEE Computer,1999,Vol.32(8):60-67.
[49] M.Toyoda,Masaru Kitsuregawa. A Web community chart for navigating related communities. The 10th Int'l WWW Conf., Hong Kong,2001.
[50] P.K.Reddy,Masaru Kitsuregawa. Inferring Web communities through relaxed-cocitation and power-law.Kitsuregawa Lab,Annual, 2001.
[51] http://www.celtsc.edu.cn/.
[52] Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A practical inter-connection network RP(k) and its routing algorithms[J]. Science in China(Serial F), 2001, Vol.44(6):461-473.
[53]刘方爱,刘志勇,乔香珍.一类层次环网络的构造及路由算法[J].计算机学报, 2002, Vol.25(12):1397-1404.
[54] Adamic L A , Lukose R M, Puniyani A R, et al. Search in power-law networks[J]. Physical Review E, 2001, Vol.64:46135-46143.
[55]周旭,卢显良,侯孟书,频率自适应的动态副本管理机制[J].计算机科学, 2005, Vol.32(2):133-137.
[56] Padmanabhan VN , Subramanian L. An investigation of geographic mapping techniques for internet hosts [C]. In Proc of the ACM SIGCOMM, California, US,2001.
[57] Ripeanu M , Foster I. Mapping the gnutella network [J]. IEEE Internet Computing, 2002, Vol.6(1):50-57.
[58]黄宇,金蓓弘.非结构化P2P系统Overlay优化技术综述[J],小型微型计算机系统. 2008, Vol.29(2):238-244.
[59] Liu Y, Zhung Z, Xiao L, et al. A distributed approach to solving overlay mismatching problem [C]. In Proc of the 24th International Conference on Distributed Computing Systems(ICDCS), Tokyo Japan,2004.
[60] Liu Y, Xiao L, Liu X, et al. Location awareness in unstructured peer-to-peer systems[J]. IEEE Transaction on Parallel and Distributed Systems,2005,Vol.16(2):163-174.
[61] Xiao L, Liu Y, Ni L M. Improving unstructured peer-to-peer systems by adaptive connection establishment[J]. IEEE Transactions on Computers, 2005, Vol. 54(9):1091-1103.
[62] Liu Y, Xiao L ,Ni L M. Building a scalable bipartite P2P overlay network [C]. In Proc of the 18th International Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, New Mexico, USA, Apr. 2004.
[63] Liu Y, Esfahanian A, Xiao L, et al. Approaching optimal peer-to-peer overlays[C]. In Proc of the 13th Annual Meeting of the IEEE International Symposium on Modeling, A nalysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), A tlanta Georgia, USA, Sep. 2005.
[64] Liu Y, Zhuang Z, Xiao L, et al. AOTO:adaptive overlay topology optimization in unstructured P2P systems[C]. In Proc of IEEE GLOBECOM, San Francisco, USA, Dec. 2003.
[65] Chawathe Y, Ratnaswamy S. Make Gnutella-Like P2P Systems Scalable [C]. Proc Of The ACM SIGCOMM. Karlsruhe: ACM Press, 2003: 407-418.
[66] John R, Douceur. The Sybilattack[C]. In 1st International workshop On Peer-to-Peer Systems. Cambridge: Sp Ringer-Verlag, 2002:251-260.
[67] Tyson C, Sepandar D K, H Gm. Adaptive Peer-To-Peer Topologies [C]. In 4 Th International Conference On Peer - To - Peer Computing. Zurich: IEEE Communications Society, 2004:53-62.
[68] COOPER B. F, G - M H. Ad - Hoc Self-supervising Peer-To-Peer Search Networks[J]. ACM Transactions On Information Systems, 2005, Vol.23 (2):169-200.
[69] Ying Z, J Iang G. Oevolve: Towards Evolutionary Overlay Topologies For High Bandwidth Data Dissemination [J]. IEEE Journal On Selected Areas In Communications, 2004,Vol.22(7):1237-1251.
[70] Pandurangan G. Building Low-Diameter Peer-To-Peer Networks [C]. In Proceedings Of The 42nd IEEE Symposium On Foundations Of Computer Science. Las Vegas:IEEE Computer Society, 2001:492-502.
[71] Paul S, Laur Ie H. Adapting Peer-to- Peer Topologies To Imp Rove System Performance [C]. In Proceedings Of The 37th Hawaii International Conference On System Sciences. Big Island: IEEE Computer Society. 2004.
[72]李治军,廖明宏.对等网拓扑结构调整的图论分析[J].哈尔滨工业大学学报, 2007,Vol.39(7):1110-1013.
[73] Czajkowski, K., Ferguson, D. , Foster I., Frey J.,Graham,S.,Sedukhin,I.,Snelling,D. , Tuecke , S. , VambenePe , W. 2004. The WS-Resource Framework. http://www-106.ibm.eom/developerworks/library/ws-resource/ws-wsrf.pdf.
[74]李国杰,徐志伟.关于下一代网络体系结构与应用模式的思考[J].武汉理工大学学报(信息与管理工程版), 2002,Vol.24(3):1-6.
[75]卢国明。基于P2P的网格资源管理关键技术研究[D].电子科技大学博士学位论文, 2006.6.
[76]张君雁。网格资源管理若干问题研究[D].电子科技大学博士学位论文,2003.6.
[77] S Chapin,D Katramatos, J Karpovich et al. Resource management in Legion. Future Generation Computer Systems[J].1999, Vol.15(5):583~594.
[78] M Litzkow,M Livny,M Mutka.Condor:a hunter for idle workstations[C]. Proceedings of the8th International Conference on Distributed Computing Systems, San Jose California:IEEE Computer Society,1988:104~111.
[79] J Basney,M.Livny. Deploying a high throughput computing cluster. High Performance Cluster Computing[J].1999, Vol.1(5):356~361.
[80] R Buyya,D Abramson,J Giddy. Nimrod/G: an architecture for a resource management and scheduling system in a global computational Grid[C]. Proceedings of the 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.Beijing,China. IEEE Computer Society Press,2000:283~289.
[81] D Abramson,R Buyya,J Giddy. A computational economy for grid computing and its implementation in the Nimrod-g resource broker[J]. Future Generation Computer Systems.2002, Vol.18(8):1061~1074.
[82] R Buyya.Economic-based distributed resource management and scheduling for grid computing[D]. Ph.D.thesis,Melbourne:Monash University,2002.
[83] W Hoschek,J Jaen-Martinez,A Samar,et al.Data management in an International data grid project. In Proceedings of the 1st IEEE/ACM Int'l Workshop on Grid Computing.Berlin:Springer-Verlag,2001:17~20.
[84] F. Gagliardi, B. Jones, M. Reale, S. Burke, European Datagrid project: Experiences of deploying a large scale testbed for e-science applications performance. 2002:480-500.
[85] H.Stockinger, A.Samar, B.Allcock, et al. File and object replication in Data Grids. Journal of Cluster Computing, 2002, Vol.5(3):305~314.
[86] BERMAN, F R, WOLSKI S, FIGUEIRA J, et al. Application level scheduling on distributed heterogeneous networks[C]. In Proceedings of the ACM/IEEE Conference on Supercomputing (SC'96).
[87] Romberg, Mathilde. The UNICORE Grid infrastrucrure. Scientific programming[J], 2002, Vol.10(2):149-157.
[88] Li Dongsheng, Xiao Nong, Lu Xicheng, et al. Dynamic Self-adaptive Replica Location Method in Data Grids[C]. In Proceedings of the IEEE International Conference on Cluster Computing, 2003.
[89] W. H. Bell, D. G. Cameron, L. Capozza, et al. OptorSim-A Grid Simulator for Studying Dynamic Data Replication Strategies. Int. Journal of High Performance Computing Applications, 2003, Vol.17 (4):403-416.
[90]关志涛,曹元大,侯祥松.非结构化P2P网络中基于流行度的层次式副本创建策略[J].大连海事大学学报, 2007,Vol.33(4):51-55.
[91] Rajasekhar S, Khalil I, Tari Z, et al. Load Sharing in Peer-to-Peer Networks Using Dynamic Replication[C]. In Proc. of the 20th International Conference on Advanced Information Networking and Applications.[S.l.]: IEEE Press, 2006:1011-1016.
[92] Stefan Saroiu, P. Krishna Gummadi, Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems[C]. In Multimedia Computing and Networking Conference, San Jose,CA,2002.
[93] Ripeanu, M. , Foster, I., Iamnitchi, A.. Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design[J]. IEEE Internet Computing 2002, Vol.6(1),:50-57.
[94] Dabek, F.,Kaashoek,M. F., Karger, D., Morris, R., and Stoica, I.. Wide-area cooperative storage with CFS[C]. In symposium on Operating systems principles,2001:202-215.
[95] Moreton, T. D., Pratt, I.A., and Harris,T.L., Storage,mutability and naming in Pasta[C]. In International workshop on P2P Computing and Networking, Pisa, Italy, 2002.
[96] Miguel Castro ,Peter Druschel,Anne-Marie Kermarrec et. al. SplitStream: High-Bandwidth Content Distribution in Cooperative Environments. In 2nd International Workshop on Peer-to-Peer Systems, Berkeley,CA. Springer-Verlag, Heidelberg, 2003.
[97] John Kubiatowicz, David Bindel, Yan Chen, et. al. OceanStore: an architecture for global-scale persistent storage[C]. In Proceedings of the ninth international conference on Architectural support for programming languages and operating systems (ASPLOS '00):190–201.
[98]陈宇,董健全.非结构化P2P网络中的副本管理策略[J].计算机工程, 2008, Vol.34(18):108-110.
[99] Atul Adya, William J. Bolosky, Miguel Castro, et. al. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment[C]. In 5th Symposium on Operating Systems Design and Implementation (OSDI 2002), Boston, MA, December 2002:1-14.
[100]李春洪,冯国富,顾铁成等.一种无“热点”的覆盖网协同缓存策略[J].软件学报, 2008,Vol.19(3):744?754.
[101] Iza lM , Urvoy-Keller G, Biersack E W , et al. Dissecting BitTorrent:five months in a torrent’s life time[C]. The 5th Annual Passive and Active Measurement Workshop. Antibes Juan-les-Pins, France, 2004:1-11.
[102] Foster,I., and Iamnitehi, A. Ondeath, taxe, and the convergence of Peer-to-Peer and Grid Computing. In 2nd International Workshop on Peer-to-Peer Systems, Berkely, CA. LNCS SPringer-Verlag, Herdelberg,2003.
[103] Iyer S, Rowstron A, Druschel P. Squirrel: A decentralized, peer-to-peer Web cache[C]. In: Proc. of the 21st Symp. on Principles of Distributed Computing (PDOC 2002). New York: ACM Press, 2002.213?222.
[104]凌波;王晓宇;周傲英; Ng Wee-Siong.一种基于Peer-to-Peer技术的Web缓存共享系统研究[J].计算机学报,2005, Vol.28(2):170?178.
[105] Linga P, Gupta I, Birman K. A churn-resistant peer-to-peer Web caching system [C]. In Proc. of the ACM Workshop on Survivable and Self-Regenerative Systems. New York: ACM Press, 2003:1?10.
[106] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [C]. In: Guerraoui R, ed. Proc. of the 18th IFIP/ACM Int’l Conf. on Distributed Systems Platforms (Middleware 2001). Berlin: Springer-Verlag, 2001:329?350.
[107] Guo L, Chen SQ, Ren SS, Chen X, Jiang S. PROP: A scalable and reliable P2P assisted proxy streaming system[C]. In: Proc. of the 24th Int’l Conf. on Distributed Computing Systems (ICDCS 2004). Washington:IEEE Computer Society, 2004:778?786.
[108]徐恪,徐明伟,吴建平.分布式拒绝服务攻击研究综述[J].小型微型计算机系统, 2004, Vol.25(3):337-346.
[109] Naiwen Liu, Fangai Liu. A RP(k)-Based Educational Resource Grid and Resource Awareness Model[C]. In Proceedings of the International Symposium on Computer Science and Computational Technology (ISCSCT2008), Dec. 20-22 2008, ShangHai, China, Vol.1:25-30.
[110]许进.自补图理论及其应用[M],西安电子科技大学出版社, 1999.
[111]刘方爱.高效并行计算系统中的计算模型与通信网络[D].中科院计算技术研究所博士学位论文,2001.
[112] Howard Jya Siegel, Interconnection Newtorks for Lagre-scale Parallel Processing[M], McGraw-Hill Publishing ComPany, New York, 1990.
[113]刘方爱,刘志勇,张永胜.环、mesh嵌入RP(k)网络[J].中国科学E辑, 2004,Vol.34(8):939-950.
[114]徐恪,叶明江,胡懋智. P2P技术现状及未来发展[J].中兴通讯技术, 2007.12, Vol.13(6).
[115]罗慧,吴国新. P2P技术及其资源发现与定位[J].计算机与信息技术, 2005,Vol.12:58-60.
[116]邓智群,戴冠中,慕德俊等.网格计算与对等计算的比较研究[J].小型微型计算机系统, 2005, Vol.26(10):1742-1748.
[117]周世杰,秦志光,刘锦德.对等计算技术分析[J].计算机应用,Vol.23 (10):4-7.
[118]董方鹏,龚奕利,李伟等.网格环境中资源发现机制的研究[J].计算机研究与发展,2003,Vol.40 (12):1749-1755.
[119] K Czajkowski, S Fitzgerald, I Foster et al1 Grid information services for distributed resource sharing[C]. In Proceedings of the 10th IEEE HPDC Washington, DC:IEEE Computer Society Press, 2001:181-194.
[120] R Raman , M Livny , M Solomon1 Matchmaking : Distributed resource management for high throughput computing[C]. In Proceedings of the 7th IEEE HPDC,Washington, DC:IEEE Computer Society Press, 1998:140-146.
[121] http ://www.uddi.org.
[122] Xu Zhiwei, Sun Ninghui, Meng Dan et al. Cluster and grid superservers: The dawning experiences in China[C]. In: Proc. of the 2001 IEEE Int’l Conf on Cluster Computing (CLU STERTM01), 2001.
[123]李伟,徐志伟,卜冠英,查礼.网格环境下一种有效的资源查找方法[J].计算机学报, 2003,Vol.26 (11):1543-1546.
[124]谈恩华,查礼.织女星网格路由器的应用与改进[J].计算机研究与发展,2004,Vol.41 (12):2164-2169.
[125] A Iamnitchi, I Foster. On fully decentralized resource discovery in grid environments[C]. In Proceedings of the 2nd International Workshop on Grid Computing. Heidelberg: Springer-Verlag, 2001:51-63.
[126] M Li , W Lee, A Sivasubramaniam Neighborhood signatures for searching P2P networks[C]. In Proceedings of the 7th International Database Engineering and Applications Symposium ( IDEAS 2003) . Los Alamitos: IEEE Computer Society Press, 2003:149-159.
[127]廖敏,叶高英.一种有效的簇集主干点P2P网络结构模型[J].计算机应用,2004,Vol.24(6):48-51.
[128]周金洋,杨寿保,郭磊涛等. P2P网络中一种基于信誉感知的资源发现算法[J].小型微型计算机系统, 2006, Vol.27(10):1798-1802.
[129]李仁发,乐光学,周祖德. P2P网络环境下的一种高效搜索算法:Multilayer Light-Gossip[J].计算机研究与发展, 2006,Vol.43(6):1008-1018.
[130]冯国富,毛莺池,陆桑璐等. PeerRank:一种无结构P2P资源发现策略[J].软件学报,2006, Vol.17(5):1098?1106.
[131]周金洋,杨寿保,郭磊涛等. Gnutella环境下基于兴趣和信任的资源发现算法[J].华中科技大学学报(自然科学版) , 2006,Vol.34(Sup.I):98-100.
[132]梅一多,官尚元,冯国富等.一种可扩展的网格资源发现模型[J].华中科技大学学报(自然科学版). 2007, Vol.35(Sup.Ⅱ):12-15.
[133] Iamnitchi A , Foster I. On fully decent ralized resource discovery in grid environment s[C]. In Proceedings of the International Workshop on Grid Computing. Berlin: Springer-Ver2lag, 2001:51-62.
[134] Mast roianni C, Talia D, Verta O. A super-peer model for building resource discovery services in grids: design and simulation analysis[C]. In Proceedings of the European Grid Conference 2005. Berlin: Springer-Verlag, 2005:132-143.
[135] Abdullah A, Othman M, Sulaiman M N, et al. Data discovery mechanism for a large peer-to-peer based scientific data grid environment[C]. In Proceedings of Computational Science and Its Applications 2004. Berlin:Springer-Verlag , 2004: 146-157.
[136]朱承,张维明,刘忠等.一种基于资源类型的网格资源发现方法[J].计算机研究与发展,2004, Vol.41(12):2156-2163.
[137]李庆虎,王建民.用于教育资源管理的网格文件系统[J].计算机工程,2006,Vol.32(.24):55-57
[138]吴永和,马晓玲,肖君等.基于数据网格的教育资源服务系统的实现[J].华东师范大学学报(自然科学版),2006 ,Vol.3:99-108.
[139]张伟哲,何慧,张宏莉.支持资源自动发现的网格计算门户原型研究[J].华中科技大学学报(自然科学版) , 2007,Vol.35(Sup.II):61-64.
[140]马艳,刘方爱.基于小世界原理的教育资源发现策略[J].计算机工程与设计, 2007, Vol.28(23):5554-5777.
[141]李红梅,贺小扬,丁振.网格环境中教育资源发现机制[J].微电子学与计算,2006 ,Vol.23(9):120-122.
[142]孙霞,郑庆华.教育资源元数据语义扩展查找方法的研究[J].计算机研究与发展, 2004, Vol.41(12):2170-2174.
[143]周继鹏,朱良愿.基于物理网络拓扑的P2P系统模型.微电子学与计算机, 2006, Vol.23(10):65-67.
[144]王新华.基于MPLS网络的约束路由及故障恢复研究[D].山东师范大学博士学位论文, 2008.
[145] Ben Segal. The European DataGrid project, First Presentation At Data Mining Workshop-CSC Scientific Computing -Otaniemi 05-APR-01, http://web.datagrid.cnr.it/pls/portal30/docs/902.PDF.
[146] Rahman R M, Barker K, Alhajj R. Replica Placement in Data Grid:Considering Utility and Risk[C]. In Proc. of the International Conference on Information Technology: Coding and Computing. [S.l.]:IEEE Press, 2005.
[147]王伟,曾国荪.构造基于信任机制的自组织资源拓扑.计算机研究与发展, 2007, Vol..44(11):1849-1856.
[148]孙海燕,王晓东,周斌等.基于存储联盟的双层动态副本创建策略—SADDRES.电子学报, 2005, Vol.33(7):1222-1226.
[149] Lamehamedi H, Szymanski B. Simulation of Dynamic Data Replication Strategies in Data Grids[C]. In Proceedings of the International Parallel and Distributed Processing Symposium. [S.l.]:IEEE Press, 2003.
[150] Rahman R M, Barker K, Alhajj R. Replica Placement Design with Static Optimality and Dynamic Maintainability[C]. In Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid. [S.l.]:IEEE Press, 2006.
[151]邢长明,杨林,刘方爱.基于教育资源网格的副本放置策略[J].计算机工程, 2008, Vol.34(6):121-126.
[152] Tewari S, Kleinrock L. Proportional replication in peer-to-peer network [C]. In Proc of the 25th IEEE Int Conf. on Computer Communications. Los Alamitos, CA :IEEE Computer Society, 2006
[153] Tewari S, Kleinrock L. Optimal search performance in unstructured peer-to-peer networks with clustered demands [J]. IEEE Journal on Selected Areas in Communications, 2007,Vol.25(1):84-95.
[154] Cohen E, Shenker S. Replication strategies in unstructured peer-to-peer networks[C]. In Proc. of the Conf on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York:ACM, 2002:177-190.
[155]石祥滨,李强,王越等.一种支持MMOG兴趣管理的感知模型[J].小型微型计算机系统, 2008, Vol.29(2):251-256.
[156]石祥滨,宋立强,刘芳等.一种基于感知模型的P2PMMOG信任模型[J].系统仿真学报,2009,Vol.21(8):2326-2330.
[157]崔修涛.支持位置感知的协作环境及其关键技术研究[D].华东师范大学,博士学位论文,2007.
[158]郭磊涛.对等网络中信任感知的资源交易模型[D].中国科学技术大学,博士论文,2007.
[159]江红.对等网络中的信任感知和可信协同商务洽谈关键技术研究[D].华东师范大学,博士学位论文,2007.
[160] Naor M, Wieder U. Know the neighbor’s neighbor: better routing for skipgraphs and small worlds[J]. Lecture Notes in Computer Science, 2005:269-277.
[161] Manku G, Naor M, Wieder U. Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks[C]. In Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing. Chicago, ACM Press, 2004:54-63.
[162]戴彬,王芙蓉,刘见.一种基于邻居路由表的Chord改进算法[J].华中科技大学学报(自然科学版),2009, Vol.37(2):49-52.
[163]曹继军,苏金树,吴纯青.路由器中拥塞数据流浪费带宽问题及其解决方法[J].计算机研究与发展, 2008, Vol.45(9):1578-1588.
[164]蒲芳.普适计算中位置感知服务的研究[D].东华大学,博士学位论文,2007.
[165]姜波.普适环境下协同感知若干问题的研究[D].浙江大学,博士学位论文,2007.
[166] Gutwin,C. Workspace, Postion Paper for the ACM CHI 97 Workshop on Awareness in Collaborative systems, Atlanta, USA, 1997.
[167] C.Gutwin, and Greenberg S.,A Framework of Awareness for Small Groups in Shared-Workspace Groupware[C], JCSCW, 2002:411-446.
[168] C. G. a. S. Greenberg, Workspace Awareness for Groupware[C], In Proc. ACM Computer-Human Interface, New York,1996.
[169] A.V. B. P. Dourish, Awareness and coordination in shared workspaces[C], in Proceedings of ACM CSCW92 Conference on Computer Supported Cooperative Work, Toronto, Canada, 1992:107-114.
[170] C.Gutwin, Greenberg , S.&Roseman, M.. Workspace Awareness in Real-Tim Distributed Groupware: Framework, Widgets, and Evaluation[C], In Proc. of HCI’96, 1996:281-298.
[171]李建春,庄雷,赵宗渠.反馈机制在P2P网络资源搜索中的应用研究[J].计算机工程与应用, 2005 ,Vol.4:150-152.
[172] Guo L, Jiang S, Xiao L, et al. Exploiting content localities for efficient search in P2P systems[C]. In Proc. of the 18th International Symposium on Distributed Computing, Amsterdam, Netherlands, Oct.4-8, 2004.
[173] Markatos E P. Tracing a large-scale peer-to-peer system: an hour in the life of gnutella[C]. In Proc of the 2nd IEEE/ACM Int’l Symp. Cluster Computing and the Grid, Berlin Germany, 2002:268-269.
[174] John R. Douceur and Roger P. Wattenhofer. Competitive Hil-Climbing Strategies for Replica Placement in a Disrtibuted File System, Lecture Notes in Computer Science, 2001:48-63.
[175] Giacomo Cbar, Antonio Corradi and Franco Zamboneli, Experience of Adaptive Replication in Distributed File Systems[C]. In Proc. of EUROMICRO-22, 1996:459-466.
[176]侯孟书.基于P2P的分布式存储及其相关技术研究[D].电子科技大学博士论文,2005.
[177]孙海燕.数据网格副本管理关键技术研究[D].国防科学技术大学博士论文,2005.
[178] http://www-unix.globus.org/toolkit/.
[179] W.Allcock, J. Bester, J. Bresnahan, et. al. GridFTP: Protocol extensions to ftp for the grid. Argonne National Laboratory, August2001.
[180] Bill Allcock, John Bresnahan, Raj Kettimuthu, et al. The Globus Striped GridFTP Framework and Server[C]. In Proc. of High Performance Distributed Computing Conference, 2005.
[181] EE, Ravi K. Madduri, Cynthia S., et al. Reliable File Transfer in Grid Environments, LCN2002:737-738.
[182] Ranganathan K, Foster I. Design and Evaluation of Dynamic Replication Strategies for a High-performance Data Grid[C]. In Proc. of Int’l Conf. on Computing in High Energy and Nuclear Physics. Beijing, 2001
[183] Peter Kunszt, Erwin Laure, Heinz Stockinger, Kurt Stockinger. Advanced replica management with reptor[C]. In:5th International Conference on Parallel Proeessing and Applied Mathematics, Czestochowa, Poland, Sept. 2003.
[184] Leanne Guy, Levi Lucio. EDG Replication Metadata Catalogue. http://web.pd.astro.it/wplo/edg-20/edg-rmc-userguide.pdf.
[185] Bell W H, Cameron D G, Carvajal-Schiaffino R, et al. Evaluation of an economy-based file replication strategy for a data grid[C]. In Proc of the 3rd IEEE/ACM Int Symp on Cluster Computing and the Grid. Los Alamitos, CA: IEEE Computer Society, 2003.
[186] Ekow O, Doron R, Alexandru R. Optimal file-bundle caching algorithms for data-grids[C]. In Proc of the 2004 ACM/IEEE Conf. on Supercomputing. Los Alamitos, CA:IEEE Computer Society, 2004.
[187] Iamnitchi A, Doraimani S, Garzoglio G. Filecules in high-energy physics: Characteristics and impact on resource management[C]. In Proc. of the 15th IEEE Int Symp on High Performance Distributed Computing. Los Alamitos, CA:IEEE Computer Society, 2006:69-80.
[188]姜建锦,杨广文.数据网格中请求呈现分组特性的副本管理策略研究[J].计算机研究与发展, 2009,Vol.46(2):186-193.
[189] Jiang J, Yang G. An optimal replication strategy for data grid systems[J]. Frontiers of Computer Science in China, 2007, Vol.1(3):338-348.
[2]佘从国,席酉民.国内外管理科学与工程研究热点的比较分析[J].科学学研究, 2002(8):406-410.
[3]陈磊,李三立.数据网格中一种填空式副本分配算法[J].电子学报, 2006,Vol.34(11):1951-1954.
[4] Romberg, Mathilde. The UNICORE Grid infrastructure. Scientific programming [J]. Special Issue on Grid Computing, 2002, Vol.10(2) :149-157.
[5] I. Foster, C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure[M]. Morgan Kaufmann, San Fransisco,CA,1999.
[6] I. Foster, C. Kesselman. The Grid 2: Blueprint for a New Computing Infrastructure[M]. Morgan Kaufmann, San Fransisco,CA,2004.
[7] Foster, I., Kesselman, C., Nick, J.M., et al. Grid services for distributed system integration[J]. Computer, Vol.35(6), June 2002:37-46.
[8]徐志伟,冯百明,李伟.网格计算技术[M].北京:电子工业出版社,2004.5.
[9] I. Foster, C. Kesselman, S. Tuecke. The Anatomy of the Grid: Enabling Scalable Virtual Organizations[J]. International Journal of High Performance Computing Applications, 2001,Vol.15(3): 200-222.
[10] Ion Stoica, et al, Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications[J], IEEE/ACM Transactions on Networking, Feb 2003, Vol.11, 17-32.
[11] Ratnasamy, S., et al. A Scalable Content Addressable Network [C]. In SIGCOMM Conference. New York: ACM Press, 2001:161-172.
[12]闫晓东,徐惠民,徐雅静等.基于价值模型的数据副本替换算法[J].北京邮电大学学报, 2006,Vol.29(4):41-44.
[13] M. Ripeanu. Peer-to-Peer Architecture Case Study: Gnutella [C]. In Proceedings of International Conference on P2P Computing, 2001.
[14] I. Foster, C. Kesselman. Globus: A Metacomputing Infrastructure Toolkit [J]. Supercomputer Applications, 1997, vol.11(2):115-128.
[15]李东升,李春江,肖侬等.数据网格环境下一种动态自适应的副本定位方法[J].计算机研究与发展, 2003, Vol.40(12):1775-1780.
[16]吕锋,柴洁.基于小世界模型和对等代理的副本定位模型[J].武汉理工大学学报, 2007,Vol.29(7):130-132.
[17]王嫚.网格环境资源管理关键技术的研究[D].北京邮电大学博士学位论文2006.4.
[18]冯国富,张金城,顾庆.一种基于覆盖网络拓扑的无结构主动复制策略[J].软件学报2007, Vol.18(9):2226-2234.
[19] http://free.napster.com/.
[20] Antony Rowstron and Peter Druschel. Pastry: Scalable, decentralized object location and routing for large-scale Peer-to-Peer systems [C]. IFIP/ACM International Conference on Distributed Systems Platforms, 2001.
[21] B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph. Tapestry: An infrastructure for fault-tolerant wide-area location and routing [C]. Technical Report UCB/CSD-01-1141, UC Berkeley, April 2001.
[22] Kaashoek M.F., Karger R.. Koorde: A simple degree optimal distributed hash table [C]. In: Proceedings of the 2nd International Workshop on P2P Systems (IPIPS’03), Berkeley, CA,2003,98-107.
[23]陈贵海须成忠等.一种新的常数度数的P2P覆盖网络[J].计算机学报,2005 Vol.28 (7):1084-1095.
[24] Frank Dabek, M. Frans Kaashoek, Davie Karger, et al. Wide-area cooperative storage with CFS [C]. In Proceedings of ACM SOSP 2001.
[25] Antony Rowstron and Peter Druschel. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility [C]. In Proceedings of ACM SOSP 2001.
[26] John Kubiatowicz, et al. OceanStore: An Architecture for Global-Scale Persistent Storage [C], In Proc. of ASPLOS 2000 Conference, November 2000.
[27] Sean Rhea, Chris Wells, Patrick Eaton, et al. Maintenance-Free Global Data Storage [C]. IEEE Internet Computing Sep/Oct 2001.
[28] Lv Q, Cao P, Cohen E, Li K, Shenker S. Search and replication in unstructured peer-to-peer networks [C]. In: Proc. of the 16th ACM Int'l Conf. on Supercomputing (ICS'02). New York: ACM Press, 2002:84-95.
[29] Kumar, A.; Xu, J.; Zegura, E.W., Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks[C]. In Proc. of IEEEInfocom, 2005, Vol.2:13-17.
[30] Qianbing Zheng, Xicheng Lu, Peidong Zhu, Wei Peng, An efficient random walks based approach to reducing file locating delay in unstructured P2P network [C]. IEEE Global Telecommunication Conf., 2005, Vol.2.
[31] Xiaomei Liu, Yunhao Liu, Li Xiao, Improving Query Response Delivery Quality in Peer-to-Peer Systems[C]. IEEE Trans. On Parallel and Distributed Systems, 2006, Vol.17:1335–1347.
[32] Freenet Website. [Online]. Available: http://freenet.sourceforge.net.
[33] Morpheus Website. [Online]. Available: http://www.musiccity.com.
[34] Androutsellis-Theotokis S, Spinellis D. A survey of peer-to-peer content distribution technologies[J]. ACM Computing Surveys,2004, 36 (4):335-371.
[35] Liang J, Kumar R, Ross KW. The Kazaa overlay: a measurement study [C]. In Proc of the 19th IEEE Annual Computer Communications Workshop, Florida, US,2004.
[36] Singh, A. Ling Liu . A hybrid topology architecture for P2P systems[C]. In Proc of ICCCN 2004, Chicago, IL , 2004:475-480.
[37] Heather Kreger.Web Services Conceptual Architecture (WSCA 1.0),2001.
[38] http://www.w3.org/2002/ws/.
[39] http://www.eu-datagrid.org/.
[40] Clarke I, Sandberg O, Wiley B. Hong TW. Freenet: A distributed anonymous information storage and retrieval system [C], In: Federrath H, ed. Proc. Of the Workshop on Design Issues in Anonymity and Unobservability. Berlin: Springer-Verlag,2001:46-66.
[41]徐志伟,李伟.织女星网格的体系结构研究[J].计算机研究与发展. 2002,Vol. 139(18):923-929.
[42] J. Han, M. Kamber. Data Mining Concept and Techniques. Beijing:Higher Education Press,2001.
[43] D.Gibson,J.Kleinberg,P.Raghavan.Inferring Web communities from link topology.The 9th ACM Conf.on Hypertext and Hypermedia,Pittsburgh,PA,USA,1998.
[44] R.Kumar,P.Raghavan,S.Rajagopalan,et al..Trawling the web for emerging cyber-communities. The 8th Int'l WWW Conf., Toronto,Canada,1999:403-415.
[45] R.Kumar,P.Raghavan,S.Rajagopalan,et al..Extracting large-scale knowledge base from the web. The 25th Int' l Conf.on Very Large Data Bases (VLDB' 99 ), Edinburgh,Scotland,1999:639-650.
[46] G.W.Flake,S.Lawrence,C.L.Giles. Efficient identification of Web communities. The 6th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining, Boston, MA,USA,2000:150-160.
[47] S.Chakrabarti,B.E.Dom,P.Raghavan,et al.. Automatic resource compilation by analyzing hyperlink structure and associated text. Computer Networks and ISDN Systems, 1998,Vol.30(1):65-74.
[48] S.Chakrabarti,B.E.Dom,S.R.Kumar,et al.. Mining the Web's link structure.IEEE Computer,1999,Vol.32(8):60-67.
[49] M.Toyoda,Masaru Kitsuregawa. A Web community chart for navigating related communities. The 10th Int'l WWW Conf., Hong Kong,2001.
[50] P.K.Reddy,Masaru Kitsuregawa. Inferring Web communities through relaxed-cocitation and power-law.Kitsuregawa Lab,Annual, 2001.
[51] http://www.celtsc.edu.cn/.
[52] Liu Fang-Ai, Liu Zhi-Yong, Qiao Xiang-Zhen. A practical inter-connection network RP(k) and its routing algorithms[J]. Science in China(Serial F), 2001, Vol.44(6):461-473.
[53]刘方爱,刘志勇,乔香珍.一类层次环网络的构造及路由算法[J].计算机学报, 2002, Vol.25(12):1397-1404.
[54] Adamic L A , Lukose R M, Puniyani A R, et al. Search in power-law networks[J]. Physical Review E, 2001, Vol.64:46135-46143.
[55]周旭,卢显良,侯孟书,频率自适应的动态副本管理机制[J].计算机科学, 2005, Vol.32(2):133-137.
[56] Padmanabhan VN , Subramanian L. An investigation of geographic mapping techniques for internet hosts [C]. In Proc of the ACM SIGCOMM, California, US,2001.
[57] Ripeanu M , Foster I. Mapping the gnutella network [J]. IEEE Internet Computing, 2002, Vol.6(1):50-57.
[58]黄宇,金蓓弘.非结构化P2P系统Overlay优化技术综述[J],小型微型计算机系统. 2008, Vol.29(2):238-244.
[59] Liu Y, Zhung Z, Xiao L, et al. A distributed approach to solving overlay mismatching problem [C]. In Proc of the 24th International Conference on Distributed Computing Systems(ICDCS), Tokyo Japan,2004.
[60] Liu Y, Xiao L, Liu X, et al. Location awareness in unstructured peer-to-peer systems[J]. IEEE Transaction on Parallel and Distributed Systems,2005,Vol.16(2):163-174.
[61] Xiao L, Liu Y, Ni L M. Improving unstructured peer-to-peer systems by adaptive connection establishment[J]. IEEE Transactions on Computers, 2005, Vol. 54(9):1091-1103.
[62] Liu Y, Xiao L ,Ni L M. Building a scalable bipartite P2P overlay network [C]. In Proc of the 18th International Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, New Mexico, USA, Apr. 2004.
[63] Liu Y, Esfahanian A, Xiao L, et al. Approaching optimal peer-to-peer overlays[C]. In Proc of the 13th Annual Meeting of the IEEE International Symposium on Modeling, A nalysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), A tlanta Georgia, USA, Sep. 2005.
[64] Liu Y, Zhuang Z, Xiao L, et al. AOTO:adaptive overlay topology optimization in unstructured P2P systems[C]. In Proc of IEEE GLOBECOM, San Francisco, USA, Dec. 2003.
[65] Chawathe Y, Ratnaswamy S. Make Gnutella-Like P2P Systems Scalable [C]. Proc Of The ACM SIGCOMM. Karlsruhe: ACM Press, 2003: 407-418.
[66] John R, Douceur. The Sybilattack[C]. In 1st International workshop On Peer-to-Peer Systems. Cambridge: Sp Ringer-Verlag, 2002:251-260.
[67] Tyson C, Sepandar D K, H Gm. Adaptive Peer-To-Peer Topologies [C]. In 4 Th International Conference On Peer - To - Peer Computing. Zurich: IEEE Communications Society, 2004:53-62.
[68] COOPER B. F, G - M H. Ad - Hoc Self-supervising Peer-To-Peer Search Networks[J]. ACM Transactions On Information Systems, 2005, Vol.23 (2):169-200.
[69] Ying Z, J Iang G. Oevolve: Towards Evolutionary Overlay Topologies For High Bandwidth Data Dissemination [J]. IEEE Journal On Selected Areas In Communications, 2004,Vol.22(7):1237-1251.
[70] Pandurangan G. Building Low-Diameter Peer-To-Peer Networks [C]. In Proceedings Of The 42nd IEEE Symposium On Foundations Of Computer Science. Las Vegas:IEEE Computer Society, 2001:492-502.
[71] Paul S, Laur Ie H. Adapting Peer-to- Peer Topologies To Imp Rove System Performance [C]. In Proceedings Of The 37th Hawaii International Conference On System Sciences. Big Island: IEEE Computer Society. 2004.
[72]李治军,廖明宏.对等网拓扑结构调整的图论分析[J].哈尔滨工业大学学报, 2007,Vol.39(7):1110-1013.
[73] Czajkowski, K., Ferguson, D. , Foster I., Frey J.,Graham,S.,Sedukhin,I.,Snelling,D. , Tuecke , S. , VambenePe , W. 2004. The WS-Resource Framework. http://www-106.ibm.eom/developerworks/library/ws-resource/ws-wsrf.pdf.
[74]李国杰,徐志伟.关于下一代网络体系结构与应用模式的思考[J].武汉理工大学学报(信息与管理工程版), 2002,Vol.24(3):1-6.
[75]卢国明。基于P2P的网格资源管理关键技术研究[D].电子科技大学博士学位论文, 2006.6.
[76]张君雁。网格资源管理若干问题研究[D].电子科技大学博士学位论文,2003.6.
[77] S Chapin,D Katramatos, J Karpovich et al. Resource management in Legion. Future Generation Computer Systems[J].1999, Vol.15(5):583~594.
[78] M Litzkow,M Livny,M Mutka.Condor:a hunter for idle workstations[C]. Proceedings of the8th International Conference on Distributed Computing Systems, San Jose California:IEEE Computer Society,1988:104~111.
[79] J Basney,M.Livny. Deploying a high throughput computing cluster. High Performance Cluster Computing[J].1999, Vol.1(5):356~361.
[80] R Buyya,D Abramson,J Giddy. Nimrod/G: an architecture for a resource management and scheduling system in a global computational Grid[C]. Proceedings of the 4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region.Beijing,China. IEEE Computer Society Press,2000:283~289.
[81] D Abramson,R Buyya,J Giddy. A computational economy for grid computing and its implementation in the Nimrod-g resource broker[J]. Future Generation Computer Systems.2002, Vol.18(8):1061~1074.
[82] R Buyya.Economic-based distributed resource management and scheduling for grid computing[D]. Ph.D.thesis,Melbourne:Monash University,2002.
[83] W Hoschek,J Jaen-Martinez,A Samar,et al.Data management in an International data grid project. In Proceedings of the 1st IEEE/ACM Int'l Workshop on Grid Computing.Berlin:Springer-Verlag,2001:17~20.
[84] F. Gagliardi, B. Jones, M. Reale, S. Burke, European Datagrid project: Experiences of deploying a large scale testbed for e-science applications performance. 2002:480-500.
[85] H.Stockinger, A.Samar, B.Allcock, et al. File and object replication in Data Grids. Journal of Cluster Computing, 2002, Vol.5(3):305~314.
[86] BERMAN, F R, WOLSKI S, FIGUEIRA J, et al. Application level scheduling on distributed heterogeneous networks[C]. In Proceedings of the ACM/IEEE Conference on Supercomputing (SC'96).
[87] Romberg, Mathilde. The UNICORE Grid infrastrucrure. Scientific programming[J], 2002, Vol.10(2):149-157.
[88] Li Dongsheng, Xiao Nong, Lu Xicheng, et al. Dynamic Self-adaptive Replica Location Method in Data Grids[C]. In Proceedings of the IEEE International Conference on Cluster Computing, 2003.
[89] W. H. Bell, D. G. Cameron, L. Capozza, et al. OptorSim-A Grid Simulator for Studying Dynamic Data Replication Strategies. Int. Journal of High Performance Computing Applications, 2003, Vol.17 (4):403-416.
[90]关志涛,曹元大,侯祥松.非结构化P2P网络中基于流行度的层次式副本创建策略[J].大连海事大学学报, 2007,Vol.33(4):51-55.
[91] Rajasekhar S, Khalil I, Tari Z, et al. Load Sharing in Peer-to-Peer Networks Using Dynamic Replication[C]. In Proc. of the 20th International Conference on Advanced Information Networking and Applications.[S.l.]: IEEE Press, 2006:1011-1016.
[92] Stefan Saroiu, P. Krishna Gummadi, Steven D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems[C]. In Multimedia Computing and Networking Conference, San Jose,CA,2002.
[93] Ripeanu, M. , Foster, I., Iamnitchi, A.. Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design[J]. IEEE Internet Computing 2002, Vol.6(1),:50-57.
[94] Dabek, F.,Kaashoek,M. F., Karger, D., Morris, R., and Stoica, I.. Wide-area cooperative storage with CFS[C]. In symposium on Operating systems principles,2001:202-215.
[95] Moreton, T. D., Pratt, I.A., and Harris,T.L., Storage,mutability and naming in Pasta[C]. In International workshop on P2P Computing and Networking, Pisa, Italy, 2002.
[96] Miguel Castro ,Peter Druschel,Anne-Marie Kermarrec et. al. SplitStream: High-Bandwidth Content Distribution in Cooperative Environments. In 2nd International Workshop on Peer-to-Peer Systems, Berkeley,CA. Springer-Verlag, Heidelberg, 2003.
[97] John Kubiatowicz, David Bindel, Yan Chen, et. al. OceanStore: an architecture for global-scale persistent storage[C]. In Proceedings of the ninth international conference on Architectural support for programming languages and operating systems (ASPLOS '00):190–201.
[98]陈宇,董健全.非结构化P2P网络中的副本管理策略[J].计算机工程, 2008, Vol.34(18):108-110.
[99] Atul Adya, William J. Bolosky, Miguel Castro, et. al. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment[C]. In 5th Symposium on Operating Systems Design and Implementation (OSDI 2002), Boston, MA, December 2002:1-14.
[100]李春洪,冯国富,顾铁成等.一种无“热点”的覆盖网协同缓存策略[J].软件学报, 2008,Vol.19(3):744?754.
[101] Iza lM , Urvoy-Keller G, Biersack E W , et al. Dissecting BitTorrent:five months in a torrent’s life time[C]. The 5th Annual Passive and Active Measurement Workshop. Antibes Juan-les-Pins, France, 2004:1-11.
[102] Foster,I., and Iamnitehi, A. Ondeath, taxe, and the convergence of Peer-to-Peer and Grid Computing. In 2nd International Workshop on Peer-to-Peer Systems, Berkely, CA. LNCS SPringer-Verlag, Herdelberg,2003.
[103] Iyer S, Rowstron A, Druschel P. Squirrel: A decentralized, peer-to-peer Web cache[C]. In: Proc. of the 21st Symp. on Principles of Distributed Computing (PDOC 2002). New York: ACM Press, 2002.213?222.
[104]凌波;王晓宇;周傲英; Ng Wee-Siong.一种基于Peer-to-Peer技术的Web缓存共享系统研究[J].计算机学报,2005, Vol.28(2):170?178.
[105] Linga P, Gupta I, Birman K. A churn-resistant peer-to-peer Web caching system [C]. In Proc. of the ACM Workshop on Survivable and Self-Regenerative Systems. New York: ACM Press, 2003:1?10.
[106] Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [C]. In: Guerraoui R, ed. Proc. of the 18th IFIP/ACM Int’l Conf. on Distributed Systems Platforms (Middleware 2001). Berlin: Springer-Verlag, 2001:329?350.
[107] Guo L, Chen SQ, Ren SS, Chen X, Jiang S. PROP: A scalable and reliable P2P assisted proxy streaming system[C]. In: Proc. of the 24th Int’l Conf. on Distributed Computing Systems (ICDCS 2004). Washington:IEEE Computer Society, 2004:778?786.
[108]徐恪,徐明伟,吴建平.分布式拒绝服务攻击研究综述[J].小型微型计算机系统, 2004, Vol.25(3):337-346.
[109] Naiwen Liu, Fangai Liu. A RP(k)-Based Educational Resource Grid and Resource Awareness Model[C]. In Proceedings of the International Symposium on Computer Science and Computational Technology (ISCSCT2008), Dec. 20-22 2008, ShangHai, China, Vol.1:25-30.
[110]许进.自补图理论及其应用[M],西安电子科技大学出版社, 1999.
[111]刘方爱.高效并行计算系统中的计算模型与通信网络[D].中科院计算技术研究所博士学位论文,2001.
[112] Howard Jya Siegel, Interconnection Newtorks for Lagre-scale Parallel Processing[M], McGraw-Hill Publishing ComPany, New York, 1990.
[113]刘方爱,刘志勇,张永胜.环、mesh嵌入RP(k)网络[J].中国科学E辑, 2004,Vol.34(8):939-950.
[114]徐恪,叶明江,胡懋智. P2P技术现状及未来发展[J].中兴通讯技术, 2007.12, Vol.13(6).
[115]罗慧,吴国新. P2P技术及其资源发现与定位[J].计算机与信息技术, 2005,Vol.12:58-60.
[116]邓智群,戴冠中,慕德俊等.网格计算与对等计算的比较研究[J].小型微型计算机系统, 2005, Vol.26(10):1742-1748.
[117]周世杰,秦志光,刘锦德.对等计算技术分析[J].计算机应用,Vol.23 (10):4-7.
[118]董方鹏,龚奕利,李伟等.网格环境中资源发现机制的研究[J].计算机研究与发展,2003,Vol.40 (12):1749-1755.
[119] K Czajkowski, S Fitzgerald, I Foster et al1 Grid information services for distributed resource sharing[C]. In Proceedings of the 10th IEEE HPDC Washington, DC:IEEE Computer Society Press, 2001:181-194.
[120] R Raman , M Livny , M Solomon1 Matchmaking : Distributed resource management for high throughput computing[C]. In Proceedings of the 7th IEEE HPDC,Washington, DC:IEEE Computer Society Press, 1998:140-146.
[121] http ://www.uddi.org.
[122] Xu Zhiwei, Sun Ninghui, Meng Dan et al. Cluster and grid superservers: The dawning experiences in China[C]. In: Proc. of the 2001 IEEE Int’l Conf on Cluster Computing (CLU STERTM01), 2001.
[123]李伟,徐志伟,卜冠英,查礼.网格环境下一种有效的资源查找方法[J].计算机学报, 2003,Vol.26 (11):1543-1546.
[124]谈恩华,查礼.织女星网格路由器的应用与改进[J].计算机研究与发展,2004,Vol.41 (12):2164-2169.
[125] A Iamnitchi, I Foster. On fully decentralized resource discovery in grid environments[C]. In Proceedings of the 2nd International Workshop on Grid Computing. Heidelberg: Springer-Verlag, 2001:51-63.
[126] M Li , W Lee, A Sivasubramaniam Neighborhood signatures for searching P2P networks[C]. In Proceedings of the 7th International Database Engineering and Applications Symposium ( IDEAS 2003) . Los Alamitos: IEEE Computer Society Press, 2003:149-159.
[127]廖敏,叶高英.一种有效的簇集主干点P2P网络结构模型[J].计算机应用,2004,Vol.24(6):48-51.
[128]周金洋,杨寿保,郭磊涛等. P2P网络中一种基于信誉感知的资源发现算法[J].小型微型计算机系统, 2006, Vol.27(10):1798-1802.
[129]李仁发,乐光学,周祖德. P2P网络环境下的一种高效搜索算法:Multilayer Light-Gossip[J].计算机研究与发展, 2006,Vol.43(6):1008-1018.
[130]冯国富,毛莺池,陆桑璐等. PeerRank:一种无结构P2P资源发现策略[J].软件学报,2006, Vol.17(5):1098?1106.
[131]周金洋,杨寿保,郭磊涛等. Gnutella环境下基于兴趣和信任的资源发现算法[J].华中科技大学学报(自然科学版) , 2006,Vol.34(Sup.I):98-100.
[132]梅一多,官尚元,冯国富等.一种可扩展的网格资源发现模型[J].华中科技大学学报(自然科学版). 2007, Vol.35(Sup.Ⅱ):12-15.
[133] Iamnitchi A , Foster I. On fully decent ralized resource discovery in grid environment s[C]. In Proceedings of the International Workshop on Grid Computing. Berlin: Springer-Ver2lag, 2001:51-62.
[134] Mast roianni C, Talia D, Verta O. A super-peer model for building resource discovery services in grids: design and simulation analysis[C]. In Proceedings of the European Grid Conference 2005. Berlin: Springer-Verlag, 2005:132-143.
[135] Abdullah A, Othman M, Sulaiman M N, et al. Data discovery mechanism for a large peer-to-peer based scientific data grid environment[C]. In Proceedings of Computational Science and Its Applications 2004. Berlin:Springer-Verlag , 2004: 146-157.
[136]朱承,张维明,刘忠等.一种基于资源类型的网格资源发现方法[J].计算机研究与发展,2004, Vol.41(12):2156-2163.
[137]李庆虎,王建民.用于教育资源管理的网格文件系统[J].计算机工程,2006,Vol.32(.24):55-57
[138]吴永和,马晓玲,肖君等.基于数据网格的教育资源服务系统的实现[J].华东师范大学学报(自然科学版),2006 ,Vol.3:99-108.
[139]张伟哲,何慧,张宏莉.支持资源自动发现的网格计算门户原型研究[J].华中科技大学学报(自然科学版) , 2007,Vol.35(Sup.II):61-64.
[140]马艳,刘方爱.基于小世界原理的教育资源发现策略[J].计算机工程与设计, 2007, Vol.28(23):5554-5777.
[141]李红梅,贺小扬,丁振.网格环境中教育资源发现机制[J].微电子学与计算,2006 ,Vol.23(9):120-122.
[142]孙霞,郑庆华.教育资源元数据语义扩展查找方法的研究[J].计算机研究与发展, 2004, Vol.41(12):2170-2174.
[143]周继鹏,朱良愿.基于物理网络拓扑的P2P系统模型.微电子学与计算机, 2006, Vol.23(10):65-67.
[144]王新华.基于MPLS网络的约束路由及故障恢复研究[D].山东师范大学博士学位论文, 2008.
[145] Ben Segal. The European DataGrid project, First Presentation At Data Mining Workshop-CSC Scientific Computing -Otaniemi 05-APR-01, http://web.datagrid.cnr.it/pls/portal30/docs/902.PDF.
[146] Rahman R M, Barker K, Alhajj R. Replica Placement in Data Grid:Considering Utility and Risk[C]. In Proc. of the International Conference on Information Technology: Coding and Computing. [S.l.]:IEEE Press, 2005.
[147]王伟,曾国荪.构造基于信任机制的自组织资源拓扑.计算机研究与发展, 2007, Vol..44(11):1849-1856.
[148]孙海燕,王晓东,周斌等.基于存储联盟的双层动态副本创建策略—SADDRES.电子学报, 2005, Vol.33(7):1222-1226.
[149] Lamehamedi H, Szymanski B. Simulation of Dynamic Data Replication Strategies in Data Grids[C]. In Proceedings of the International Parallel and Distributed Processing Symposium. [S.l.]:IEEE Press, 2003.
[150] Rahman R M, Barker K, Alhajj R. Replica Placement Design with Static Optimality and Dynamic Maintainability[C]. In Proceedings of the 6th IEEE International Symposium on Cluster Computing and the Grid. [S.l.]:IEEE Press, 2006.
[151]邢长明,杨林,刘方爱.基于教育资源网格的副本放置策略[J].计算机工程, 2008, Vol.34(6):121-126.
[152] Tewari S, Kleinrock L. Proportional replication in peer-to-peer network [C]. In Proc of the 25th IEEE Int Conf. on Computer Communications. Los Alamitos, CA :IEEE Computer Society, 2006
[153] Tewari S, Kleinrock L. Optimal search performance in unstructured peer-to-peer networks with clustered demands [J]. IEEE Journal on Selected Areas in Communications, 2007,Vol.25(1):84-95.
[154] Cohen E, Shenker S. Replication strategies in unstructured peer-to-peer networks[C]. In Proc. of the Conf on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York:ACM, 2002:177-190.
[155]石祥滨,李强,王越等.一种支持MMOG兴趣管理的感知模型[J].小型微型计算机系统, 2008, Vol.29(2):251-256.
[156]石祥滨,宋立强,刘芳等.一种基于感知模型的P2PMMOG信任模型[J].系统仿真学报,2009,Vol.21(8):2326-2330.
[157]崔修涛.支持位置感知的协作环境及其关键技术研究[D].华东师范大学,博士学位论文,2007.
[158]郭磊涛.对等网络中信任感知的资源交易模型[D].中国科学技术大学,博士论文,2007.
[159]江红.对等网络中的信任感知和可信协同商务洽谈关键技术研究[D].华东师范大学,博士学位论文,2007.
[160] Naor M, Wieder U. Know the neighbor’s neighbor: better routing for skipgraphs and small worlds[J]. Lecture Notes in Computer Science, 2005:269-277.
[161] Manku G, Naor M, Wieder U. Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks[C]. In Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing. Chicago, ACM Press, 2004:54-63.
[162]戴彬,王芙蓉,刘见.一种基于邻居路由表的Chord改进算法[J].华中科技大学学报(自然科学版),2009, Vol.37(2):49-52.
[163]曹继军,苏金树,吴纯青.路由器中拥塞数据流浪费带宽问题及其解决方法[J].计算机研究与发展, 2008, Vol.45(9):1578-1588.
[164]蒲芳.普适计算中位置感知服务的研究[D].东华大学,博士学位论文,2007.
[165]姜波.普适环境下协同感知若干问题的研究[D].浙江大学,博士学位论文,2007.
[166] Gutwin,C. Workspace, Postion Paper for the ACM CHI 97 Workshop on Awareness in Collaborative systems, Atlanta, USA, 1997.
[167] C.Gutwin, and Greenberg S.,A Framework of Awareness for Small Groups in Shared-Workspace Groupware[C], JCSCW, 2002:411-446.
[168] C. G. a. S. Greenberg, Workspace Awareness for Groupware[C], In Proc. ACM Computer-Human Interface, New York,1996.
[169] A.V. B. P. Dourish, Awareness and coordination in shared workspaces[C], in Proceedings of ACM CSCW92 Conference on Computer Supported Cooperative Work, Toronto, Canada, 1992:107-114.
[170] C.Gutwin, Greenberg , S.&Roseman, M.. Workspace Awareness in Real-Tim Distributed Groupware: Framework, Widgets, and Evaluation[C], In Proc. of HCI’96, 1996:281-298.
[171]李建春,庄雷,赵宗渠.反馈机制在P2P网络资源搜索中的应用研究[J].计算机工程与应用, 2005 ,Vol.4:150-152.
[172] Guo L, Jiang S, Xiao L, et al. Exploiting content localities for efficient search in P2P systems[C]. In Proc. of the 18th International Symposium on Distributed Computing, Amsterdam, Netherlands, Oct.4-8, 2004.
[173] Markatos E P. Tracing a large-scale peer-to-peer system: an hour in the life of gnutella[C]. In Proc of the 2nd IEEE/ACM Int’l Symp. Cluster Computing and the Grid, Berlin Germany, 2002:268-269.
[174] John R. Douceur and Roger P. Wattenhofer. Competitive Hil-Climbing Strategies for Replica Placement in a Disrtibuted File System, Lecture Notes in Computer Science, 2001:48-63.
[175] Giacomo Cbar, Antonio Corradi and Franco Zamboneli, Experience of Adaptive Replication in Distributed File Systems[C]. In Proc. of EUROMICRO-22, 1996:459-466.
[176]侯孟书.基于P2P的分布式存储及其相关技术研究[D].电子科技大学博士论文,2005.
[177]孙海燕.数据网格副本管理关键技术研究[D].国防科学技术大学博士论文,2005.
[178] http://www-unix.globus.org/toolkit/.
[179] W.Allcock, J. Bester, J. Bresnahan, et. al. GridFTP: Protocol extensions to ftp for the grid. Argonne National Laboratory, August2001.
[180] Bill Allcock, John Bresnahan, Raj Kettimuthu, et al. The Globus Striped GridFTP Framework and Server[C]. In Proc. of High Performance Distributed Computing Conference, 2005.
[181] EE, Ravi K. Madduri, Cynthia S., et al. Reliable File Transfer in Grid Environments, LCN2002:737-738.
[182] Ranganathan K, Foster I. Design and Evaluation of Dynamic Replication Strategies for a High-performance Data Grid[C]. In Proc. of Int’l Conf. on Computing in High Energy and Nuclear Physics. Beijing, 2001
[183] Peter Kunszt, Erwin Laure, Heinz Stockinger, Kurt Stockinger. Advanced replica management with reptor[C]. In:5th International Conference on Parallel Proeessing and Applied Mathematics, Czestochowa, Poland, Sept. 2003.
[184] Leanne Guy, Levi Lucio. EDG Replication Metadata Catalogue. http://web.pd.astro.it/wplo/edg-20/edg-rmc-userguide.pdf.
[185] Bell W H, Cameron D G, Carvajal-Schiaffino R, et al. Evaluation of an economy-based file replication strategy for a data grid[C]. In Proc of the 3rd IEEE/ACM Int Symp on Cluster Computing and the Grid. Los Alamitos, CA: IEEE Computer Society, 2003.
[186] Ekow O, Doron R, Alexandru R. Optimal file-bundle caching algorithms for data-grids[C]. In Proc of the 2004 ACM/IEEE Conf. on Supercomputing. Los Alamitos, CA:IEEE Computer Society, 2004.
[187] Iamnitchi A, Doraimani S, Garzoglio G. Filecules in high-energy physics: Characteristics and impact on resource management[C]. In Proc. of the 15th IEEE Int Symp on High Performance Distributed Computing. Los Alamitos, CA:IEEE Computer Society, 2006:69-80.
[188]姜建锦,杨广文.数据网格中请求呈现分组特性的副本管理策略研究[J].计算机研究与发展, 2009,Vol.46(2):186-193.
[189] Jiang J, Yang G. An optimal replication strategy for data grid systems[J]. Frontiers of Computer Science in China, 2007, Vol.1(3):338-348.