Article

Adaptive Service Composition in Flexible Processes

Dipt. di Elettronica e Inf., Politecnico di Milano;
IEEE Transactions on Software Engineering (Impact Factor: 2.59). 07/2007; 33(6):369-384. DOI: 10.1109/TSE.2007.1011
Source: IEEE Xplore

ABSTRACT In advanced service oriented systems, complex applications, described as abstract business processes, can be executed by invoking a number of available Web services. End users can specify different preferences and constraints and service selection can be performed dynamically identifying the best set of services available at runtime. In this paper, we introduce a new modeling approach to the Web service selection problem that is particularly effective for large processes and when QoS constraints are severe. In the model, the Web service selection problem is formalized as a mixed integer linear programming problem, loops peeling is adopted in the optimization, and constraints posed by stateful Web services are considered. Moreover, negotiation techniques are exploited to identify a feasible solution of the problem, if one does not exist. Experimental results compare our method with other solutions proposed in the literature and demonstrate the effectiveness of our approach toward the identification of an optimal solution to the QoS constrained Web service selection problem

0 Bookmarks
 · 
83 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The problem of selecting services from a set of functionally appropriate ones under Quality of Service constraints - the Service Selection Problem - is well-recognized in the literature based on deterministic parameters. However, Quality of Service may rather follow a stochastic distribution and, thus, may change at runtime. In order to cope with differing Quality of Service, we present a heuristic approach for efficiently addressing the Service Selection Problem in conjunction with stochastic Quality of Service attributes. Accounting for penalty cost which accrue due to Quality of Service violations, our approach reduces the impact of stochastic Quality of Service behavior on total cost significantly.
    12th IEEE International Conference on Web Services (ICWS 2014), Anchorage, Alaska; 06/2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: The increasing tendency of network service users to use cloud computing encourages web service vendors to supply services that have different functional and nonfunctional (quality of service) features and provide them in a service pool. Based on supply and demand rules and because of the exuberant growth of the services that are offered, cloud service brokers face tough competition against each other in providing quality of service enhancements. Such competition leads to a difficult and complicated process to provide simple service selection and composition in supplying composite services in the cloud, which should be considered an NP-hard problem. How to select appropriate services from the service pool, overcome composition restrictions, determine the importance of different quality of service parameters, focus on the dynamic characteristics of the problem, and address rapid changes in the properties of the services and network appear to be among the most important issues that must be investigated and addressed. In this paper, utilizing a systematic literature review, important questions that can be raised about the research performed in addressing the above-mentioned problem have been extracted and put forth. Then, by dividing the research into four main groups based on the problem-solving approaches and identifying the investigated quality of service parameters, intended objectives, and developing environments, beneficial results and statistics are obtained that can contribute to future research.
    Expert Systems with Applications 06/2014; 41:3809–3824. · 1.85 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Cloud computing is an emerging technology that allows to access computing resources on a pay-per-use basis. The main challenges in this area are the efficient performance management and the energy costs minimization. In this paper we model the service provisioning problem of Cloud Platform-as-a- Service systems as a Generalized Nash Equilibrium Problem and show that a potential function for the game exists. Moreover, we prove that the social optimum problem is convex and we derive some properties of social optima from the corresponding Karush- Kuhn-Tucker system. Next, we propose a distributed solution algorithm based on the best response dynamics and we prove its convergence to generalized Nash equilibria. Finally, we numerically evaluate equilibria in terms of their efficiency with respect to the social optimum of the Cloud by varying our algorithm initial solution. Numerical results show that our algorithm is scalable and very efficient and thus can be adopted for the run-time management of very large scale systems.
    European Journal of Operational Research 07/2014; 236(1):326-339. · 2.04 Impact Factor

Full-text

View
3 Downloads
Available from