Please use this identifier to cite or link to this item:
Full metadata record
|dc.description.abstract||Composite service selection presents the opportunity for the 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 value-added composite services. The aim of service selection is to choose the best set of services based on the functional and non-functional (quality related) requirements of a composite service requester. The current service selection approaches mostly assume that web services are offered as single independent entities; there is no possibility for bundling. 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 requests for composite services affects the performance of service selection approaches. Addressing these two aspects can significantly enhance the application of composite service selection approaches in the real-world.
We develop new approaches for the composite web service selection problem by addressing both the bundling and multiple requests issues. In particular, we propose two mechanisms based on combinatorial auction models, where the provisioning of multiple services are auctioned simultaneously and service providers can bid to offer combinations of web services. We mapped these mechanisms to Integer Linear Programing models and conducted extensive simulations to evaluate them. The results of our experimentation show that bundling can lead to cost reductions compared to when services are offered independently. Moreover, the simultaneous consideration of a set of requests enhances the success rate of the mechanism in allocating services to requests. By considering all composite service requests at the same time, the mechanism achieves more homogenous prices which can be a determining factor for the service requester in choosing the best composite service selection mechanism to deploy.||en_AU|
|dc.publisher||University of Sydney||en_AU|
|dc.publisher||Faculty of Engineering & Information Technologies||en_AU|
|dc.publisher||School of Information Technologies||en_AU|
|dc.title||Combinatorial Auction-based Mechanisms for Composite Web Service Selection||en_AU|
|dc.type.pubtype||Doctor of Philosophy Ph.D.||en_AU|
|Appears in Collections:||Sydney Digital Theses (Open Access)|
This work is protected by Copyright. All rights reserved. Access to this work is provided for the purposes of personal research and study. Except where permitted under the Copyright Act 1968, this work must not be copied or communicated to others without the express permission of the copyright owner. Use the persistent URI in this record to enable others to access this work.
|Mahboobeh_M_thesis.pdf||Thesis||3.1 MB||Adobe PDF|
Items in Sydney eScholarship Repository are protected by copyright, with all rights reserved, unless otherwise indicated.