952 research outputs found

    Cloud Service Selection System Approach based on QoS Model: A Systematic Review

    Get PDF
    The Internet of Things (IoT) has received a lot of interest from researchers recently. IoT is seen as a component of the Internet of Things, which will include billions of intelligent, talkative "things" in the coming decades. IoT is a diverse, multi-layer, wide-area network composed of a number of network links. The detection of services and on-demand supply are difficult in such networks, which are comprised of a variety of resource-limited devices. The growth of service computing-related fields will be aided by the development of new IoT services. Therefore, Cloud service composition provides significant services by integrating the single services. Because of the fast spread of cloud services and their different Quality of Service (QoS), identifying necessary tasks and putting together a service model that includes specific performance assurances has become a major technological problem that has caused widespread concern. Various strategies are used in the composition of services i.e., Clustering, Fuzzy, Deep Learning, Particle Swarm Optimization, Cuckoo Search Algorithm and so on. Researchers have made significant efforts in this field, and computational intelligence approaches are thought to be useful in tackling such challenges. Even though, no systematic research on this topic has been done with specific attention to computational intelligence. Therefore, this publication provides a thorough overview of QoS-aware web service composition, with QoS models and approaches to finding future aspects

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Get PDF
    The goal of QoS-aware service composition is to generate optimal composite services that satisfy the QoS requirements defined by clients. However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. This issue brings us to the challenge of solving the QoS-aware service composition problem, so called an optimization problem. A further research challenge is the determination of the QoS characteristics that can be considered as selection criteria. In this thesis, a smart QoS-aware service composition approach is proposed. The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. This mechanism is performed in two steps. First, the runtime path prediction method predicts, at runtime, and just before the actual composition, execution, the execution path that will potentially be executed. Second, both the constructive procedure (CP) and the complementary procedure (CCP) heuristic algorithms computed the optimization considering only the execution path that has been predicted by the runtime path prediction method for criteria selection, eight QoS characteristics are suggested after investigating related works on the area of web service and web service composition. Furthermore, prioritizing the selected QoS criteria is suggested in order to assist clients when choosing the right criteria. Experiments via WEKA tool and simulation prototype were conducted to evaluate the methods used. For the runtime path prediction method, the results showed that the path prediction method achieved promising prediction accuracy, and the number of paths involved in the prediction did not affect the accuracy. For the optimization mechanism, the evaluation was conducted by comparing the mechanism with relevant optimization techniques. The simulation results showed that the proposed optimization mechanism outperforms the relevant optimization techniques by (1) generating the highest overall QoS ratio solutions, (2) consuming the smallest computation time, and (3) producing the lowest percentage of constraints violated number

    SLA based cloud service composition using genetic algorithm

    Get PDF
    Cloud computing tends to provide high quality on-demand services to the users. Numerous services are evolving today. Functionally similar services are having different non-functional properties such as reliability, availability, accessibility, response time and cost. A single service is inadequate for constructing the business process. Such business process is modeled as composite service. Composite service consists of several atomic services connected by workflow patterns. Selecting services for service composition with the constraints specified in Service Level Agreement is the NP-hard problem. Such a cloud service composition problem is modeled in this paper. Genetic based cloud service composition algorithm (GCSC) is proposed. Proposed algorithm is compared with the existing genetic based cloud service composition algorithm based on average utility rate and convergence time. It is proved that the proposed algorithm provides better performance as compared to the existing cloud service composition algorithm

    SLA based cloud service composition using genetic algorithm

    Get PDF
    Cloud computing tends to provide high quality on-demand services to the users. Numerous services are evolving today. Functionally similar services are having different non-functional properties such as reliability, availability, accessibility, response time and cost. A single service is inadequate for constructing the business process. Such business process is modeled as composite service. Composite service consists of several atomic services connected by workflow patterns. Selecting services for service composition with the constraints specified in Service Level Agreement is the NP-hard problem. Such a cloud service composition problem is modeled in this paper. Genetic based cloud service composition algorithm (GCSC) is proposed. Proposed algorithm is compared with the existing genetic based cloud service composition algorithm based on average utility rate and convergence time. It is proved that the proposed algorithm provides better performance as compared to the existing cloud service composition algorithm

    A WOA-based optimization approach for task scheduling in cloud Computing systems

    Get PDF
    Task scheduling in cloud computing can directly affect the resource usage and operational cost of a system. To improve the efficiency of task executions in a cloud, various metaheuristic algorithms, as well as their variations, have been proposed to optimize the scheduling. In this work, for the first time, we apply the latest metaheuristics WOA (the whale optimization algorithm) for cloud task scheduling with a multiobjective optimization model, aiming at improving the performance of a cloud system with given computing resources. On that basis, we propose an advanced approach called IWC (Improved WOA for Cloud task scheduling) to further improve the optimal solution search capability of the WOA-based method. We present the detailed implementation of IWC and our simulation-based experiments show that the proposed IWC has better convergence speed and accuracy in searching for the optimal task scheduling plans, compared to the current metaheuristic algorithms. Moreover, it can also achieve better performance on system resource utilization, in the presence of both small and large-scale tasks

    Novel optimization schemes for service composition in the cloud using learning automata-based matrix factorization

    Get PDF
    A thesis submitted to the University of Bedfordshire, in partial fulfilment of the requirements for the degree of Doctor of PhilosophyService Oriented Computing (SOC) provides a framework for the realization of loosely couple service oriented applications (SOA). Web services are central to the concept of SOC. They possess several benefits which are useful to SOA e.g. encapsulation, loose coupling and reusability. Using web services, an application can embed its functionalities within the business process of other applications. This is made possible through web service composition. Web services are composed to provide more complex functions for a service consumer in the form of a value added composite service. Currently, research into how web services can be composed to yield QoS (Quality of Service) optimal composite service has gathered significant attention. However, the number and services has risen thereby increasing the number of possible service combinations and also amplifying the impact of network on composite service performance. QoS-based service composition in the cloud addresses two important sub-problems; Prediction of network performance between web service nodes in the cloud, and QoS-based web service composition. We model the former problem as a prediction problem while the later problem is modelled as an NP-Hard optimization problem due to its complex, constrained and multi-objective nature. This thesis contributed to the prediction problem by presenting a novel learning automata-based non-negative matrix factorization algorithm (LANMF) for estimating end-to-end network latency of a composition in the cloud. LANMF encodes each web service node as an automaton which allows v it to estimate its network coordinate in such a way that prediction error is minimized. Experiments indicate that LANMF is more accurate than current approaches. The thesis also contributed to the QoS-based service composition problem by proposing four evolutionary algorithms; a network-aware genetic algorithm (INSGA), a K-mean based genetic algorithm (KNSGA), a multi-population particle swarm optimization algorithm (NMPSO), and a non-dominated sort fruit fly algorithm (NFOA). The algorithms adopt different evolutionary strategies coupled with LANMF method to search for low latency and QoSoptimal solutions. They also employ a unique constraint handling method used to penalize solutions that violate user specified QoS constraints. Experiments demonstrate the efficiency and scalability of the algorithms in a large scale environment. Also the algorithms outperform other evolutionary algorithms in terms of optimality and calability. In addition, the thesis contributed to QoS-based web service composition in a dynamic environment. This is motivated by the ineffectiveness of the four proposed algorithms in a dynamically hanging QoS environment such as a real world scenario. Hence, we propose a new cellular automata-based genetic algorithm (CellGA) to address the issue. Experimental results show the effectiveness of CellGA in solving QoS-based service composition in dynamic QoS environment

    Machine Learning Algorithms in Cloud Manufacturing - A Review

    Get PDF
    Cloud computing has advanced significantly in terms of storage, QoS, online service availability, and integration with conventional business models and procedures. The traditional manufacturing firm becomes Cloud Manufacturing when Cloud Services are integrated into the present production process. The capabilities of Cloud Manufacturing are enhanced by Machine Learning. A lot of machine learning algorithms provide the user with the desired outcomes. The main objectives are to learn more about the architecture and analysis of Cloud Manufacturing frameworks and the role that machine learning algorithms play in cloud computing in general and Cloud Manufacturing specifically. Machine learning techniques like SVM, Genetic Algorithm, Ant Colony Optimisation techniques, and variants are employed in a cloud environment

    Toward a More Accurate Web Service Selection Using Modified Interval DEA Models with Undesirable Outputs

    Get PDF
    With the growing number of Web services on the internet, there is a challenge to select the best Web service which can offer more quality-of-service (QoS) values at the lowest price. Another challenge is the uncertainty of QoS values over time due to the unpredictable nature of the internet. In this paper, we modify the interval data envelopment analysis (DEA) models [Wang, Greatbanks and Yang (2005)] for QoS-aware Web service selection considering the uncertainty of QoS attributes in the presence of desirable and undesirable factors. We conduct a set of experiments using a synthesized dataset to show the capabilities of the proposed models. The experimental results show that the correlation between the proposed models and the interval DEA models is significant. Also, the proposed models provide almost robust results and represent more stable behavior than the interval DEA models against QoS variations. Finally, we demonstrate the usefulness of the proposed models for QoS-aware Web service composition. Experimental results indicate that the proposed models significantly improve the fitness of the resultant compositions when they filter out unsatisfactory candidate services for each abstract service in the preprocessing phase. These models help users to select the best possible cloud service considering the dynamic internet environment and they help service providers to improve their Web services in the marke
    corecore