Sunday 1 January 2017

Optimizing Service Selection in Combinatorial Auction

Vol. 9  Issue 3
Year:2015
Issue:Jan-Mar
Title:Optimizing Service Selection in Combinatorial Auction
Author Name:Sreekanth Reddy. C 
Synopsis:
The selection of services with the aim to fulfill the quality constraints became critical and challenging to the success of Service-based Systems (SBSs), especially when the quality constraints are ambiguous. However, currently not a single existing method for quality-aware service composition has sufficiently considered non-linear parameters to determine the best service. This paper proposes an enhanced Combinatorial Auction for Service Selection (CASS) method which is capable of handling non linear services. Further the Winner Determination Problem (WDP) will also become a non-linear problem to solve that non linear WDP. This paper considers a binary search algorithm to define the winner based on multiple constraints. Finally the system is tested for the optimal time period calculation for determining the WDP.

No comments:

Post a Comment