Service selection using quality matchmaking

This paper proposes a quality matchmaker which introduces four algorithms or filters: interface matching, quality criteria matchmaking, quality value constraints matching, and mathematical matchmaking. These four algorithms use the quality matchmaker sub-components to implement their roles. The quality matchmaker has three sub-components which are: interface matchmaking, quality criteria matchmaking and mathematical matchmaking. A quality matchmaking process (QMP) is introduced to demonstrate the above four algorithms and to select the best Web service. The mathematical matchmaking algorithm is the most important step that uses a mathematical model in order to select the best candidates Web service based on requester´s quality requirements and preferences. Two techniques are used in a mathematical model: Analytical Hierarchy Process (AHP) and Euclidean distance.