%0 Journal Article
%T Mincost-based grid resource discovery model<br>一种基于最小代价的网格资源发现模型
%A ZHANG Zhong-ping
%A JIA Qian
%A <br>张忠平
%A 贾　倩
%J 计算机应用研究
%D 2012
%I 
%X By introducing the concepts of domain and resource router, and setting the mincost function to group grid resources into domains and layering, this paper proposed a mincost-based hierarchical grid resource discovery model. Then it designed the algorithms for the resource router selection, resource register and resource search. Performance analysis and simulation experiments show that the mechanism has better scalability and fault tolerance, and less cost. The model can meet the dynamism, decentralization, and scalability of grid, simultaneously avoid the heterogeneous among different resources. It also has a good preformance on searching resources.
%K grid
%K overlay
%K self-organize
%K cost
%K resource discovery<br>网格
%K 覆盖
%K 自组织
%K 代价
%K 资源发现
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=8D8174D12B4331BF15A494926B6F389F&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=59906B3B2830C2C5&sid=A59EB330D3F25866&eid=EFA3C14F127D1AFB&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=13