GRID SERVICE DISCOVERY WITH ROUGH SETS
#1

GRID SERVICE DISCOVERY WITH ROUGH SETS
Abstract: A rough set is a formal approximation of a crisp set (conventional set) in terms of a pair of sets which give the lower and the upper approximation of the original set. The lower and upper approximation sets themselves are crisp sets in the standard version of rough set theory, but in other variations, the approximating sets may be fuzzy sets as well. 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.
Reply
#2

[attachment=4831]
Grid Service Discovery with Rough Sets

Maozhen Li, Member, IEEE, Bin Yu, Omer Rana, and Zidong Wang, Senior Member, IEEE



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

Abstract: A rough set is a formal approximation of a crisp set (conventional set) in terms of a pair of sets which give the lower and the upper approximation of the original set. The lower and upper approximation sets themselves are crisp sets in the standard version of rough set theory, but in other variations, the approximating sets may be fuzzy sets as well. 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.
Technology to use:.NET

Reference: http://studentbank.in/report-grid-servic...z11BMhDpp3
Reply
#3

1 INTRODUCTION
WITH the development of Web service technologies [1],the computational grid [2] is rapidly evolving into aservice-oriented computing infrastructure that facilitatesresource sharing and large-scale problem solving over theInternet [3]. The Open Grid Services Architecture (OGSA)[4], promoted by the Open Grid Forum (OGF, http://ogf.org) as a standard service-oriented architecture(SOA) for grid applications, has facilitated the evolution. Itis expected that the Web Service Resource Framework(WSRF) [5] will be acting as an enabling technology to drivethis evolution further. The promise of SOA is the enablingof loose coupling, robustness, scalability, extensibility, andinteroperability for large-scale grid systems.As shown in Fig. 1, various resources on the Internetincluding processors, disk storage, network links, instrumentationand visualization devices, domain applications,and software libraries can be exposed as OGSA/WSRFbasedgrid services, which are usually registered with aservice registry. A service bus building on service-orientedgrid middleware technologies such as Globus [6] enablesthe instantiation of grid services. A grid environment mayhost a large number of services. Therefore, service discoverybecomes an issue of vital importance in utilizinggrid facilities.Grid services are implemented as software components,the interfaces of which are used to describe their functionaland nonfunctional properties (attributes). Advertisingservices in a grid environment means that service-associatedproperties are registered with a service registry.Service discovery involves a matching process in which theproperties of a service query are matched with that of aservice advertisement.In a grid environment, service publishers may advertiseservices independently using their predefined properties todescribe services. Therefore, uncertainty of service propertiesexists when matching services. An uncertain property isdefined as a service property that is explicitly used by oneadvertised service but does not appear in another serviceadvertisement that belongs to the same service category.This can be further illustrated using Table 1. For example,property P1, which is explicitly used by service S1 in itsadvertisement, does not appear in the advertisement ofservice S2. Similarly, property P3, which is explicitly usedby service S2, does not appear in the advertisement ofservice S1. When services S1 and S2 are matched with aservice query using properties P1, P2, P3, and P4, propertyP1 becomes an uncertain property in matching service S2,and property P3 becomes an uncertain property in matchingservice S1. Consequently, both S1 and S2 may not bediscovered because of the existence of uncertainty ofproperties even though the two services are relevant tothe query.It is worth noting that properties used in serviceadvertisements may have dependencies, e.g., both P1 andP3 may be dependent properties of P2 when describingservices S1 and S2, respectively. Both S1 and S2 can bediscovered if P1 and P3 (which are uncertain properties interms of the user query) are dynamically identified andreduced in the matching process. To increase the accuracyof service discovery, a search engine should be able to dealwith uncertainty of properties when matching services.In this paper, we present ROSSE [21], [22], [23], [24]: asearch engine for grid service discovery. Building on Roughsets theory [25], ROSSE is novel in its capability to deal withuncertainty of service properties when matching services.This is achieved by dynamically identifying and reducingdependent properties that may be uncertain propertiesZidong.Computer Societywhen matching a service query. In this way, ROSSEincreases the accuracy in service discovery. In addition,functionally matched services may have distinct nonfunctionalproperties related to the quality of service (QoS). Tomaximize user satisfaction in service discovery, ROSSEintroduces a QoS model to further filter matched serviceswith their QoS values. Finally, ROSSE is evaluated from theaspects of accuracy and efficiency in discovery of computingservices.The remainder of the paper is organized as follows:Section 2 presents the design of ROSSE with a focus ondependent property reduction (DPR). Section 3 introduces aQoS model to filter matched services with their QoS values.Section 4 briefly describes the implementation of ROSSEand gives a case study to illustrate the application of ROSSEfor discovery of computing services. Section 5 evaluates theaccuracy and efficiency of ROSSE in service discovery.Section 6 discusses some related work, and Section 7concludes the paper.
2 THE DESIGN OF ROSSEROSSE
considers input and output properties individuallywhen matching services. For the simplicity of expression,input and output properties used in a service query aregenerally referred to as service properties. The same goesfor service advertisements. Fig. 2 shows ROSSE components.The interactions between the components follow twoprocesses—service publication and service discovery.Service publication. Service publishers advertise theirservices to ROSSE through a Web user interface (step 1).Advertised services with WSDL interfaces or OWL-S [13]interfaces are then loaded into the ROSSE Service Repository,in which the elements of services such as the namesand properties of services are registered with ROSSE(step 2). When advertising services, service publishersmay also publish service ontologies that can be defined inOWL [14]. These OWL ontologies are then parsed by anOWL parser (step 3) and loaded into the ROSSE OntologyRepository (step 4). The ontology repository is used by aninference engine to infer the semantic relationships ofproperties when matching services.Service discovery. A user posts a service query to ROSSEvia its Web user interface (step 5). The query includes aservice category of interest and expected service properties.The query is then passed to the Irrelevant PropertyIdentification component (step 6), which accesses the ROSSEService Repository (step 7) to identify and mark theproperties of advertised services that are irrelevant to theproperties used in the service query based on the ontologiesdefined in the ROSSE Ontology Repository (step 8). Thequery is then passed to the DPR component (step 9), whichaccesses the ROSSE Service Repository to identify and markdependent properties (step 10). Upon completion, the DPRcomponent invokes the Service Similarity Computing (SSC)component (step 11), which accesses ROSSE Service Repository(step 12) to compute the match degrees of relevantproperties of advertised services to the service query. Anirrelevant property is given a match degree of zero. The SSCcomponent further computes the similarity degrees ofadvertised services to the service query using the matchdegrees of their individual properties. It should be notedthat dependent properties that may be uncertain propertiesare not involved in the similarity computing process. As aresult, the similarity degrees of advertised services will notbe affected by these uncertain properties. In this way, ROSSEcan discover the services that are most relevant to the servicequery. Up to now, advertised services are matched withtheir functional properties. As functionally matched servicesmay have distinct nonfunctional properties related to QoS,the SSC component invokes the QoS Modeling component(step 13), which in turn filters functionally matched services A layered structure of service-oriented grid systems.TABLE 1Two Service Advertisements with Uncertain Service PropertiesFig. 2. ROSSE components.with QoS values (step 14). Finally, a list of discoveredservices that are ranked with their functionally matcheddegrees is presented to a user (step 16) via the Web userinterface of ROSSE (step 15). Each of the discovered serviceshas a QoS value associated with it.In the following sections, we describe in depth theprocesses involved in service discovery in ROSSE. First, weintroduce Rough sets for service discovery.



download full report

http://bura.brunel.ac.uk/bitstream/2438/...20Sets.pdf
Reply

Important Note..!

If you are not satisfied with above reply ,..Please

ASK HERE

So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Popular Searches: mobile robot kinematic reconfigurability for rough terrain, rough sets in electronics, free download pdf for grid service discovery with rough sets, rough sets data mining, calendaring discovery, ppt for rough sets based search engine for grid service discovery, sql get result sets,

[-]
Quick Reply
Message
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Identifying Legitimate Clients under Distributed Denial-of-Service Attacks smart paper boy 0 907 30-08-2011, 10:07 AM
Last Post: smart paper boy
  Name Directory Service based on MAODV and Multicast DNS for IPv6 MANET smart paper boy 0 972 24-08-2011, 12:16 PM
Last Post: smart paper boy
  A New Mobile Spatial Information Service Grid Computing Model Based on Mobile Agent smart paper boy 0 1,164 30-07-2011, 02:25 PM
Last Post: smart paper boy
  Mobile Service Provider Operations Portal smart paper boy 0 1,213 29-07-2011, 11:10 AM
Last Post: smart paper boy
  Grid solving Robot smart paper boy 0 1,384 21-07-2011, 03:35 PM
Last Post: smart paper boy
  TRUTH DISCOVERY WITH MULTIPLE CONFLICTING INFORMATION PROVIDERS ON WEB computer science crazy 2 3,374 25-06-2011, 06:11 PM
Last Post: anithachacko
  POWER GRID CONTROL SYSTEM USING GSM MODEM seminar class 0 2,606 14-05-2011, 11:59 AM
Last Post: seminar class
  Prototypic GPS-GSM Integration for Enhancing Public Transportation management Service seminar class 1 2,261 13-05-2011, 04:57 PM
Last Post: aryan110
  Phero-Trail: A Bio-Inspired Location Service for Mobile Underwater Sensor Networks seminar class 0 924 07-05-2011, 03:47 PM
Last Post: seminar class
  VOLTAGE SOURCE CONVERTER TOPOLOGY FOR HVDC GRID CONNECTION OF OFFSHORE WIND FARMS seminar class 0 1,254 03-05-2011, 09:46 AM
Last Post: seminar class

Forum Jump: