Pernicl, B.: Adaptive Service Composition in Flexible Processed. IEEE Transactions on Software Engineering 33(6), 369-384

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


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

25 Reads
  • Source
    • "A service chain has four types of structures – serial, parallel, selection, and loop. It is permissible to break down any of the four types into different execution paths, simplifying the resulting execution path into a directed non-loop graph including only the serial and parallel structures [7] . Therefore, the path selection of the service chains discussed in this article only considers two types of structures, namely parallel and serial paths. "

  • Source
    • "There has been much research on the selection of RPs in wired networks mainly in the field of Web services [9] [10] [11] [12]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Despite the increasing use of mobile computing, exploiting its full potential is difficult due to its inherent characteristics such as error-prone transmission channels, diverse node capabilities, frequent disconnections and mobility. Mobile Cloud Computing (MCC) is a paradigm that is aimed at overcoming previous problems through integrating mobile devices with cloud computing. Mobile devices, in the traditional client-server architecture of MCC, offload their tasks to the cloud to utilize the computation and storage resources of data centers. However, along with the development of hardware and software technologies in mobile devices, researchers have begun to take into consideration local resource sharing among mobile devices themselves. This is defined as the cooperation based architecture of MCC. Analogous to the conventional terminology, the resource platforms that are comprised of surrounding surrogate mobile devices are called local resource clouds. Some researchers have recently verified the feasibility and benefits of this strategy. However, existing work has neglected an important issue with this approach, i.e., how to construct local resource clouds in dynamic mobile wireless networks. This paper presents the concept and design of a local resource cloud that is both energy and time efficient. Along with theoretical models and formal definitions of problems, an efficient heuristic algorithm with low computational complexity is also presented. The results from simulations demonstrate the effectiveness of the proposed models and method.
    IEICE Transactions on Communications 09/2014; E97.B(9):1865-1874. DOI:10.1587/transcom.E97.B.1865 · 0.23 Impact Factor
  • Source
    • "Table 1 summarizes the notation used in this paper for quick reference. Note that, the SaaS SLA contract parameters (e.g., R S k or p k ) are usually public available and stored in public registries [13]. Requests arrival rates and resource demands (i.e., Λ k , µ k ) can be determined by SaaS and PaaS by prediction methods or monitoring [6] [9]. "
    [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. DOI:10.1016/j.ejor.2013.12.007 · 2.36 Impact Factor
Show more

Preview (2 Sources)

25 Reads
Available from