Artículos de revistas sobre el tema "Service composition"
Siga este enlace para ver otros tipos de publicaciones sobre el tema: Service composition.
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Service composition".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
1
Tarawneh, Hassan, Issam Alhadid, Sufian Khwaldeh y Suha Afaneh. "An Intelligent Cloud Service Composition Optimization Using Spider Monkey and Multistage Forward Search Algorithms". Symmetry 14, n.º 1 (5 de enero de 2022): 82. http://dx.doi.org/10.3390/sym14010082.
Texto completoResumen
Web service composition allows developers to create and deploy applications that take advantage of the capabilities of service-oriented computing. Such applications provide the developers with reusability opportunities as well as seamless access to a wide range of services that provide simple and complex tasks to meet the clients’ requests in accordance with the service-level agreement (SLA) requirements. Web service composition issues have been addressed as a significant area of research to select the right web services that provide the expected quality of service (QoS) and attain the clients’ SLA. The proposed model enhances the processes of web service selection and composition by minimizing the number of integrated Web Services, using the Multistage Forward Search (MSF). In addition, the proposed model uses the Spider Monkey Optimization (SMO) algorithm, which improves the services provided with regards to fundamentals of service composition methods symmetry and variations. It achieves that by minimizing the response time of the service compositions by employing the Load Balancer to distribute the workload. It finds the right balance between the Virtual Machines (VM) resources, processing capacity, and the services composition capabilities. Furthermore, it enhances the resource utilization of Web Services and optimizes the resources’ reusability effectively and efficiently. The experimental results will be compared with the composition results of the Smart Multistage Forward Search (SMFS) technique to prove the superiority, robustness, and effectiveness of the proposed model. The experimental results show that the proposed SMO model decreases the service composition construction time by 40.4%, compared to the composition time required by the SMFS technique. The experimental results also show that SMO increases the number of integrated ted web services in the service composition by 11.7%, in comparison with the results of the SMFS technique. In addition, the dynamic behavior of the SMO improves the proposed model’s throughput where the average number of the requests that the service compositions processed successfully increased by 1.25% compared to the throughput of the SMFS technique. Furthermore, the proposed model decreases the service compositions’ response time by 0.25 s, 0.69 s, and 5.35 s for the Excellent, Good, and Poor classes respectively compared to the results of the SMFS Service composition response times related to the same classes.
2
Fedorov, R. K., I. V. Bychkov y G. M. Rugnikov. "Building Service Compositions Based on data on Use of Services by Users". Vestnik NSU. Series: Information Technologies 19, n.º 2 (20 de julio de 2021): 115–30. http://dx.doi.org/10.25205/1818-7900-2021-19-2-115-130.
Texto completoResumen
The automatic service composition is discussed in the article. The method is proposed for building the service composition based on the processing of statistical data on individual applying services (tasks) by users. The method is based on linking tasks to each other, determining data dependencies, parameters of services whose values are rigidly set by the composition of services, and parameters whose values can be changed by the user are highlighted. Service compositions are built in the form of a directed graph of DAG. The methods have been developed for reducing the set of obtained service compositions, which allow us to highlight useful ones and rank them by degree of use. In particular, equivalent service compositions based on isomorphism of DAG graphs are determined, trivial ones are discarded, and only compositions that lead to the published result are left behind.
3
Gao, Feng, Muhammad Intizar Ali, Edward Curry y Alessandra Mileo. "QoS-Aware Stream Federation and Optimization Based on Service Composition". International Journal on Semantic Web and Information Systems 12, n.º 4 (octubre de 2016): 43–67. http://dx.doi.org/10.4018/ijswis.2016100103.
Texto completoResumen
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.
4
Rinderle-Ma, Stefanie, Manfred Reichert y Martin Jurisch. "On Utilizing Web Service Equivalence for Supporting the Composition Life Cycle". International Journal of Web Services Research 8, n.º 1 (enero de 2011): 41–67. http://dx.doi.org/10.4018/jwsr.2011010103.
Texto completoResumen
Deciding on Web service equivalence in process-aware service compositions is a crucial challenge throughout the composition life cycle. However, restricting such decisions to (activity) label equivalence is not sufficient for many practical applications: if two activities and Web services respectively have equivalent labels, does this necessarily mean they are equivalent as well? In many scenarios (e.g., evolution of a composition schema or mining of completed composition instances), other factors also play an important role. Examples include context information (e.g., input and output messages) and information on the position of Web services within compositions. In this paper, the authors introduce the whole composition life cycle and discuss specific requirements for Web service equivalence along its different phases. The authors define adequate equivalence notions for the design, execution, analysis, and evolution of service compositions. This paper focuses on attribute and position equivalence and contributes a new understanding and treatment of equivalence notions in service compositions.
5
Seth, Ashish y Kirti Seth. "Optimal Composition of Services for Intelligent Systems Using TOPSIS". International Journal of Information Retrieval Research 11, n.º 3 (julio de 2021): 49–64. http://dx.doi.org/10.4018/ijirr.2021070104.
Texto completoResumen
Service-oriented architecture is a widely accepted service used for supporting consolidation and integration functions under an enterprise system which are complex in nature but with an intelligent framework which helps in integrating the services in an optimistic and dynamic manner for getting the task done. For any service-oriented architecture-based application, its services are the main components, as it requires service compositions for answering various requests. There exist many possible service compositions for completing a task. To find an optimum composition from those dynamically present during run time is another crucial aspect for the success of this architecture. The present research elaborated a novel idea for optimal composition of services in SOA or any other service-based system. This paper covers a case study along with the outcomes of the experiment which indicates the efficiency and validity of the proposed technique.
6
Alhadid, Issam, Sufian Khwaldeh, Mohammad Al Rawajbeh, Evon Abu-Taieh, Ra’ed Masa’deh y Ibrahim Aljarah. "An Intelligent Web Service Composition and Resource-Optimization Method Using K-Means Clustering and Knapsack Algorithms". Mathematics 9, n.º 17 (24 de agosto de 2021): 2023. http://dx.doi.org/10.3390/math9172023.
Texto completoResumen
Service-oriented architecture (SOA) has emerged as a flexible software design style. SOA focuses on the development, use, and reuse of small, self-contained, independent blocks of code called web services that communicate over the network to perform a certain set of simple tasks. Web services are integrated as composite services to offer complex tasks and to provide the expected services and behavior in addition to fulfilling the clients’ requests according to the service-level agreement (SLA). Web service selection and composition problems have been a significant area of research to provide the expected quality of service (QoS) and to meet the clients’ expectations. This research paper presents a hybrid web service composition model to solve web service selection and composition problems and to optimize web services’ resource utilization using k-means clustering and knapsack algorithms. The proposed model aims to maximize the service compositions’ QoS and minimize the number of web services integrated within the service composition using the knapsack algorithm. Additionally, this paper aims to track the service compositions’ QoS attributes by evaluating and tracking the web services’ QoS using the reward function and, accordingly, use the k-means algorithm to decide to which cluster the web service belongs. The experimental results on a real dataset show the superiority and effectiveness of the proposed algorithm in comparison with the results of the state–action–reward–state–action (SARSA) and multistage forward search (MFS) algorithms. The experimental results show that the proposed model reduces the average time of the web service selection and composition processes to 37.02 s in comparison to 47.03 s for the SARSA algorithm and 42.72 s for the MFS algorithm. Furthermore, the average of web services’ resource utilization results increased by 4.68% using the proposed model in comparison to the resource utilization by the SARSA and MFS algorithms. In addition, the experimental results showed that the average number of service compositions using the proposed model improved by 26.04% compared with the SARSA and MFS algorithms.
7
BERARDI, DANIELA, FAHIMA CHEIKH, GIUSEPPE DE GIACOMO y FABIO PATRIZI. "AUTOMATIC SERVICE COMPOSITION VIA SIMULATION". International Journal of Foundations of Computer Science 19, n.º 02 (abril de 2008): 429–51. http://dx.doi.org/10.1142/s0129054108005759.
Texto completoResumen
In this paper we study the issue of service composition, for services that export a representation of their behavior in the form of a finite deterministic transition system. In particular, given a specification of the target service requested by the client as a finite deterministic transition system, the problem we face is how we can exploit the computations of the available services for realizing the computations of the target service. While ways to tackle such a problem are known, in this paper we present a new technique that is based on the notion of simulation, which is still optimal from the computational complexity point. Notably, such a technique, opens up the possibility of devising composition in a "just-in-time" fashion. Indeed, we show that, by exploiting simulation, it is actually possible to implicitly compute all possible compositions at once, and delay the choice of the actual composition to run-time.
8
Rouached, Mohsen. "Web Service Composition Security". International Journal of Service Science, Management, Engineering, and Technology 12, n.º 3 (mayo de 2021): 154–74. http://dx.doi.org/10.4018/ijssmet.2021050109.
Texto completoResumen
The continuous adoption of service-oriented architecture (SOA) and web services across vertical industries, geographies, and organization sizes generates new major security concerns both for individuals and organizations. Many of the features that make web services attractive, including greater accessibility of data, dynamic application-to-application connections, and relative autonomy are at odds with traditional security models and controls. Current web service composition technologies still present serious risks to individual and enterprise security and privacy. In the presence of multiple providers that coordinate to provide a composite web service, these issues are amplified. Web services security, privacy, and forensics investigations are therefore becoming a serious concern, especially with the tremendous increase in cybernetic crimes. The aim of this work is to draw a comprehensive overview about security aspects related to web services composition by considering different branches related to security, privacy, and forensics investigations. For each security aspect, the problem statement and related works are discussed. Then, a proposed approach to deal with the aspect under consideration is presented.
9
Chen, Ming, Junqiang Cheng, Guanghua Ma, Liang Tian, Xiaohong Li y Qingmin Shi. "Service Composition Recommendation Method Based on Recurrent Neural Network and Naive Bayes". Scientific Programming 2021 (29 de octubre de 2021): 1–9. http://dx.doi.org/10.1155/2021/1013682.
Texto completoResumen
Due to the lack of domain and interface knowledge, it is difficult for users to create suitable service processes according to their needs. Thus, the paper puts forward a new service composition recommendation method. The method is composed of two steps: the first step is service component recommendation based on recurrent neural network (RNN). When a user selects a service component, the RNN algorithm is exploited to recommend other matched services to the user, aiding the completion of a service composition. The second step is service composition recommendation based on Naive Bayes. When the user completes a service composition, considering the diversity of user interests, the Bayesian classifier is used to model their interests, and other service compositions that satisfy the user interests are recommended to the user. Experiments show that the proposed method can accurately recommend relevant service components and service compositions to users.
10
GANGADHARAN, G. R., VINCENZO D'ANDREA y MICHAEL WEISS. "SERVICE LICENSING COMPOSITION AND COMPATIBILITY ANALYSIS". International Journal of Cooperative Information Systems 17, n.º 03 (septiembre de 2008): 301–17. http://dx.doi.org/10.1142/s0218843008001841.
Texto completoResumen
Services enable the transformation of the World Wide Web as distributed interoperable systems interacting beyond organizational boundaries. Service licensing enables broader usage of services and a means for designing business strategies and relationships. A service license describes the terms and conditions for the use and access of the service in a machine interpretable way that services could be able to understand. Service-based applications are largely grounded on composition of independent services. In that scenario, license compatibility is a complex issue, requiring careful attention before attempting to merge licenses. The permissions and the prohibitions imposed by the licenses of services would deeply impact the composition. Thus, service licensing requires a comprehensive analysis on composition of these rights and requirements conforming to the nature of operations performed and compensation of services used in composition. In this paper, we analyze the compatibility of service license by describing a matchmaking algorithm. Further, we illustrate the composability of service licenses by creating a composite service license that is compatible with the licenses being composed.
11
Hao, Long. "A New Model for Web Service Composition". Advanced Materials Research 219-220 (marzo de 2011): 638–42. http://dx.doi.org/10.4028/www.scientific.net/amr.219-220.638.
Texto completoResumen
To support automated Web service composition, it is compelling to provide a template, or model that dictates the ways in which services can be composed. In this paper, a novel composition model based on the relative vector is proposed, where individual services, composite services, and user objectives are described with the relative vectors, through a series of operators defined on the relative vector, available composite services can be found, and how much they meet user objectives can be evaluated. A significant advantage of our approach is that many existing optimization methods can be used to search optimized compositions, where parallel or choice structure is enabled, individual service with multiple input or output parameters is allowed.
12
Chen, Zhi Juan y Rong Hua Ye. "The Petri Net Model of the Requirements and Service Composition". Applied Mechanics and Materials 347-350 (agosto de 2013): 2564–70. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2564.
Texto completoResumen
In the service-oriented environment, the composition of multiple web services is always used to satisfy the given request. To meet the request, the compositions of the services are various. Aim at such difficulty, described with the environment ontology, the relative theory of Petri net is proposed to build up the service composition requirement model. After simplify the model, an algorithm of building a reachability tree is proposed. Then all the possible service compositions are got through an algorithm similar as depth-first search. At last, we use the classic example of travel arrangement to verify the theory above all.
13
LEE, Choonhwa, Sunghoon KO, Eunsam KIM y Wonjun LEE. "Enriching OSGi Service Composition with Web Services". IEICE Transactions on Information and Systems E92-D, n.º 5 (2009): 1177–80. http://dx.doi.org/10.1587/transinf.e92.d.1177.
Texto completo
14
Ma, Hui, Favyen Bastani, I.-Ling Yen y Hong Mei. "QoS-Driven Service Composition with Reconfigurable Services". IEEE Transactions on Services Computing 6, n.º 1 (2013): 20–34. http://dx.doi.org/10.1109/tsc.2011.21.
Texto completo
15
hamad, Faten. "An Overview of Service Composition in Service Oriented Architecture". Modern Applied Science 12, n.º 8 (28 de julio de 2018): 172. http://dx.doi.org/10.5539/mas.v12n8p172.
Texto completoResumen
Service oriented architecture (SOA) is a form of software design in which application component supply services to other components through a network communication protocol, it has many services that can transfer small data with communication channels or additional services which bring into a relationship that ensure efficiency of service activities, SOA simplify the structure of loosely coupled applicable applications and enable contribution for enterprise working of services together. In order to assure the effectiveness of Service oriented architecture we have to confirm service composition which is the collection of services together in order to perform a specific function which can be used in service oriented architecture. In this paper we proposed a Service composition in SOA, it is present service composition with various techniques used for composing services and provided a comparison between them.
16
Ettazi, Widad, Driss Riane y Mahmoud Nassar. "How Can Transactional Semantics Enhance the Commit Rate of Context-aware Service Composition in Advanced Pervasive Systems?" International Journal of Recent Contributions from Engineering, Science & IT (iJES) 9, n.º 4 (3 de diciembre de 2021): 39–57. http://dx.doi.org/10.3991/ijes.v9i4.25919.
Texto completoResumen
Context-aware composition of services exhibiting transactional properties poses several challenges. A major challenge is the transactional behavior of candidate services which is subject to perpetual change while the composition is running. Compositions of services displaying transactional properties must be dynamically adapted at run time to cope with context fluctuations. By dynamic adaptation, we refer to the ability to alter the composition behavior in response to changes affecting its execution. We focus on changes impacting the successful commit rate of transactional service composition. This has led us to explore the trail of a flexible homeomorphism between alternative behaviors. We propose a behavioral adaptation approach that adjusts the behavior of transactional compositions of services in a proactive and transparent manner. This strategy is based on the Profiled Task Class concept. A service composition generator has also been developed for the performance evaluation of components implementing the behavioral adaptation strategy in order to identify its impact on the commit rate of CATS compositions.
17
Lemos, Angel Lagares, Florian Daniel y Boualem Benatallah. "Web Service Composition". ACM Computing Surveys 48, n.º 3 (8 de febrero de 2016): 1–41. http://dx.doi.org/10.1145/2831270.
Texto completo
18
Baldissera, Thais A. y Luis M. Camarinha-Matos. "SCoPE: Service Composition and Personalization Environment". Applied Sciences 8, n.º 11 (19 de noviembre de 2018): 2297. http://dx.doi.org/10.3390/app8112297.
Texto completoResumen
Current demographic trends suggest that people are living longer, while the ageing process entails many necessities calling for care services tailored to the individual senior’s needs and life style. Personalized provision of care services usually involves a number of stakeholders, including relatives, friends, caregivers, professional assistance organizations, enterprises, and other support entities. Traditional Information and Communication Technology (ICT) based care and assistance services for the elderly have been mainly focused on the development of isolated and generic services, considering a single service provider, and excessively featuring a techno-centric approach. In contrast, advances on collaborative networks for elderly care suggest the integration of services from multiple providers, encouraging collaboration as a way to provide better personalized services. This approach requires a support system to manage the personalization process and allow ranking the {service, provider} pairs. In accordance with these requirements, an Elderly Care Ecosystem (ECE) framework and a Service Composition and Personalization Environment (SCoPE) are proposed. ECE provides the context for the personalization method which is based on the match between a taxonomy of care needs and the {service, provider} pairs, and the calculation of a service adherence index to identify suitable services and corresponding providers. To demonstrate the feasibility and applicability of SCoPE, a number of methods and algorithms are presented. Furthermore, an illustrative scenario is introduced in which {service, provider} pairs are ranked based on multidimensional assessment method and composition strategies are based on customer’s profile and requirements.
19
LÉCUÉ, FREDDY, ALEXANDRE DELTEIL, ALAIN LÉGER y OLIVIER BOISSIER. "WEB SERVICE COMPOSITION AS A COMPOSITION OF VALID AND ROBUST SEMANTIC LINKS". International Journal of Cooperative Information Systems 18, n.º 01 (marzo de 2009): 1–62. http://dx.doi.org/10.1142/s0218843009001975.
Texto completoResumen
Automated composition of Web services or the process of forming new value-added Web services is one of the most promising challenges facing the Semantic Web today. Semantics enables Web service to describe capabilities together with their processes, hence one of the key elements for the automated composition of Web services. In this paper, we focus on the functional level of Web services i.e. services are described according to some input, output parameters semantically enhanced by concepts in a domain ontology. Web service composition is then viewed as a composition of semantic links wherein the latter links refer to semantic matchmaking between Web service parameters (i.e. outputs and inputs) in order to model their connection and interaction. The key idea is that the matchmaking enables, at run time, finding semantic compatibilities among independently defined Web service descriptions. By considering such a level of composition, a formal model to perform the automated composition of Web services i.e. Semantic Link Matrix, is introduced. The latter model is required as a starting point to apply problem-solving techniques such as regression (or progression)-based search for Web service composition. The model supports a semantic context in order to find correct, complete, consistent and robust plans as solutions. In this paper, an innovative and formal model for an AI (Artificial Intelligence) planning-oriented composition is presented. Our system is implemented and interacting with Web services which are dedicated to Telecom scenarios. The preliminary evaluation results showed high efficiency and effectiveness of the proposed approach.
20
LEE, JONATHAN, SHANG-PIN MA, YING-YAN LIN, SHIN-JIE LEE y YAO-CHIANG WANG. "DYNAMIC SERVICE COMPOSITION: A DISCOVERY-BASED APPROACH". International Journal of Software Engineering and Knowledge Engineering 18, n.º 02 (marzo de 2008): 199–222. http://dx.doi.org/10.1142/s0218194008003635.
Texto completoResumen
Service-Orientated Computing (SOC) has become a main trend in software engineering that promotes the construction of applications based on the notion of services. SOC has recently attracted the researchers' attention and has been adopted industry-wide. However, service composition that enables one to aggregate existing services into a new composite service is still a highly complex and critical task in service-oriented technology. To enhance availability of composite services, we propose a discovery-based service composition framework to better integrate component services in both static and dynamic manner, including (1) to devise a notion of service availability especially for composition; (2) to develop a dynamic service composition (DSC) pattern for addressing the issues of service availability; and (3) to extend Contract Net Protocol (ECNP) to coordinate service discovery, composition and invocation based on the composite pattern. The main benefit of the proposed approach is better availability through attaching multiple candidate services for future binding.
21
Zhou, Jiehan, Kumaripaba Athukorala, Ekaterina Gilman, Jukka Riekki y Mika Ylianttila. "Cloud Architecture for Dynamic Service Composition". International Journal of Grid and High Performance Computing 4, n.º 2 (abril de 2012): 17–31. http://dx.doi.org/10.4018/jghpc.2012040102.
Texto completoResumen
Service composition provides value-adding services through composing basic Web services, which may be provided by various organizations. Cloud computing presents an efficient managerial, on-demand, and scalable way to integrate computational resources (hardware, platform, and software). However, existing Cloud architecture lacks the layer of middleware to enable dynamic service composition. To enable and accelerate on-demand service composition, the authors explore the paradigm of dynamic service composition in the Cloud for Pervasive Service Computing environments and propose a Cloud-based Middleware for Dynamic Service Composition (CM4SC). In this approach, the authors introduce the CM4SC ‘Composition as a Service’ middleware layer into conventional Cloud architecture to allow automatic composition planning, service discovery and service composition. The authors implement the CM4SC middleware prototype utilizing Windows Azure Cloud platform. The prototype demonstrates the feasibility of CM4SC for accelerating dynamic service composition and that the CM4SC middleware-accelerated Cloud architecture offers a novel way for realizing dynamic service composition.
22
Liang, Jin y Klara Nahrstedt. "Service composition for generic service graphs". Multimedia Systems 11, n.º 6 (25 de marzo de 2006): 568–81. http://dx.doi.org/10.1007/s00530-006-0026-0.
Texto completo
23
Wang, Xianzhi, Zhongjie Wang y Xiaofei Xu. "Effective Service Composition in Large Scale Service Market". International Journal of Web Services Research 9, n.º 1 (enero de 2012): 74–94. http://dx.doi.org/10.4018/jwsr.2012010104.
Texto completoResumen
The web has undergone a tremendous shift from information repository to the provisioning capacity of services. As an effective means of constructing coarse-grained solutions by dynamically aggregating a set of services to satisfy complex requirements, traditional service composition suffers from dramatic decrease on the efficiency of determining the optimal solution when large scale services are available in the Internet based service market. Most current approaches look for the optimal composition solution by real-time computation, and the composition efficiency greatly depends on the adopted algorithms. To eliminate such deficiency, this paper proposes a semi-empirical composition approach which incorporates the extraction of empirical evidence from historical experiences to provide guidance to solution space reduction to real-time service selection. Service communities and historical requirements are further organized into clusters based on similarity measurement, and then the probabilistic correspondences between the two types of clusters are identified by statistical analysis. For each new request, its hosting requirement cluster would be identified and corresponding service clusters would be determined by leveraging Bayesian inference. Concrete services would be selected from the reduced solution space to constitute the final composition. Timing strategies for re-clustering and consideration to special cases in clustering ensures continual adaption of the approach to changing environment. Instead of relying solely on pure real-time computation, the approach distinguishes from traditional methods by combining the two perspectives together.
24
Zhao, Zheng De, Yue Hui Cui y Jian Jun Li. "Composition Oriented Semantic Relationships Mining Framework Research". Applied Mechanics and Materials 513-517 (febrero de 2014): 470–73. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.470.
Texto completoResumen
In order to improve the efficiency of service discovery and service composition, this paper proposes a Composition oriented Web services semantic relationships mining framework. Firstly, Web services need to be pretreated, which are filtered based on QoS; and then adopt the method of service functional clustering to generate service classes, which largely reduces the services search space and improve the efficiency of service discovery; Secondly, in order to excavate the semantic relationships between service classes that meet the business logic requirement, we need to set the composition rules between service classes; Finally, using two stages of mining algorithms to excavate the semantic relationships between service classes. Experimental results are given to validate the feasibility and validity of our framework.
25
Ma, Shang-Pin, Hsuan-Ju Lin y Ming-Jen Hsu. "Semantic Restful Service Composition Using Task Specification". International Journal of Software Engineering and Knowledge Engineering 30, n.º 06 (junio de 2020): 835–57. http://dx.doi.org/10.1142/s0218194020400094.
Texto completoResumen
Existing Web API search engines allow only category-based browsing and keyword- or tag-based searches for RESTful services. In other words, they do not enable the discovery or composition of real-world RESTful services by application developers. This paper outlines a novel scheme, called Transformation–Annotation–Discovery (TAD), which transforms OpenAPI (Swagger) documents related to RESTful services into a graph structure and then automatically annotates the semantic concepts on graph nodes using Latent Dirichlet Allocation (LDA) and WordNet. TAD can then be used for service composition based on the user requirements specified in two modules: a service discovery chain and logical-operation-based composition. The service discovery chain uses the Hungarian algorithm to assess service interface compatibility in order to facilitate the retrieval of services capable of bridging the gap between specified user requirements and the discovered services. The logical-operation-based composition module identifies services that semantically fit the user requirements, based on the structure of the service flow. Those candidate services are then sent to service discovery chains to enable the simultaneous search for potential composition solutions. System prototype and experiment results demonstrate the feasibility and efficacy of the proposed scheme.
26
Sasikaladevi, N. "SLA based cloud service composition using genetic algorithm". International Journal of Advances in Intelligent Informatics 2, n.º 2 (31 de julio de 2016): 77. http://dx.doi.org/10.26555/ijain.v2i2.58.
Texto completoResumen
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.
27
Gao, Honghao, Kang Zhang, Jianhua Yang, Fangguo Wu y Hongsheng Liu. "Applying improved particle swarm optimization for dynamic service composition focusing on quality of service evaluations under hybrid networks". International Journal of Distributed Sensor Networks 14, n.º 2 (febrero de 2018): 155014771876158. http://dx.doi.org/10.1177/1550147718761583.
Texto completoResumen
Hybrid services use different protocols on various networks, such as WIFI networks, Bluetooth networks, 5G communications systems, and wireless sensor networks. Hybrid service compositions can be varied, representing an effective method of integrating into wireless scenarios context-aware applications that can sense mobility via changes in user location and combining services to support target functions. In this article, improved particle swarm optimization is introduced into the quality service evaluation of dynamic service composition to meet the mobility requirements of hybrid networks. First, this work classifies hybrid services into different task groups to generate candidate sets and then interface matching is used to compare the operations of candidate services with user requirements to select the appropriate services. Second, the service composition is determined by the particle swarm optimization simulation process, which aims to identify an optimal plan based on the calculated value from quality of service. Third, considering a change of service repository, when the quality of a composite service is lower than a predefined threshold, the local greedy algorithm and global reconfiguration method are adopted to dynamically restructure composite services. Finally, a set of experiments is conducted to demonstrate the effectiveness of the proposed method for determining the dynamic service composition, particularly when the scale of hybrid services is large. The method provides a technical reference for engineering practice that will fulfill mobile computing needs.
28
Pop, Florin-Claudiu, Marcel Cremene, Mircea Vaida, Michel Riveill, Jean-Yves Tigli y Stéphane Lavirotte. "Natural Language based On-demand Service Composition". International Journal of Computers Communications & Control 5, n.º 5 (1 de diciembre de 2010): 871. http://dx.doi.org/10.15837/ijccc.2010.5.2248.
Texto completoResumen
The widespread of Web services in the ubiquitous computing era and the impossibility to predict a priori all possible user needs generates the necessity for on-demand service composition. Natural language is one of the the easiest ways for a user to express what he expects regarding a service. Two main problems need to be solved in order to create a composite service to satisfy the user: a)retrieval of relevant services and b) orchestration/composition of the selected services in order to fulfill the user request. We solve the first problem by using semantic concepts associated with the services and we define a conceptual distance to measure the similarity between the user request and a service configuration. Retrieved services are composed, based on aspect oriented templates called Aspects of Assembly. We have tested our application in an environment for pervasive computing called Ubiquarium, where our system composes a service according to the user request described by a sentence. The implementation is based on the WComp middleware that enables us to use regular Web services but also Web services for devices.
29
Zhang, Zhongmei, Zhongguo Yang, Sikandar Ali, Muhammad Asshad y Shaher Suleman Slehat. "A Dynamic Declarative Composition Scheme for Stream Data Services". Mobile Information Systems 2021 (12 de octubre de 2021): 1–8. http://dx.doi.org/10.1155/2021/2502083.
Texto completoResumen
With the fast development of Sensor Network, Internet of Things, mobile devices, and pervasive computing, enormous amounts of sensor devices are deployed in physical world. Data streams produced by these sensor devices, deployed broadly, can be used to create various value-added applications. Facing continuous, real-time, high-frequency, low-valued data streams, how to flexibly and efficiently cooperate them for creating valuable application is very crucial. In this study, we propose a service-oriented manner to realize flexible streams integration. It considers data stream produced by one sensor data as a stream data service and utilizes composing multiple services to realize the cooperation among sensor devices. Firstly, we propose a stream data service model based on Event-Condition-Action rules, which can encapsulate steam data as services and continuously and timely process stream data into value-added events. Then, we propose a declarative method which can dynamically compose stream data services. Based on two kinds of declarative rules, that is, sink-rules and connect-rules, multiple data streams can be dynamically integrated through flexible service composition. To ensure the performance of service composition, we also employ a sensor partition strategy and process multiple service compositions in parallel. Through comprehensive evaluations by experiments, our service composition method shows both good efficiency and effectiveness.
30
AbdelBaky, Moustafa, Javier Diaz-Montes y Manish Parashar. "Software-defined environments for science and engineering". International Journal of High Performance Computing Applications 32, n.º 1 (15 de junio de 2017): 104–22. http://dx.doi.org/10.1177/1094342017710706.
Texto completoResumen
Service-based access models coupled with recent advances in application deployment technologies are enabling opportunities for realizing highly customized software-defined environments that can achieve new levels of efficiencies and can support emerging dynamic and data-driven applications. However, achieving this vision requires new models that can support dynamic (and opportunistic) compositions of infrastructure services, which can adapt to evolving application needs and the state of resources. In this article, we present a programmable dynamic infrastructure service composition approach that uses software-defined environment concepts to control the composition process. The resulting software-defined infrastructure service composition adapts to meet objectives and constraints set by the users, applications, and/or resource providers. We present and compare two different approaches for programming resources and controlling the service composition, one that is based on a rule engine and another that leverages a constraint programming model for resource description. We present the design and prototype implementation of such software-defined service composition and demonstrate its operation through a use case where multiple views of heterogeneous, geographically distributed services are aggregated on demand based on user and resource provider specifications. The resulting compositions are used to run different bioinformatics workloads, which are encapsulated inside Docker containers. Each view independently adapts to various constraints and events that are imposed on the system while minimizing the workload completion time.
31
Yang, Bo y Shun Lin Song. "Web Service Automatic Composition Based on Extended Token of Petri Net". Applied Mechanics and Materials 20-23 (enero de 2010): 220–25. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.220.
Texto completoResumen
By analyzing the existing Web service composition，a automatic composition method of Web Service based on Petri net was been proposed. This paper primarily extended the Petri net’s tokens, which been expressed as the parameters of atomic services (the services can not be decomposed), as a model for Web services. Then the improved Web service composition method was used to compose the atomic services, making them flowing in the Petri net in accordance with the relationship between the composition of atomic services, and verify the correctness of the service. Finally a specific example was used to analyze and realize the service modeling and automatic composition process of Web service.
32
Costante, Elisa, Federica Paci y Nicola Zannone. "Privacy-Aware Web Service Composition and Ranking". International Journal of Web Services Research 10, n.º 3 (julio de 2013): 1–23. http://dx.doi.org/10.4018/ijwsr.2013070101.
Texto completoResumen
Service selection is a key issue in the Future Internet, where applications are built by composing services and content offered by different service providers. Most existing service selection schemas only focus on QoS properties of services such as throughput, latency and response time, or on their trust and reputation level. By contrast, the risk of privacy breaches arising from the selection of component services whose privacy policy is not compliant with customers’ privacy preferences is largely ignored. In this paper, the authors propose a novel privacy-preserving Web service composition and selection approach which (i) makes it possible to verify the compliance between users’ privacy requirements and providers’ privacy policies and (ii) ranks the composite Web services with respect to the privacy level they offer. The authors illustrate their approach using an eCommerce Web service as an example of service composition. Moreover, the authors present a possible Java-based implementation of the proposed approach and present an extension to WS-Policy standard to specify privacy related assertions.
33
Wen, Shiting, Jinqiu Yang, Genlang Chen, Jianwen Tao, Xinjie Yu y An Liu. "Enhancing Service Composition by Discovering Cloud Services Community". IEEE Access 7 (2019): 32472–81. http://dx.doi.org/10.1109/access.2019.2903825.
Texto completo
34
Cai, Huihui y Lizhen Cui. "MultiGranular: An effective Service Composition Infrastructure for Multi-tenant Service Composition". International Journal of Multimedia and Ubiquitous Engineering 9, n.º 6 (30 de junio de 2014): 171–82. http://dx.doi.org/10.14257/ijmue.2014.9.6.17.
Texto completo
35
Xing, H. Q. y D. Y. Hou. "SEMANTIC CONTEXT-BASED ON-DEMAND SERVICE MODEL FOR LAND COVER CHANGE DETECTION". ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XLII-4/W20 (15 de noviembre de 2019): 97–100. http://dx.doi.org/10.5194/isprs-archives-xlii-4-w20-97-2019.
Texto completoResumen
Abstract. Land cover change (LCC) detection is widely used in many social-benefit areas, such as land cover updating, sustainable development and geographical situation monitoring. With the development of Web Services and cloud computing, a number of remote sensed algorithms and models have been published as web services. An on-demand service is urgent to be generated by compositing a sequence of atomic services, according to different situations. Context information plays an important role in automatic service composition. Traditional context information models mainly focus on service only, and ignore the relationships among users and services. To address this problem, we introduce the service context and user context into the context information. OWL-SC and OWL-UC are then proposed by extending the traditional service description model (i.e., OWL-S). Finally, a context-aware on-demand service model for LCC detection is built to realize service composition and optimization.
36
Zhang, Baili, Kejie Wen, Jianhua Lu y Mingjun Zhong. "A Top-K QoS-Optimal Service Composition Approach Based on Service Dependency Graph". Journal of Organizational and End User Computing 33, n.º 3 (mayo de 2021): 50–68. http://dx.doi.org/10.4018/joeuc.20210501.oa4.
Texto completoResumen
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.
37
BRAVETTI, MARIO y GIANLUIGI ZAVATTARO. "A theory of contracts for strong service compliance". Mathematical Structures in Computer Science 19, n.º 3 (junio de 2009): 601–38. http://dx.doi.org/10.1017/s0960129509007658.
Texto completoResumen
We investigate, in a process algebraic setting, a new notion of correctness for service compositions, which we callstrong service compliance: composed services are strong compliant if their composition is both deadlock and livelock free (this is the traditional notion of compliance), and whenever a message can be sent to invoke a service, it is guranteed to be ready to serve the invocation. We also define a new notion of refinement, calledstrong subcontract pre-order, suitable for strong compliance: given a composition of strong compliant services, we can replace any service with any other service in subcontract relation while preserving the overall strong compliance. Finally, we present a characterisation of the strong subcontract pre-order by resorting to the theory of a (should) testing pre-order.
38
Rai, Gopal N. y G. R. Gangadharan. "Verifying compositional equivalence between web service composition graphs". Concurrency and Computation: Practice and Experience 30, n.º 16 (30 de enero de 2018): e4434. http://dx.doi.org/10.1002/cpe.4434.
Texto completo
39
AlHadid, Issam y Evon Abu-Taieh. "Web Services Composition Using Dynamic Classification and Simulated Annealing". Modern Applied Science 12, n.º 11 (29 de octubre de 2018): 376. http://dx.doi.org/10.5539/mas.v12n11p376.
Texto completoResumen
Service Oriented Architecture (SOA) introduced the web services as distributed computing components that can be independently deployed and invoked by other services or software to provide simple or complex tasks. In this paper we propose a novel approach to solve the problem of the business processes execution engine web service selection and services composition in the Service Oriented Architecture (SOA) related to the Synchronous mode. The paper provides a mechanism to improve the web services selection and service composition, using dynamic web services and service composition classification and Simulated Annealing (SA) to satisfy services' requirements expressed as the Service Level Agreement (SLA). The results show that the proposed approach enhanced the services composition by increasing the availability and decreasing the response time to the service composite.
40
AlHadid, Issam y Evon Abu-Taieh. "Web Services Composition Using Dynamic Classification and Simulated Annealing". Modern Applied Science 12, n.º 11 (29 de octubre de 2018): 395. http://dx.doi.org/10.5539/mas.v12n11p395.
Texto completoResumen
Service Oriented Architecture (SOA) introduced the web services as distributed computing components that can be independently deployed and invoked by other services or software to provide simple or complex tasks. In this paper we propose a novel approach to solve the problem of the business processes execution engine web service selection and services composition in the Service Oriented Architecture (SOA) related to the Synchronous mode. The paper provides a mechanism to improve the web services selection and service composition, using dynamic web services and service composition classification and Simulated Annealing (SA) to satisfy services' requirements expressed as the Service Level Agreement (SLA). The results show that the proposed approach enhanced the services composition by increasing the availability and decreasing the response time to the service composite.
41
Zhao, Yi Jing, Yan Yan, Guo Xin Wang, Jia Hao y Si Chen. "Semantic Based Intelligent Resource Service Composition Technology". Advanced Materials Research 591-593 (noviembre de 2012): 2456–60. http://dx.doi.org/10.4028/www.scientific.net/amr.591-593.2456.
Texto completoResumen
Intelligent resource includes the knowledge, hardware and software resources even workflow and human resource, etc. From the point of view of enterprise information management, the service composition is an essential element for companies’ informatization construction. Therefore, the paper describes a web service composition framework for semantically-annotated web service. Based on the state of art ontology technology, an OWL-S process model for the CAM software is established to describe resource service. Then a service discovery process which mainly consists of services’ property matching algorithm for words is set up. A backward chaining framework for service composition is employed to dynamically compose resource services finally.
42
Mallayya, Deivamani, Baskaran Ramachandran y Suganya Viswanathan. "An Automatic Web Service Composition Framework Using QoS-Based Web Service Ranking Algorithm". Scientific World Journal 2015 (2015): 1–14. http://dx.doi.org/10.1155/2015/207174.
Texto completoResumen
Web service has become the technology of choice for service oriented computing to meet the interoperability demands in web applications. In the Internet era, the exponential addition of web services nominates the “quality of service” as essential parameter in discriminating the web services. In this paper, a user preference based web service ranking (UPWSR) algorithm is proposed to rank web services based on user preferences and QoS aspect of the web service. When the user’s request cannot be fulfilled by a single atomic service, several existing services should be composed and delivered as a composition. The proposed framework allows the user to specify the local and global constraints for composite web services which improves flexibility. UPWSR algorithm identifies best fit services for each task in the user request and, by choosing the number of candidate services for each task, reduces the time to generate the composition plans. To tackle the problem of web service composition, QoS aware automatic web service composition (QAWSC) algorithm proposed in this paper is based on the QoS aspects of the web services and user preferences. The proposed framework allows user to provide feedback about the composite service which improves the reputation of the services.
43
Liu, An, Liu Wenyin, Liusheng Huang, Qing Li y Mingjun Xiao. "Insurance-Based Business Web Services Composition". International Journal of Organizational and Collective Intelligence 1, n.º 2 (abril de 2010): 67–82. http://dx.doi.org/10.4018/joci.2010040104.
Texto completoResumen
As more web services that implement core functions of business are delivered to customers with service charges, an open and competitive business web services market must be established. However, the qualities of these business web services are unknown without real experiences and users are unable to make decisions on service selection. To address this problem, the authors adopt insurance into business web services composition. In this paper, the authors propose three insurance models for business web services. Based on the insurance models, the authors propose an approach to compute the expected profit of composite business web services, which can be used as a criterion for business web services composition. The insurance of business web services and the criterion for business web services composition will help service competition and boost the development of more business web services and the software industry.
44
Gheisari, Mohammad Reza y Sima Emadi. "Service composition based on genetic algorithm and fuzzy rules". International Journal of Knowledge-based and Intelligent Engineering Systems 26, n.º 3 (20 de diciembre de 2022): 201–17. http://dx.doi.org/10.3233/kes-220016.
Texto completoResumen
The expansion of service-oriented architecture and the increasing number of web services has led to an increase in demand for their use. But since a single service alone may not be enough to meet the most relatively complex business processes requirements, it is necessary to combine several individual services to deliver user satisfaction. By increasing the number of services that have the same functionality, the quality of service provided by each service will play an important role in the service selection process; in the process of service composition, different services with different quality parameters come together to provide a new task. Therefore, offering the best quality service to the user is considered an important issue. The challenging issues in the service composition process include how to combine the web services with quality parameters based on user preference, long response time for the composition process, large search space, and the correlation between the services. In this paper, the quality-based service composition is modeled by considering the relationship between the services to improve the quality of service (QoS) parameters. The proposed model consists of several steps. In the first step, the inappropriate services will be pruned by applying the correlation between the services. In the second step, by determining the quality levels for the QoS, the APSO algorithm is used to select the best levels and, finally, the best services. In the service combination stage, the services selected from the previous stage are combined using a fuzzy genetic algorithm (FGA) to create a suitable combination service. The results show that when the correlation between the services is considered, the response time criterion improves significantly by integrating the quality parameters and pruning the candidate services, and reduces the search space.
45
Poola, Veeresh, Praveen Sam R y Shoba Bindu C. "Reliable Fault Tolerance System for Service Composition in Mobile Ad Hoc Network". International Journal of Electrical and Computer Engineering (IJECE) 9, n.º 4 (1 de agosto de 2019): 2523. http://dx.doi.org/10.11591/ijece.v9i4.pp2523-2533.
Texto completoResumen
<p><span lang="EN-US">A Due to the rapid development of smart processing mobile devices, Mobile applications are exploring the use of web services in MANETs to satisfy the user needs. Complex user needs are satisfied by the service composition where a complex service is created by combining one or more atomic services. Service composition has a significant challenge in MANETs due to its limited bandwidth, constrained energy sources, dynamic node movement and often suffers from node failures. These constraints increase the failure rate of service composition. To overcome these, we propose Reliable Fault Tolerant System for Service Composition in MANETs (RFTSC) which makes use of the checkpointing technique for service composition in MANETs. We propose fault policies for each fault in service composition when the faults occur. Failure of services in the service composition process is recovered locally by making use of Checkpointing system and by using discovered services which satisfies the QoS constraints. A Multi-Service Tree (MST) is proposed to recover failed services with O(1) time complexity. Simulation result shows that the proposed approach is efficient when compared to existing approaches.</span></p>
46
Zhang, Feng, Benming Chen y Cong Liu. "Web Service Instant Recommendation for Sustainable Service Mashup". Sustainability 12, n.º 20 (16 de octubre de 2020): 8563. http://dx.doi.org/10.3390/su12208563.
Texto completoResumen
Service Mashups can help users to integrate data of multiple sources based on Web services composition. Considering a kind of sustainable service Mashup whose data requirement cannot be predetermined, so users need to choose and compose services in a tentative manner. Meanwhile, users can choose and compose services continually to obtain more data based on existing composition results. In such Mashups, a Web service is chosen according to the data provided by the service. Because it is difficult for users to choose from large amounts of services manually, it is a challenge to recommend services instantly for users during the construction of a sustainable service Mashup. This paper proposes an approach to recommend Web services instantly for a sustainable service Mashup. According to the services used in the service Mashup under construction, candidate services are chosen based on the Mashups that are similar to the constructing Mashup, as well as the parameter correlations of services from the perspective of actual operations of Web service composition. Experimental results indicate that the proposed approach has better precision, recall, and coverage values compared to existing state-of-the-art approaches, and therefore, it is more suitable for instant service recommendation of sustainable service Mashups.
47
Dumez, C., M. Bakhouya, J. Gaber y M. Wack. "Model-Driven Approaches to Service Composition". International Journal of Adaptive, Resilient and Autonomic Systems 4, n.º 4 (octubre de 2013): 18–35. http://dx.doi.org/10.4018/ijaras.2013100102.
Texto completoResumen
Companies are now making their know-how and information available over the network using Web services. Business-to-Business collaboration through Web service interaction is now a necessary step to better satisfy user requests. The act of combining Web services to achieve a common goal - also known as Web service composition - is a complex issue that should be addressed. Many programming languages were developed to realize interaction between services, such as XLANG, WSFL, and BPEL. However, these languages are meant for the implementation and execution rather than providing a visual representation of the composition. In the past few years, the research community has been trying to tackle this issue by proposing model-driven approaches with the main objective to reduce development time. Some of these approaches are based on formal methods in order to describe, analyze, verify and validate the composition. In other words, applying these methods in design phase helps designers to show explicitly the behavior of Web services, to reason on the composition behavior and verify its properties. In this paper, the authors survey model-driven approaches for service composition. The focus is on surveying and classifying approaches that follow model-driven engineering principles for creating high-level models rather than programming concepts.
48
Kashyap, Neeti, A. Charan Kumari y Rita Chhikara. "Service Composition in IoT using Genetic algorithm and Particle swarm optimization". Open Computer Science 10, n.º 1 (13 de marzo de 2020): 56–64. http://dx.doi.org/10.1515/comp-2020-0011.
Texto completoResumen
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.
49
Khan, Gitosree, Sabnam Sengupta y Anirban Sarkar. "Dynamic service composition in enterprise cloud bus architecture". International Journal of Web Information Systems 15, n.º 5 (2 de diciembre de 2019): 550–76. http://dx.doi.org/10.1108/ijwis-01-2019-0005.
Texto completoResumen
Purpose Service composition phenomenon based on non-scenario aspects are become the latest issues in enterprise software applications of the multi-cloud environment due to the phenomenal increase in a number of Web services. The traditional service composition patterns are hard to support the dynamic, flexible and autonomous service composition in the inter-cloud platform. To address this problem, this paper aims to describe a dynamic service composition framework (SCF) that is enriched with various structural and functional aspects of composition patterns in a cloud computing environment. The proposed methodology helps to integrate various heterogeneous cloud services dynamically to acquire an optimal and novel enterprise solution for delivering the service to the end-users automatically. Design/methodology/approach SCF and different composition patterns have been used to compose the services present in the inter-cloud architecture of the multi-agent-based system. Further, the proposed dynamic service composition algorithm is illustrated using a hybrid approach, where service are chosen according to various needs of quality of service parameters. Besides, a priority-based service scheduling algorithm is proposed that facilitates the automation of delivering cloud service optimally. Findings The proposed framework is capable of composing the heterogeneous service and facilitate the structural and functional aspects of service composition process in enterprise cloud-based applications in terms of flexibility, scalability, integrity and dynamicity of the cloud bus. The advantage of the proposed algorithm is that it helps to minimize the execution cost, processing time and get better success rate in delivering the service as per customer’s need. Originality/value The novelty of the proposed architecture coordinates cloud participants, automate service discovery pattern, reconfigure scheduled services and focus on aggregating a composite services in inter-cloud environments. Besides, the proposed framework supported several non-functional characteristics such as robustness, flexibility, dynamicity, scalability and reliability of the system.
50
Lecue, Freddy y Nikolay Mehandjiev. "Satisfying End User Constraints in Service Composition by Applying Stochastic Search Methods". International Journal of Web Services Research 7, n.º 4 (octubre de 2010): 41–63. http://dx.doi.org/10.4018/jwsr.2010100103.
Texto completoResumen
Semantic web service compositions must be aligned with requirements from the target users in terms of quality requirements. Given a set of quality requirements, one can choose to either find the optimal composition or a “good enough” composition, which satisfies these requirements. Since optimizing compositions of semantic services under quality constraints is known to be NP-hard, it is unsuitable for realistic problems within large search spaces. The authors address the issue by using the “good enough” approach, selecting the first composition that passes their quality threshold. Firstly, this paper defines quality constraints within an innovative and extensible model designed to balance semantic fit (or functional quality) with quality of service (QoS) metrics. The semantic fit criterion evaluates the quality of semantic links between the semantic descriptions of Web services parameters, while QoS focuses on non-functional criteria of services. User quality requirements are met by selecting a valid composition. To allow the use of this model with a large number of candidate services as foreseen by the strategic EC-funded project SOA4All the authors formulate the selection problem as a Constraint Satisfaction Problem and test the use of a stochastic search method.