By Topic

A Domain ontology based service matching for CHORD based Super Peer network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rajmohan, R. ; Dept. of Comput. Sci., Pondicherry Univ., Pondicherry, India ; Padmapriya, N.

One major issue in web service discovery is retrieving the desired services. Currently P2P architectures are used as a replacement of UDDI for registering and discovering web services. But P2P network structures lack semantic based query routing and have scalability issues when they are scaled to larger network. In this paper we introduce the concept of Domain ontology in CHORD based Super Peer network. The Traditional CHORD algorithm is modified by with two changes: Functionally equivalent services are evenly distributed across the network and Domain ontology is used for service matching instead of service identifiers. An ontology repository is also available in each Super node of the network which stores the domain ontologies used for service matching. At the same time, we take advantage of OWL-S to create domain ontologies and to add valuable semantic information in Web Service description. We have also modified an existing ontology matching algorithm making it compatible with CHORD structure.

Published in:

Data Science & Engineering (ICDSE), 2012 International Conference on

Date of Conference:

18-20 July 2012