Combinatorial Auction-based Mechanisms for Composite Web Service Selection

摘要: Composite service selection presents the opportunity for rapid development of complex applications using existing web services. It refers to the problem of selecting a set of web services from a large pool of available candidates to logically compose them to achieve valueadded composite services. With the growing number of web services on the Internet, it is very likely to find services, which provide a similar functionality but are differentiated based on their Quality of Service offers and price. The aim of service selection is to choose the best set of services based on the requirements of a composite service requester. The current service selection approaches mostly assume that web services are offered as single independent entities. Thus, if a service provider is interested in offering a combination of services, there is no possibility for bundling. Such an assumption ignores the dependencies between constituent services of a composition, which can strongly affect the service providers’ preferences in offering bundles of web services. Moreover, the current research has mainly focused on solving the problem for a single composite service. There is a limited research to date on how the presence of multiple, simultaneous requests for composite services affects the performance of service selection approaches. Addressing these two aspects significantly enhances the application of composite service selection approaches for real-world practices. Accordingly, our central aim in this thesis is to develop new approaches for the composite web service selection problem by addressing both the bundling and multiple requests issues. In particular, we propose …