Article

A novel heuristic algorithm for QoS-aware end-to-end service composition

Computer Communications (Impact Factor: 1.7). 06/2011; 34(9):1137-1144. DOI: 10.1016/j.comcom.2010.02.028
Source: DBLP

ABSTRACT

Many works have been carried out to find the efficient algorithms for QoS-aware service composition in recent years. Nevertheless, on one hand, some of these works only consider the local QoS attributes in Web services composition; on the other hand, some ideas derived from QoS selection algorithms for network routing are directly applied in service composition without any adaption. A service composition model with end-to-end QoS constraints has been presented in this paper. An improved heuristics HCE based on the observation of characteristic of end-to-end service composition is proposed as a novel solution. Simulation results reveal the better performance of proposed heuristic compared to the other two heuristics, HMCOP and generic CE algorithm.

1 Follower
 · 
13 Reads
  • Source
    • "In the early 2000s and in the years before applications in cloud computing, service composition was introduced and investigated for web services (Kosuga et al., 2002; Milanovic & Malek, 2004; Schmid, Chart, Sifalakis, & Scott, 2002; Singh, 2001). Different artificial and evolutionary algorithms (Ai & Tang, 2008; Canfora, Di Penta, Esposito, & Villani, 2005; Liao et al., 2011; Luo et al., 2011; Tang, Ai, & IEEE, 2010; Wang, 2009; Zhao, Ma, Wang, & Wen, 2012; Zhao et al., 2012) and classic algorithms (Gabrel, Manouvrier, Megdiche, Murat, & IEEE, 2012; Gao, Yang, Tang, Zhang, & Society, 2005; Gekas & Fasli, 2005; Liu, Li, & Wang, 2012; Liu, Wang, Shen, Luo, & Yan, 2012; Liu, Xiong, Zhao, Dong, & Yao, 2012; Liu, Zheng, Zhang, & Ren, 2011; Torkashvan & Haghighi, 2012) have been applied extensively to solve the problem. Designing workflows and frameworks for the composition of single services to achieve specific goals is another approach that has been observed in the field (Chen, Li, & Cao, 2006; He, Yan, Jin, & Yang, 2008; Song, Dou, & Chen, 2011; Song, Dou, & Chen, 2011). "
    [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.
    Full-text · Article · Jun 2014 · Expert Systems with Applications
  • Source
    • "Mas, de acordo com [15] qualquer tipo de fluxo pode ser transformado em um fluxo sequencial. Sem perder a generalidade, neste artigó e abordado o fluxo de composição sequencial apenas, da mesma forma que foi proposta em [15]. O fluxo de composição dos Web Services pode ser descrito como uma sequência de tarefas (Web Services abstratos ) com uma tarefa inicial e uma tarefa final. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper four different algorithms are proposed to solve the QoS-aware Web Services Composition (QWSC) problem in six different search-space sizes and a realistic deadline (a point not covered in many related works). Differently from some related works, statistical techniques are adopted in this paper in order to ensure more precise results from the algorithms. Two new algorithms are proposed: Greedy Heuristic and Double Hybrid Genetic Algorithm. The results of these algorithms were compared with an Exhaustive Search algorithm that always guarantees the global optima and a heuristic algorithm called Utility Function. The results obtained showed that the design of experiments and the performance evaluation can be used to determine which algorithms has better performance according to the different search-space sizes and the established deadline, it is also possible to determine which genetic operators are better suited for the QWSC problem.
    Full-text · Conference Paper · Oct 2012
  • Source
    • "Mas, de acordo com [15] qualquer tipo de fluxo pode ser transformado em um fluxo sequencial. Sem perder a generalidade, neste artigó e abordado o fluxo de composição sequencial apenas, da mesma forma que foi proposta em [15]. O fluxo de composição dos Web Services pode ser descrito como uma sequência de tarefas (Web Services abstratos ) com uma tarefa inicial e uma tarefa final. "
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper four different algorithms are proposed to solve the QoS-aware Web Services Composition (QWSC) problem in six different search-space sizes and a realistic deadline (a point not covered in many related works). Differently from some related works, statistical techniques are adopted in this paper in order to ensure more precise results from the algorithms. Two new algorithms are proposed: Greedy Heuristic and Double Hybrid Genetic Algorithm. The results of these algorithms were compared with an Exhaustive Search algorithm that always guarantees the global optima and a heuristic algorithm called Utility Function. The results obtained showed that the design of experiments and the performance evaluation can be used to determine which algorithms has better performance according to the different search-space sizes and the established deadline, it is also possible to determine which genetic operators are better suited for the QWSC problem.
    Full-text · Conference Paper · Oct 2012
Show more