Prashanth, B and Narahari, Y (2008) Efficient Algorithms for Combinatorial Auctions with Volume Discounts Arising in Web Service Composition. In: 4th IEEE Conference on Automation Science and Engineering Key Bridge Marriott, Washington DC, USA, 23-26 Aug. 2008 , Arlington, VA .
Efficient_Algorithms.pdf - Published Version
Restricted to Registered users only
Download (314Kb) | Request a copy
Web services are now a key ingredient of software services offered by software enterprises. Many standardized web services are now available as commodity offerings from web service providers. An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process. Web service offerings are now available in bundled form as composite web services and more recently, volume discounts are also on offer, based on the number of executions of web services requested. In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts. We model this problem as a combinatorial auction with volume discounts. We first develop efficient polynomial time algorithms when the end-to-end service involves a linear workflow of web services. Next we develop efficient polynomial time algorithms when the end-to-end service involves a tree workflow of web services.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||23 Sep 2011 09:32|
|Last Modified:||23 Sep 2011 09:32|
Actions (login required)