期刊名称：International Journal of Electrical and Computer Engineering
电子版ISSN：2088-8708
出版年度：2012
卷号：3
期号：1
页码：64-72
语种：English
出版社：Institute of Advanced Engineering and Science (IAES)
摘要：Since the objective of grid is sharing the numerous and heterogeneous resources, resource discovery is a challenging issue. Recently appeared, Ontosum, is a resource discovery method based on semantically linked organizations and a routing algorithm Resource Distance Vector (RDV), has been presented to forward resource discovery queries into the clusters. Although this framework is efficient for large-scale grids and nodes are clustered automatically based on semantic attributes to constitute a semantically linked overlay network, but the dynamic behavior of grid isn’t considered. In this method, deceptive information is stored in RDV tables (RDVT) which cause some problems in routing process. In this paper, a method is proposed to improve the dynamism of RDV routing algorithm, so the consistency with grid environments is increased. The developed algorithm is assessed by investigating the success probability, number of hops and routing time of resource discovery. DOI: http://dx.doi.org/10.11591/ijece.v3i1.1837
其他摘要：Since the objective of grid is sharing the numerous and heterogeneous resources, resource discovery is a challenging issue. Recently appeared, Ontosum, is a resource discovery method based on semantically linked organizations and a routing algorithm Resource Distance Vector (RDV), has been presented to forward resource discovery queries into the clusters. Although this framework is efficient for large-scale grids and nodes are clustered automatically based on semantic attributes to constitute a semantically linked overlay network, but the dynamic behavior of grid isn’t considered. In this method, deceptive information is stored in RDV tables (RDVT) which cause some problems in routing process. In this paper, a method is proposed to improve the dynamism of RDV routing algorithm, so the consistency with grid environments is increased. The developed algorithm is assessed by investigating the success probability, number of hops and routing time of resource discovery. DOI: http://dx.doi.org/10.11591/ijece.v3i1.1837
Loading...
