基于Chord的高效P2P网格资源发现新方法
New Approaches with Chord in Efficient P2P Grid Resource Discovery
摘要：
网格计算是一种分布式计算，它允许通过Internet共享计算机资源。它不仅允许我们共享文件，还允许我们共享大部分软件和硬件资源。高效的资源发现机制是网格计算系统的基本要求，它支持应用程序的资源管理和调度。在众多的发现机制中，P2P（Peer-to-Peer）技术发展迅速，而P2P技术的高效查找应用是其成功的关键。Chord是一种P2P结构模型，被广泛用作网格环境下资源发现的路由协议。为了提高Chord协议在网格环境下的查找性能，研究者们提出了许多改进的方法。本文讨论了Chord结构P2P协议的最新研究成果，提出了一种基于最近访问节点（RVN）地址和模糊技术的网格资源定位方法，降低了消息复杂度和时间复杂度。
英文摘要：
Grid computing is a type of distributed computing which allows sharing of computer resources through Internet. It not only allows us to share files but also most of the software and hardware resources. An efficient resource discovery mechanism is the fundamental requirements for grid computing systems, as it supports resource management and scheduling of applications. Among various discovery mechanisms,Peer-to-Peer (P2P) technology witnessed rapid development and the key component for this success is efficient lookup applications of P2P. Chord is a P2P structural model widely used as a routing protocol to find resources in grid environment. Plenty of ideas are implemented by researchers to improve the lookup performance of chord protocol in Grid environment. In this paper, we discuss the recent researches made on Chord Structured P2P protocol and present our proposed methods in which we use the address of Recently Visited Node (RVN) and fuzzy technique to easily locate the grid resources by reducing message complexity and time complexity.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
