摘要: 提出了一种新的C/S和P2P结合的网格环境中的资源发现机制――VIRD。它采用属性-值对的请求描述方法,提供了比基于名字的方法更强的查询能力。VIRD采用3层结构,资源信息在同一域内定期更新传播。用户请求先在域内进行查找,如果不能满足,再转发到域间。试验显示,即使在资源频度比较低、允许的最大TTL值很小的情况下,VIRD仍能获得比较高的查找成功率。和flooding和random walk相比,在相同查找成功率的情况下,VIRD所需的网络通信量和响应时间远小于二者。
关键词:
网格,
资源发现,
P2P,
VIRD
Abstract: This paper proposes a C/S and P2P hybrid resource discovery framework, VIRD. It adopts a request description approach based on attribute-value pairs. VIRD adopts the three-layer architecture. Resource information is propagated within a domain periodically. User requests are handled in domains first. If there are no satisfactory resources, the request will be forwarded to the backbone. According to the simulations, even when the resource density is low and the max TTL is small, VIRD can still achieve high success rate. Compared with flooding and random walk, with the same search success rate, the network traffic and request response time of VIRD are much less than them.
Key words:
Grid,
Resource discovery,
Peer-to-peer,
VIRD
中图分类号:
龚奕利; ;李 伟;孙毓忠. 网格环境中资源发现方法研究[J]. 计算机工程, 2006, 32(17): 162-164.
GONG Yili; ; LI Wei; SUN Yuzhong. Research on Resource Discovery in Grid Environments[J]. Computer Engineering, 2006, 32(17): 162-164.