E-WS-Man: Extending WS-Management to support composite services management

We propose an efficient method to detect conflicts, which may occur during the execution time of composite web services, based on model checking. The proposed method does not only check whether a composite service satisfies the correctness claims specified by a service developer, but it also detects any possible conflicts from the control and data flow of a composite service at the time of service development. The proposed method divides correctness claims into four types depending on their application time: pre/post-condition, policy, and assumption. Specifically, composite services and correctness claims are modelled by OWL-S and SWRL, respectively. The proposed method automatically converts the control and data flow of an OWLS composite service and the correctness claims into Promela code and LTL formulas, which are given as the input of a SPIN model checker. Experimental results under real-world scenarios show that the proposed method detects conflicts in composite web services effectively.

The rapid growth of enterprise data and the increasing complexity of modern database systems have necessitated a shift from traditional manual database management to autonomous, AI-driven solutions. AI-driven autonomous database management systems (ADBMS) leverage machine learning, predictive analytics, and automation to optimize database performance, reduce administrative overhead, and enhance scalability in enterprise IT environments. Traditional database management approaches often suffer from inefficiencies related to query performance, indexing, workload tuning, and anomaly detection, leading to increased operational costs and performance bottlenecks. This paper explores the key components of AI-driven autonomous database management, focusing on self-tuning mechanisms, predictive query optimization, and intelligent indexing techniques. Self-tuning capabilities leverage AI to analyze workloads, optimize resource allocation, and dynamically adjust system parameters to maintain peak efficiency. Predictive query optimization utilizes deep learning algorithms to enhance query execution plans, reduce latency, and anticipate performance issues before they impact business operations. Additionally, intelligent indexing applies machine learning techniques to automate index selection, adaptation, and maintenance, ensuring optimal data retrieval and reducing query processing times. By integrating these AI-driven mechanisms, enterprises can achieve greater operational efficiency, improved database reliability, and reduced human intervention in performance tuning. The study also addresses security, compliance, and reliability concerns associated with autonomous database management, proposing best practices for AI-driven data governance. Future research directions include the integration of quantum computing for database acceleration, AI-driven anomaly detection for enhanced cybersecurity, and the application of reinforcement learning for real-time database optimization. This paper provides a strategic roadmap for enterprises looking to adopt AI-driven autonomous database solutions to drive innovation and competitive advantage.

Service composition combines a set of available Web services using control flows to create a more complex service. The service composition is a complex process which is challenging even for experienced users to discover and select appropriate service among a set of similar services. The available tools and techniques for service composition either are too complicated or require technical knowledge (such as script language). Moreover the heterogeneity in service description language and communication protocols make service composition more difficult. In our research, we propose an approach that allows non-technical users (i.e., end users) to easily compose heterogeneous Web resources with different communication protocol. The goal of this research is fulfilled on two stages: 1) identifying integrable Web resources from different Web applications and SOAP-based Web services; and 2) providing approaches to discover and compose Web resources that are capable of accomplishing user's activities. We propose a framework that assists a user to discover and compose services.

The Business Process Execution Language (BPEL) has become the standard in Web service composition, so that been adopted by industries to create mission critical services. The business process reliability especially business process consistency when some services failed is critical to composite services especially involving various organizations. However, it is difficult to conduct business process reliability testing for composite services due to complex business process in service composition, remote deployed services and long time testing duration. Little research is done to test fault tolerance capabilities of composite services only from low level. This paper proposes a technique on how to test the reliability of composite service defined in BPEL from the view of business semantics with little cost using fault injection. We present an approach for reliability testing of web services by using service stubs with semantic faults instead of real services which can be placed at service provider side or service consumer side. Dislike existing studies, we focus on how to find the reliability problems associating with business process - called semantics as the problems are not pure coding error but faults related to business process. In addition, the behavior of composite services in BPEL is analyzed when there are faults in orchestrated services invoked. Finally, a case study is given to show the whole process of reliability testing for composite web service.

SOA is becoming prevalent in enterprise IT environments. As a result, component middleware are adding support for composite web services. Till recent past, most of these middleware were employed in tiered architectures. However, nature of call graphs differs in SOA. In this paper we revisit concurrency and deadlock issues that appear due to hosting SOA applications on middleware with prevalent thread allocation schemes. We propose a novel thread allocation scheme which performs an off-line analysis of web services call graphs and equips containers with essential information. At run-time, containers use this information and do not consult any central point or each other for thread allocation decisions. This makes our approach practical and scalable. We demonstrate, through simulations, that our approach can provide significant throughput improvements when compared with traditional thread allocation schemes.

Managing Service Level Agreement (SLA) for composite semantic web services is a very complex process, as it involves many complex tasks such as components discovery, provisioning, monitoring, recovery, and coordination. Indeed, managing all these tasks manually is a very cumbersome operation, nevertheless it is time consuming and prone to errors. To overcome such problems, automated SLA management for composite semantic web services is needed. This requires the SLA of the composite service to be described in a machine-understandable format such that it can be understood and processed by the automated SLA management tool. Currently, there is no SLA description language for composite semantic web services, but there exists an SLA description language for atomic web services, known as the Web Service Level Agreement (WSLA). Hence, in this paper, we aim to extend the WSLA language to describe composite semantic web services' SLAs, then we show how we can automatically generate the components' SLAs from the composite semantic web services' SLAs; adopting the CRECENT framework that we previously proposed for managing composite web services.

The exponential growth of cloud computing and hybrid enterprise IT infrastructures has significantly transformed how organizations store, process, and transmit data. As reliance on distributed systems deepens, ensuring the confidentiality, integrity, and availability of sensitive information has become a paramount concern especially in the face of emerging quantum computing capabilities. Quantum computers, once fully realized, will render many current public-key cryptographic systems such as RSA, ECC, and DH obsolete due to their vulnerability to quantum algorithms like Shor’s and Grover’s. This looming threat demands a paradigm shift toward quantum-resistant cryptographic protocols that can safeguard digital assets across dynamic and heterogeneous environments. This study presents a comprehensive analysis of quantum-resistant cryptographic schemes, focusing on lattice-based, hash-based, multivariate polynomial, and code-based approaches. These protocols are critically evaluated in terms of computational efficiency, scalability, resistance to side-channel attacks, and adaptability to multi-tenant cloud architectures. Special emphasis is placed on their integration into hybrid enterprise IT ecosystems, which often comprise on-premises servers, private clouds, and public cloud services each with unique security and compliance requirements. Additionally, the research proposes a layered security model that leverages post-quantum encryption for data-at-rest, hybrid key exchange mechanisms for secure data-in-transit, and secure bootstrapping protocols for cross-domain identity verification. Through simulations and policy analysis, this work demonstrates how quantum-resilient cryptography can be effectively deployed without compromising system performance or interoperability. Ultimately, the findings aim to guide enterprises, cloud providers, and cybersecurity professionals in building forward-compatible, future-proof data protection strategies.

Service Oriented Architecture (SOA) has been widely adopted by industries due to its ability to provide increased interoperability among heterogeneous systems. SOA is realized through web services which can be either based on the style of Remote Procedure call(RPC) and SOAP protocol or on the Representational State Transfer(REST) style and HTTP. RESTful web services are increasingly becoming popular in the industry because of their simplicity, uniform interface, statelessness and cacheability benefits. The ability to efficiently select and integrate appropriate heterogeneous services available on the web dynamically at runtime is essential in the development of the applications based on web services. Whenever a single web service cannot satisfy the functionality required by the user, there should be a possibility to combine several existing services together in order to fulfill the request. This need has triggered a considerable number of research efforts on the composition of web services. Although several works have focused on the composition of SOAP based web services, there has not been adequate effort towards the composition of RESTful services. However, due to the above- mentioned advantages offered by the RESTful web services, it will be beneficial to design an application as a composition of such RESTful services. Towards this objective, this paper investigates two different approaches for composing the REStful web services specifically designed for health care domain, one using the Jopera tool and another using hypermedia.

In cloud computing, there exist several classes of web services, and each class of web service contains multiple services which have different Quality of Service (QoS) values. To provide QoS for users, determining the best service composition that meet user's preferences is necessity. Finding the best service composition needs a certain method in order to provide the best combination of QoS with minimum response time, while in some cases, the process is bounded by budget constraint provided in user's preferences. In a simple method, for selecting the best service composition, we need to evaluate nm combinations of n classes of service and m services member. This condition leads to a large computing costs and memory consumption that occur during the process of generating the combination of data. To reduce the number of combinations, we propose an approach for finding the best service composition of web services using skyline algorithm which can adapt different user preferences of QoS. While selecting the best composition, we also take consideration in budget as constraint by selecting the closest user's budget with the best skyline result of services. SalSa skyline algorithm have given the new alternative ways to finding the best candidates of services in each class of service in reasonable time. These happened because we only need to evaluate the smaller parts of members in each class which will need much time if the number of services is plenty. Moreover, we also presented a method to find the best composition of services which able to present the composition that meet the user's budget.

The service composition makes use of the existing services to produce a new value added service to execute the complex business process. The service discovery finds the suitable services (candidates) for the various tasks of the composition based on the functionality. The service selection in composition assigns the best candidate for each tasks of the pre-structured composition plan based on the non-functional properties. In this paper, we propose the broker based architecture for the QoS and business offer aware Web service compositions. The broker architecture facilitates the registration of a new composite service into three different registries. The broker publishes service information into the service registry and QoS into the QoS registry. The business offers of the composite Web service are published into a separate repository called business offer (BO) registry. The broker employs the mechanism for the optimal assignment of the Web services to the individual tasks of the composition. The assignment is based on the composite service providers’s (CSP) variety of requirements defined on the QoS and business offers. The broker also computes the QoS of resulting composition and provides the useful information for the CSP to publish thier business offers.

The popularity of web services has largely influenced the way in which enterprise business is conducted. Since web services enable easy accessibility of data, dynamic connections, and relatively less human interventions, ensuring confidentiality and integrity of data that is transmitted via web services protocols becomes more significant. If a single service does not fulfill the service consumer requirements, it is necessary to compose several web services, which together satisfy the user requirements. Security attacks occur on SOAP messages that are communicated among web services while accessing a service or during service composition. Most of the existing works on web services security have provided solutions only for ensuring client authentication, confidentiality, and integrity of information in network layer and not in application layer. WS-Security and XML based web service security also provides message layer security in network layer and not in application layer. Hence, a novel approach that prevents the message alteration attack on SOAP messages and a security solution that detects and overcomes XML injection attack have been proposed in this paper. Our approach uses pluggable APIs in the service provider side and security services in the middleware side. The attacks were simulated and non-vulnerability of the proposed solutions to these attacks have been verified.

: Web Services is an emerging paradigm in which very loosely coupled software components are published, located, and invoked on the Web as parts of distributed applications. Web Services provide a new way of distributed computing where the interoperability between diverse applications is achieved through platform and language independent interfaces. The main focus of Web Services is the ability to easily combine existing components to create compositions that provide novel functionality that was not directly available from the existing services. Web Services composition is useful for a wide range of audience: ordinary users doing everyday tasks on the Web, commercial organizations involved in e-business applications, and researchers doing intense scientific computation over distributed networks. Automated composition of Web Services requires fairly rich machine-understandable descriptions of services that can be shared between heterogeneous agents. Given appropriate descriptions, AI planning techniques can be employed to automate the composition of Web Services described this way. The purpose of this research is to show that AI planning techniques can be extended to automatically generate useful and purposeful compositions of Web Services under incomplete information. We have worked on how Web Ontology Language (WOL) can be used to describe Web Services. We have also studied how planning techniques can be used for automated composition of Web Services. In both systems, reasoning with Web Ontologies has been used to facilitate the composition task. Our goal is to investigate how these approaches can be combined with each other and can be extended to efficiently address the issues related to the nature of the Web.

With the increasing presence of web services on the Internet, Quality of Service (QoS) is becoming important for describing non-functional characteristics of web services, and is often employed in web service composition. As QoS is an aggregated concept consisting of several attributes, service composition on enormous candidate sets is a challenging multi-objective optimization problem. In this paper, we study the problem from a general Pareto-optimal angle, seeking to reduce the search space in service composition. QoS attributes are systematically studied according to their different types of aggregation pattern in service composition, and QoS-based dominance relationships between candidates and between workflows are defined. Taking advantage of pruning candidates by dominance relationships and constraint validations at candidate level, a service composition algorithm using partial selection technique is proposed, which is able to significantly reduce the search space and achieve great performance gains. A careful analysis of the optimality of our approach is provided, and its efficacy is further validated by empirical evaluation.

As Web services become widespread, many complex applications require service composition to cope with high scalability and heterogeneity. Centralized Web service composition approaches are not sufficient as they always limit the scalability and stability of the systems. How to efficiently compose and adapt Web services under decentralized environments has become a critical issue, and important research question in Web service composition. In this paper, a stigmergic-based approach is proposed to model dynamic interactions among Web services, and handle some issues in service composition and adaptation. In the proposed approach, Web services and resources are considered as multiple agents. Stigmergic-based self-organization among agents are adopted to evolve and adapt Web service compositions. Experimental results indicate that by using this approach, service composition can be efficiently achieved, despite dealing with incomplete information and dynamic factors in decentralized environments.

Web Services are materialized as a major technology carried out for automated interaction between distributed and miscellaneous applications. It is defined as a software service that provides business solutions consumed by different service requester. It can be accessed by a standard web protocol. Service composition is the mechanism used for selecting, reusing and combining existing web services to build new web services. With immense increase in web services, quality assessment plays an essential role in the selection approach. QoS is defined as the ability to guarantee the requirements like latency, reliability, bandwidth, etc. in order to satisfy a service level agreement between an application provider and end-user. QoS based dynamic service composition leads to the upward growth of an organization that implements multiple services to provide its business solution. The proposed research work elaborates the research work on different methodologies of QoS prediction with its implications to provide a proper road map for future research on efficient service composition.