QoS Correlation-based Service Composition Algorithm for Multi-constraint Optimal Path

2021 ◽  
Author(s):  
Jian Yu ◽  
Zhixing Lin ◽  
Qiong Yu ◽  
Xiangmei Xiao
Keyword(s):  
Service Composition ◽  
Optimal Path ◽  
Path Selection ◽  
Approximate Algorithm ◽  
Solution Path ◽  
Network Service ◽  
Integrated Network ◽  
Qos Guarantee ◽  
Optimal Service

Abstract With the development of network service integration, in order to obtain a better quality of service (QoS) guarantee, In this Paper,We consider the characteristics of integrated network service composition and correlation, this paper proposes a approximate algorithm based on multi-constraint optimal path selection (MCOPS). We analyses the QoS correlation criteria, correlation ratios, and Skyline algorithms to calculate the optimal path by dynamic programming, record the path nodes, and obtain the optimal service composition path that meets the user's demand. Simulation results demonstrate the good performance of the proposed algorithm in both the average calculation time and the solution path quality.

QoS-Aware Stream Federation and Optimization Based on Service Composition

2016 ◽  
Vol 12 (4) ◽  
pp. 43-67
Author(s):  
Feng Gao ◽  
Muhammad Intizar Ali ◽  
Edward Curry ◽  
Alessandra Mileo
Keyword(s):  
Quality Of Service ◽  
Service Composition ◽  
Urban Environments ◽  
Sensor Data ◽  
Optimal Service ◽  
Complex Events ◽  
System Robustness ◽  
Service Aggregation ◽  
Event Service

The proliferation of sensor devices and services along with the advances in event processing brings many new opportunities as well as challenges. It is now possible to provide, analyze and react upon real-time, complex events in urban environments. When existing event services do not provide such complex events directly, an event service composition maybe required. However, it is difficult to determine which event service candidates (or service compositions) best suit users' and applications' quality-of-service requirements. A sub-optimal service composition may lead to inaccurate event detection, lack of system robustness etc. In this paper, the authors address these issues by first providing a quality-of-service aggregation schema for complex event service compositions and then developing a genetic algorithm to efficiently create near-optimal event service compositions. The authors evaluate their approach with both real sensor data collected via Internet-of-Things services as well as synthesised datasets.

scholarly journals A Heuristic Algorithm for Optimal Service Composition in Complex Manufacturing Networks

Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-20 ◽  
Author(s):  
Yinan Wu ◽  
Gongzhuang Peng ◽  
Hongwei Wang ◽  
Heming Zhang
Keyword(s):  
Service Composition ◽  
Optimal Path ◽  
Cloud Manufacturing ◽  
Search Procedure ◽  
Manufacturing Networks ◽  
Composition Problem ◽  
Optimal Service ◽  
Manufacturing Platform ◽  
Manufacturing Network ◽  
Composition Path

Service composition in a Cloud Manufacturing environment involves the adaptive and optimal assembly of manufacturing services to achieve quick responses to varied manufacturing needs. It is challenged by the inherent heterogeneity and complexity of these services in terms of their diverse and complex functions, qualities of service, execution paths, etc. In this paper, a manufacturing network is constructed to explicitly identify and describe the relationships between individual services based on their attributes. On this basis, the service composition problem can be modeled as a multiple-constrained optimal path (MCOP) selection problem by taking into account different types of composition, namely, sequence, parallel, selection, and cycle. A novel Dual Heuristic Functions based Optimal Service Composition Path algorithm (DHA_OSCP) is proposed to solve the NP-Complete MCOP problem, which involves exploiting the backward search procedure with different search targets to obtain two heuristic functions for the forward search procedure. The proposed algorithm is evaluated through a set of computational experiments in which the proposed algorithm and other popular algorithms such as MFPB_HOSTP are applied to the same dataset, and the results obtained show that DHA_OSCP can efficiently find the optimal service composition path with better Quality of Service (QoS). The viability of DHA_OSCP is further proved in a case study of services composition on a Cloud Manufacturing platform.

On Web Service Composition with QoS Constraint

2011 ◽  
Vol 268-270 ◽  
pp. 1838-1843 ◽  
Author(s):  
Wen Tao Liu
Keyword(s):  
Genetic Algorithm ◽  
Web Service ◽  
Service Composition ◽  
Large Scale ◽  
Optimal Path ◽  
Web Service Composition ◽  
Large Scale Problems ◽  
Optimal Service ◽  
Construct System ◽  
The Web

The software architecture based on web service has become the critical technique to construct system in the distributed environments. The web service composition is the most important method to find the correct service in the complicated application circumstance. The key question is to find service based on the QoS and how to guarantee the quality. This thesis focuses the web service composition in order to get dynamic business cooperation and integration. The key component of web service is discussed and the method of web service composition is analyzed including the formalization verification and service composition architecture and the QoS-aware composition methods. Aimed at the application of web service composition, a method based on approved genetic algorithm is put forward. The simple genetic algorithm based web service composition has many problems such as slow convergence rate and non-optimal service composition. In this paper a genetic algorithm based on niche is provided for the Qos-aware composition and it can get more accurate service composition result and can get the optimal path quickly especially in the large scale problems according to the experiment.

scholarly journals Routing by HDF based Optimal Path Selection in Multipath WSNs

2019 ◽  
Vol 8 (3) ◽  
pp. 1435-1439
Keyword(s):  
Clustering Algorithm ◽  
Performance Metrics ◽  
Cluster Formation ◽  
Optimal Path ◽  
Path Selection ◽  
Optimal Routing ◽  
Route Selection ◽  
Grey Wolf Optimization ◽  
Network Nodes

Multipath routing (MPR) is an effectual method for routing data on Wireless Sensor Networks (WSNs) since it offers security, reliability as well as load balancing (LB) that are particularly serious in the resource-constrained scheme like WSNs. This paper proposed a selecting optimal routing path in MPR using QoS for WSN. In the First phase, the network nodes are initialized. Next, the nodes are formed as a cluster which is known as cluster formation utilizing K-Medoid clustering algorithm. In the cluster formation, the cluster heads (CH) are chosen from each cluster using Grey wolf Optimization (GWO) algorithm. In the next stage, routing operation is performed, which is bifurcated into 2 sections as, multipath route selection, and optimal path selection (OPS). For multipath route selection, AOMDV protocol is used. Using this protocol, efficient multipath routes are chosen in the network. After several transmissions, a route might lose the quality of the link. So an optimal path is chosen from the existing routes in the network using Hybrid Dragon Fly (HDF) optimization. Performance metrics of the proposed work is compared with that of existing optimal path routings techniques. Results illustrate that our model exhibited better energy efficiency along with Network Lifetime when compared to the existing routing models

scholarly journals Service Composition in IoT using Genetic algorithm and Particle swarm optimization

2020 ◽  
Vol 10 (1) ◽  
pp. 56-64 ◽  
Author(s):  
Neeti Kashyap ◽  
A. Charan Kumari ◽  
Rita Chhikara
Keyword(s):  
Genetic Algorithm ◽  
Quality Of Service ◽  
Particle Swarm Optimization ◽  
Service Composition ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Critical Issue ◽  
Swarm Optimization

AbstractWeb service compositions are commendable in structuring innovative applications for different Internet-based business solutions. The existing services can be reused by the other applications via the web. Due to the availability of services that can serve similar functionality, suitable Service Composition (SC) is required. There is a set of candidates for each service in SC from which a suitable candidate service is picked based on certain criteria. Quality of service (QoS) is one of the criteria to select the appropriate service. A standout amongst the most important functionality presented by services in the Internet of Things (IoT) based system is the dynamic composability. In this paper, two of the metaheuristic algorithms namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are utilized to tackle QoS based service composition issues. QoS has turned into a critical issue in the management of web services because of the immense number of services that furnish similar functionality yet with various characteristics. Quality of service in service composition comprises of different non-functional factors, for example, service cost, execution time, availability, throughput, and reliability. Choosing appropriate SC for IoT based applications in order to optimize the QoS parameters with the fulfillment of user’s necessities has turned into a critical issue that is addressed in this paper. To obtain results via simulation, the PSO algorithm is used to solve the SC problem in IoT. This is further assessed and contrasted with GA. Experimental results demonstrate that GA can enhance the proficiency of solutions for SC problem in IoT. It can also help in identifying the optimal solution and also shows preferable outcomes over PSO.

An Optimal Service Selection with Constraints Based on QoS Algorithm

2012 ◽  
Vol 487 ◽  
pp. 357-364
Author(s):  
Xin Jun Li
Keyword(s):  
Computing Time ◽  
Service Selection ◽  
Optimal Service ◽  
Availability Constraints ◽  
The One ◽  
Qos Performance ◽  
The Impact ◽  
Structural Aspects ◽  
Reliability And Availability

In the paper, we propose an allocation scheme that minimizes the response time and cost of the solution subject to reliability and availability constraints in terms of expected value. The algorithm proposed in this paper aims to discover services with high QoS performance, and reduce the execute time at the same time. First, we identify the impact of various structural aspects of the composition in terms of the performance and outcomes of the composition. Then, an algorithm is proposed which can reduce the computing time and makes sure better quality of the services selection at the same time by examining a very tiny fraction of the solution space.Finally, we proves the advantage of the new algorithm by comparing the time obtained by our proposed algorithm with the one achieved by other algorithm.

scholarly journals SSAAR: Enhanced Spatial Reusability for Optimal Path Selection in Wireless Sensor Networks

2017 ◽  
Vol 10 (34) ◽  
pp. 1-6
Author(s):  
R. Deepthi ◽  
D. Sai Eswari ◽  
Afreen Rafiq ◽  
K. Srinivas ◽  
◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Optimal Path ◽  
Path Selection ◽  
Wireless Sensor ◽  
Spatial Reusability
Sign in / Sign up

Export Citation Format

Share Document