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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call