Efficient P2P Approach for a Better Automation of the Distributed Discovery of SWs
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.
KeywordsSWs Distributed Discovery P2P Computing Matching of Ontology Similarity Measure OWL-S process model
Unable to display preview. Download preview PDF.
- 3.Boukhadra, A., Benatchba, K., Balla, A.: Ranked matching of owl-s process model for distributed discovery of sws in p2p systems. In: 2014 17th IEEE International Conference on Network-Based Information Systems (NBiS), pp. 106–113. IEEE (2014)Google Scholar
- 4.Fragopoulou, P., Mastroianni, C., Montero, R., Andrjezak, A., Kondo, D.: Self-* and adaptive mechanisms for large scale distributed systems. In: Grids, P2P and Services Computing, pp. 147–156. Springer (2010)Google Scholar
- 5.Furno, A., Zimeo, E.: Efficient cooperative discovery of service compositions in unstructured p2p networks. In: 2013 21st Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 58–67. IEEE (2013)Google Scholar
- 6.Klusch, M., Kapahnke, P.: iSeM: Approximated reasoning for adaptive hybrid selection of semantic services. In: Aroyo, L., Antoniou, G., Hyvönen, E., ten Teije, A., Stuckenschmidt, H., Cabral, L., Tudorache, T. (eds.) ESWC 2010, Part II. LNCS, vol. 6089, pp. 30–44. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 7.Montresor, A., Jelasity, M.: Peersim: A scalable p2p simulator. In: IEEE Ninth International Conference on Peer-to-Peer Computing, P2P 2009, pp. 99–100. IEEE (2009)Google Scholar
- 10.Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement, pp. 189–202. ACM (2006)Google Scholar
- 11.Sun, F., Hao, S.: A discovery framework for semantic web services in p2p environment. In: 2010 International Conference on Electrical and Control Engineering (ICECE), pp. 44–47. IEEE (2010)Google Scholar
- 12.Zhu, Z., Hu, Y., Lan, R., Wu, W., Li, Z.: A p2p-based semantic web services composition architecture. In: IEEE International Conference on e-Business Engineering, ICEBE 2009, pp. 403–408. IEEE (2009)Google Scholar