scholarly journals Towards optimal service composition upon QoS in agent cooperation

Author(s):  
Chattrakul Sombattheera ◽  
Jun Shen
2021 ◽  
Vol 33 (3) ◽  
pp. 50-68
Author(s):  
Baili Zhang ◽  
Kejie Wen ◽  
Jianhua Lu ◽  
Mingjun Zhong

With the development of internet of things (IoT) technology, servitization of IoT device functions has become a trend. The cooperation between IoT devices can be equivalent to web service composition. However, current service composition approaches applied in the internet cannot work well in IoT environments due to weak adaptability, low accuracy, and poor time performance. This paper, based on service dependency graph, proposes a top-k QoS-optimal service composition approach suitable for IoT. It aims to construct the relationship between services by applying the service dependency model and to reduce the traversal space through effective filtering strategies. On the basis of a composition path traversal sequence, the generated service composition can be represented directly to avoid backtracking search. Meanwhile, the redundant services can be removed from the service composition with the help of dynamic programming. Experiments show that the approach can obtain the top-k QoS-optimal service composition and better time performance.


2021 ◽  
Author(s):  
Jian Yu ◽  
Zhixing Lin ◽  
Qiong Yu ◽  
Xiangmei Xiao

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.


Author(s):  
Feng Gao ◽  
Muhammad Intizar Ali ◽  
Edward Curry ◽  
Alessandra Mileo

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.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-20 ◽  
Author(s):  
Yinan Wu ◽  
Gongzhuang Peng ◽  
Hongwei Wang ◽  
Heming Zhang

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.


Sign in / Sign up

Export Citation Format

Share Document