loading...
Service Matchmaking with Rough Sets
Singapore May 16-May 19
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGRID.2006.91Sixth IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Maozhen Li, Brunel University, UK
Bin Yu, Brunel University, UK
Chang Huang, Brunel University, UK
Yong-Hua Song, Brunel University, UK
Omer.F. Rana, Cardiff University, UK
With the wide adoption of Open Grid Services Architecture (OGSA) and Web Services Resource Framework (WSRF), the Grid is emerging as a service-oriented computing infrastructure for engineers and scientists to solve data and computationally intensive problems. It is envisioned that computing resources in a future Grid environment will be exposed as services. Service discovery becomes an issue of vital importance for a wider uptake of the Grid. This paper presents RSSM, a Rough Sets based service matchmaking algorithm for service discovery with an aim to tolerate uncertainty in identifying service properties. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWL-S.
Citation:
Maozhen Li, Bin Yu, Chang Huang, Yong-Hua Song, Omer.F. Rana, "Service Matchmaking with Rough Sets," ccgrid, pp.123-130, Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.