Title :
A Cost-Minimizing Service Composition Selection Algorithm Supporting Time-Sensitive Discounts
Author :
Xu, Lei ; Jennings, Brendan
Author_Institution :
FAME, Telecommun. Software & Syst. Group, Waterford Inst. of Technol., Waterford, Ireland
Abstract :
An attractive business model for service brokers and aggregators is the creation of composite services built from services offered by third parties. These providers generate profits by charging their customers a premium above the charges they themselves pay to the third party providers. When multiple providers offer services with the same or similar functional and non-functional properties, selecting services with lowest associated costs is clearly beneficial. However, this is not a trivial task when, as is often the case, third party providers have complex service charging models incorporating discounts based on the context in which their service is used. This context can refer to, for example, which other services a service is composed with, or the time interval in which the service is invoked. We present a service selection algorithm that takes into account time-sensitive intra and inter provider discounts which serves to minimize the expected cost to the service aggregator of offering a composite service within a specified time interval.
Keywords :
business data processing; cost reduction; business model; complex service charging model; composite service; cost minimizing service composition selection algorithm; service aggregator; service broker; service provider; third party provider; time sensitive discount; Algorithm design and analysis; Complexity theory; Context; Optimization; Pricing; Quality of service; M.2.0.V Services Billing; M.6.I Aspects of Business Requirements; M.6.I.II Optimization of Services Composition;
Conference_Titel :
Services Computing (SCC), 2010 IEEE International Conference on
Conference_Location :
Miami, FL
Print_ISBN :
978-1-4244-8147-7
Electronic_ISBN :
978-0-7695-4126-6
DOI :
10.1109/SCC.2010.76