Authors: Nwe Nwe Htay Win; Bao Jianmin; Cui Gang
Addresses: Harbin Institute of Technology, Harbin, 150001, China; University of Computer Studies (Mandalay), Myanmar ' Key Lab of Broadband Wireless Communication and Sensor Network Technology (Jiangsu Provincial Engineering Research Center of Telecommunications and Network Technology), Ministry of Education, Nanjing, 210003 China ' Harbin Institute of Technology, Harbin, 150001, China
Abstract: This paper presents an efficient service similarity matchmaking method that considers complex QoS structures and attributes because sole consideration of QoS constraint becomes insufficient to handle sophisticated concepts described in service documents. To overcome the shortcoming of semantic exploitation in traditional matchmaking mechanisms, we propose a novel similarity matchmaking method that compares the equivalences between service advertisements and requirements based on three essential criteria called structure, attribute and constraint similarity. The aim is to reveal the complicated QoS semantic concepts embedded in QoS-based service documents and exploit them in matchmaking. The similarity score obtained from evaluation of each similarity criteria is also calculated and a service collection set with the highest similarity scores is provided to the user as the result. The simulation and experiment results prove that our matchmaking method surpasses the other service matchmaking and discovery techniques.
Keywords: service similarity matchmaking; QoS structures; QoS attributes; QoS semantic concepts; service advertisements; service requirements; quality of service; ontology; service discovery; service documents; web services.
International Journal of Internet Manufacturing and Services, 2014 Vol.3 No.4, pp.341 - 357
Received: 12 Mar 2015
Accepted: 30 Mar 2015
Published online: 20 Jul 2015 *