Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

Grid service siscovery with rough sets

Li, M., Yu, B., Rana, Omer Farooq and Wang, Z. 2008. Grid service siscovery with rough sets. IEEE Transactions on Knowledge and Data Engineering 20 (6) , pp. 851-862. 10.1109/TKDE.2007.190744

Full text not available from this repository.

Abstract

The computational grid is rapidly evolving into a service-oriented computing infrastructure that facilitates resource sharing and large-scale problem solving over the Internet. Service discovery becomes an issue of vital importance in utilizing grid facilities. This paper presents ROSSE, a Rough sets-based search engine for grid service discovery. Building on the Rough sets theory, ROSSE is novel in its capability to deal with the uncertainty of properties when matching services. In this way, ROSSE can discover the services that are most relevant to a service query from a functional point of view. Since functionally matched services may have distinct nonfunctional properties related to the quality of service (QoS), ROSSE introduces a QoS model to further filter matched services with their QoS values to maximize user satisfaction in service discovery. ROSSE is evaluated from the aspects of accuracy and efficiency in discovery of computing services.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Computer Science & Informatics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords: Intelligent Web Services and Semantic Web, Internet reasoning services, Knowledge engineering methodologies
Publisher: Institute of Electrical and Electronics Engineers
ISSN: 1041-4347
Last Modified: 04 Jun 2017 03:08
URI: http://orca.cf.ac.uk/id/eprint/17311

Citation Data

Cited 31 times in Google Scholar. View in Google Scholar

Cited 35 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item