Optimizing Service Selection in Combinatorial Auction by Resolving Non-Linear Programming Constraints
K. Uma Devi1, B. Lalitha2
1K. Uma Devi, M.Tech. (Software Engineering), Department of Computer Science & Engineering, JNTUA College of Engineering, Anantapuramu, A.P, India.
2B. Lalitha, Asst. Prof., Department of Computer Science & Engineering, JNTUA College of Engineering, Anantapuramu, A.P, India.
Manuscript received on August 14, 2015. | Revised Manuscript received on August 26, 2015. | Manuscript published on September 05, 2015. | PP: 36-39 | Volume-5 Issue-4, September 2015 . | Retrieval Number: D2683095415 /2015©BEIESP
Open Access | Ethics and Policies | Cite
©The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/
Abstract: The selection of services with the aim to fulfill the quality constraints became critical and challenging research aspect in the field of service computing to promote automated service selection in service-based systems (SBSs), especially when the quality constraints are stringent. However, none of the existing approaches for quality-aware service composition has sufficiently considered QoS parameters to determine the best service. This paper proposes an optimization model for SBS to automate the process of quality aware service selection. Furthermore, this paper presents a compositional quality model to analyze and optimize the quality constraints that play a vital role in Winner Determination Problem (WDP).
Keywords: Critical and challenging research aspect, computing to promote automated service selection, QoS parameters, optimization model for SBS, Winner Determination Problem (WDP).