Ranked Matching of OWL-S Process Model for Distributed Discovery of SWs in P2P Systems

Distributed Computing and Artificial Intelligence, 12th International Conference

2015

Self Cite

Abstract. In this paper, we present a scalable approach for visualizing and browsing the search space of available Web services to effectively and efficiently resolve the problem of distributed discovery for Semantic Web services (SWs). We investigate the use of matching technique of ontologies OWL-S, an approach to provide a collaborative mechanism to discover basic SWs distributed among all peers in a purely distributed and heterogeneous P2P network. Our scalable approach is based on the matching technique of OWL-S in order to reduce the time complexity of the distributed discovery for SWs with respect to their semantic similarity, to simplify the management of the P2P network, to optimize the ratio of service exchange and to ensure the quality of service. The network peers offer their SWs to other ones in a distributed and heterogeneous P2P computing, and are able to use distant services to improve system responses to requests by the system that are asked. The experimental results show that the proposed approach enhances the network scalability while providing good overall performances. Also, we show that our approach can perform more effective and efficient distributed discovery of SWs with low cost in P2P computing.

show abstract

“…The procedure (Discovery-Matching ()) made in step 1 of Algorithm 1, it used for the automatic discovery of SWs [3].…”

Section: Proposed Approach For Distributed Discovery Of Swsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficient P2P Approach for a Better Automation of the Distributed Discovery of SWs

Distributed Computing and Artificial Intelligence, 12th International Conference

2015

Self Cite

show abstract

“…The increasing complexity of P2P overlay networks is behind the big difficulty and challenges faced to provide the interoperability of existing systems. In this context, the researchers have exploited P2P computing to improve a better scalability, dynamicity, reliability, high performance and robustness of Web service discovery [12], [13].…”

Section: Introductionmentioning

confidence: 99%

Towards Efficient and Effective Distributed Discovery of SWs in P2P Overlay Networks

2015 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC)

2015

Self Cite

In this paper, we will focus on the contribution an efficient and an effective approach for a distributed discovery of Semantic Web services (SWs), which address some aspects, related to problems the time complexity of collaboration in the process of automatic discovery for SWs in order to achieve adaptability in a highly-dynamic distributed computing. For this purpose, our approach is based on P2P computing that proved to be scalable, efficient and robust solutions for distributed discovery of SWs. Indeed, we propose a matching technique of ontology OWL-S process model, in order to efficiently and effectively discover appropriate Web services distributed among all peers in a large-size P2P network. For improving performance and effectiveness, our scalable approach is mapped on unstructured P2P networks by exploiting Pareto efficiency to reduce considerably the execution time and message exchanged for disseminating request about the unstructured P2P network structure among the peers, to simplify the management of the P2P network and to ensure the quality of service. The experimental results show that the proposed approach enhances the network scalability while providing good overall performances. Also, we show that our approach can perform more efficient and effective distributed discovery of SWs with low computational cost in terms of completeness and accuracy in P2P computing, when compared to the other approaches.

show abstract

Efficient distributed discovery and composition of OWL-S process model in P2P systems

J Ambient Intell Human Comput

2015