A composite service selection algorithm based on structural model

Author(s):  
Xian-Gang Liu ◽  
Huan-Mei Zhang ◽  
Xing Zhang
2009 ◽  
Vol 31 (8) ◽  
pp. 1398-1411 ◽  
Author(s):  
Ming-Wei ZHANG ◽  
Wei-Jie WEI ◽  
Bin ZHANG ◽  
Xi-Zhe ZHANG ◽  
Zhi-Liang ZHU

Author(s):  
Yves Vanrompay ◽  
Manuele Kirsch-Pinheiro ◽  
Yolande Berbers

The current evolution of Service-Oriented Computing in ubiquitous systems is leading to the development of context-aware services. Context-aware services are services of which the description is enriched with context information related to non-functional requirements, describing the service execution environment or its adaptation capabilities. This information is often used for discovery and adaptation purposes. However, in real-life systems, context information is naturally dynamic, uncertain, and incomplete, which represents an important issue when comparing the service description with user requirements. Uncertainty of context information may lead to an inexact match between provided and required service capabilities, and consequently to the non-selection of services. In this chapter, we focus on how to handle uncertain and incomplete context information for service selection. We consider this issue by presenting a service ranking and selection algorithm, inspired by graph-based matching algorithms. This graph-based service selection algorithm compares contextual service descriptions using similarity measures that allow inexact matching. The service description and non-functional requirements are compared using two kinds of similarity measures: local measures, which compare individually required and provided properties, and global measures, which take into account the context description as a whole.


2013 ◽  
Vol 8 (5) ◽  
Author(s):  
Lei Mao ◽  
Yongguo Yang ◽  
Hui Xu ◽  
Ying Chen

Author(s):  
Liyang Sun ◽  
Jianning Lin ◽  
Zhenqi Ju ◽  
Shaojie Mao ◽  
Zhong Liu ◽  
...  

Being a new-generation C4ISR system simulation method, the construction approach of net-centric simulation (NCS) is developing toward net-centric from the traditional approach of platform-centric. NCS is mainly completed by the construction of the simulation task community (STC), the key to which being the dynamic integration of the various services spread in the network in order to form a new STC that meets the requirements of different users. In this study, a simulation task community service selection algorithm (STCSSA) is proposed. The main idea of this algorithm is to transform the construction of STC to the searching of optimal multi-objectives services with QoS global constraints. This paper first introduces the QoS model of STC and evaluates the service composition process, then presents the detailed operating process of STCSSA and design of the dynamic inertia weight strategy of the algorithm, and also proposes an optional variation method. Comparative tests were performed on STCSSA with other particle swarm optimization algorithms. It was validated from the perspective of performance that the proposed algorithm has advantages in improving the rate of convergence and avoiding local optimum, and from the perspective of practical application STCSSA also demonstrated feasibility in the construction of large-scale NCS task community.


Sign in / Sign up

Export Citation Format

Share Document