SMP-based service matching

Service-oriented computing is establishing itself as a new computing paradigm in which services advertise their capabilities within a network. These services are then used, composed and orchestrated by other services and end-users. Whilst many approaches to matching service providers with consumers of their services have been developed in the past, our approach takes a different view of the problem in that it does not look for the highest individual utility, but views it as a constrained optimisation problem that matches between a set of service providers and a set of service consumers. Our approach addresses this problem using an adaptation of the well known stable-marriage problem and demonstrates how matching between service providers and consumers can be expressed in similar terms. We contribute a fair assignment process and show how the final engagement between service providers and consumers is based on their preferences.