Grid resource discovery based on web services

Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyes, K.

doi:10.1109/icitst.2009.5402543

Cited by 4 publications

(2 citation statements)

References 17 publications

(15 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The definition of Service matching principle was as follow. A service description S could be matched by a user request description R successfully, if and only if: 1) S can provide all the output of r; 2) r can provide all the input of s [4]. At present, many matching principles of service discovery method were carried out on this basis.…”

Section: Related Workmentioning

confidence: 98%

A Novel Grid Service Discovery Algorithm Based on Service Behavior Semantic Annotation

Yao¹,

Chen²,

Du³

2012

2012 International Conference on Industrial Control and Electronics Engineering

View full text Add to dashboard Cite

The rise in recent years, the grid is a resourcesharing technology, but in their current state of development and implementation has not been as successful as hoped in engendering distributed environment. One of important reasons which reduce the utilization of grid resources is that the resources services discoveries are not effective. This paper proposes a novel grid service discovery algorithm based on service behavior semantic annotation. This algorithm adds some semantic annotations on the service behavior. Through these processes, the efficiency of the algorithm has improved.

show abstract

Section: Related Workmentioning

confidence: 98%

A Novel Grid Service Discovery Algorithm Based on Service Behavior Semantic Annotation

Yao¹,

Chen²,

Du³

2012

2012 International Conference on Industrial Control and Electronics Engineering

View full text Add to dashboard Cite

show abstract

“…Traditional approaches of resource discovery in grid environments are mainly based on web services, which are classified as centralized and hierarchical methods according to the topology of the resource information (Cokuslu et al 2009). But some problems such as single point of failure, bottlenecks in a dynamic environment, and weak scalability to a large-scale system that is geographically distributed across the Internet limit the efficiency of these approaches.…”

Section: Introductionmentioning

confidence: 99%

Optimized Query Forwarding for Resource Discovery in Unstructured Peer-to-Peer Grids

Noghabi

Ismail

Ahmed

et al. 2012

Cybernetics and Systems

View full text Add to dashboard Cite

One of the challenges of resource discovery in unstructured peer-topeer grid systems is minimizing network traffic. The network traffic arises by query messages that are broadcasted to other peers in order to find the appropriate resources. Blind search methods that are employed in such systems do not work well because every specific query generates high query traffic, which quickly overwhelms the network. Informed search methods usually use recorded history of previous queries to decide where the new queries should be sent. Such methods can reduce network traffic but do not consider the path length. In this study, a method was proposed in which both the path length and network traffic are considered. This approach reduces the hop numbers and prevents massive flooding of query messages. To do this, it selects optimum neighbor peer(s) in order to optimize query forwarding. The proposed approach uses statistical tables that are obtained from recorded history of previous queries. Then a genetic algorithm is applied to these statistical tables to find the optimum neighbor peer(s). The proposed approach showed that query forwarding through the optimum neighbor peer(s) has a greater probability of finding a requested resource with lower hop numbers. This method was compared with random walk and flooding approaches. It was observed that the network traffic remarkably decreased in comparison to a flooding approach, whereas it was similar to the results obtained by a random walk method. Moreover, this method provided a higher success

show abstract