e-Science logo Nesc logo
 
 
About NeSC
e-Science Institute
e-Science Hub
TOE
Contacts
e-Science Events
Resources
Newsroom
Presentations & Lectures
Technical Papers
Global Grid Links
Projects
UK e-Science Centres
UK e-Science Teams
Career Opportunities
Bibliographic Database
 

 

Paper ID: 1470

RSSM: A Rough Sets based Service Matchmaking Algorithm
Bin,Yu Maozhen,Li

Appeared in: Proceedings of the UK e-Science All Hands Conference 2006 website: http://www.allhands.org.uk/2006/
Page Numbers:709 - 716
Publisher: National e-Science Centre
Year: 2006
ISBN/ISSN: 0-9553988-0-0
Contributing Organisation(s):
Field of Science: e-Science

URL: http://www.allhands.org.uk/2006/proceedings/papers/600.pdf

Abstract: The past few years have seen the Grid is evolving as a service-oriented computing infrastructure. It is envisioned that various resources in a future Grid environment will be exposed as services. Service discovery becomes an issue of vital importance for utilising Grid facilities. This paper presents RSSM, a Rough Sets based service matchmaking algorithm for service discovery that can deal with uncertainty of service properties when matching service advertisements with service requests. The evaluation results show that the RSSM algorithm is more effective in service discovery compared with other mechanisms such as UDDI and OWL-S.

Keywords: e-Science, AHM 2006


BIB DOC HTM HTML PDF PPT PS RTF TEX TXT ZIP




 

Last Updated: 22 Jun 12 11:02
This is an archived website, preserved and hosted by the School of Physics and Astronomy at the University of Edinburgh. The School of Physics and Astronomy takes no responsibility for the content, accuracy or freshness of this website. Please email webmaster [at] ph [dot] ed [dot] ac [dot] uk for enquiries about this archive.