On concurrency improvements in enterprise SOA middleware

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.

How to manage composite service rather than single service becomes a new challenge in SOA and cloud based enterprise IT environment. This paper proposes a novel scheme, E-WS-Man, extending the WS-Management standard to support management of composite services. First, we design E-WS-Man management model and system architecture. After that we discuss E-WS-Man prototype system design and implementation scheme, including Web Service resources construction, Management Middleware Layer design, and Multi-agents assisted management scheme design. After that we describe the prototype system testing experiment. With the support of multiagent technology, experimental results verify that our scheme can extend the WS-Management specification to efficiently manage heterogeneous composite Web services with a unified management interfaces. Finally, we conclude this paper and present future research direction.

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.

Business interest in blockchain technology is increasing due the potential for change that it offers. Large scale adoption in enterprise IT environments brings about a need for service management and DevOps processes for blockchain deployments. Nodes in the network may fail or be taken down for maintenance requiring visibility across hybrid, traditional, cloud enabled and cloud native deployments. Service management is necessary to ease deployment woes for those looking to install code within their own data centers on-premises or on dedicated cloud servers and further to handle the life cycle of the deployments that includes security patches, critical updates, upgrades, change management and restarting services. In this paper, we provide a mechanism to optimally perform such operations with no disruption to the consensus and transactions for such emerging blockchain applications.

Efforts to reduce the cost of ownership for enterprise IT environments are spurring the development and deployment of data-driven management tools. Yet, IT data is imperfect and these imperfections can lead to inappropriate decisions that have significant technical and business consequences. In this paper, we begin by raising awareness of this problem through examples of the imperfections that occur, and a discussion of their causes and implications on IT management tasks. We then introduce a systematic approach for addressing such imperfections. Our approach allows best practices to be readily shared, simplifies the construction of IT data assurance solutions, and allows context-specific corrections to be applied until the root cause(s) of the imperfections can be fixed. To demonstrate the value of our solution, we describe a capacity planning use case. Application of our solution to an ongoing capacity planning effort reduced the (human) planner's time requirements by ≈3x to ≈6 hours, while enabling him to evaluate the data quality of ≈5x more applications and for 9 imperfection types rather than 1.

Auditing Linux systems for a secure enterprise IT environment

Enterprise IT environments have seen a sharp growth in content use due to the popularity of on-demand data-intensive applications. In turn, the huge demand in content has spawned off major developments such as growth and distribution of computing nodes as well as the adoption of various implementation technologies. Given the complexity brought to the makeup of business computing environments in addressing the above-mentioned factors, the critical planning task of determining the appropriate infrastructure sizes for supporting firm Quality of Service (QoS) guarantees becomes a very challenging undertaking to fulfil. Benchmarking methods are widely employed in calibrating attainable performance in IT solutions, but these have the drawback of presenting output performance metrics as composite measurements that only give an end-to-end perspective. As an enhancement to benchmarking approaches, we explore the use of Performance Monitoring Counters (PMCs) in obtaining detailed operational performance of CPU and memory hardware. Performance Monitoring Counters (PMCs) are onchip registers found on most modern processor hardware. We use PMC-derived measurements to validate cache performance trends that have been derived analytically, and in the course of validations, PMC data is also used to investigate the nature and character of surges in cache miss events, which emerge as the memory load generated by runtime processes increases.

IT compliance is an area of increasing attention and capital spend in enterprise IT environments. Enforcing compliance is a complex process, which involves following regulatory requirements coming from many, often overlapping sources, and mapping those requirements against a controls framework that implements them on the ground. In this paper, we propose a solution for streamlining the process of analyzing, monitoring and enforcing compliance in the cloud. We rely on text classification methodologies to match both regulatory requirements and controls against a common hierarchy. Finally, we explain how to use the text classification techniques to analyze the regulatory requirements, and match them to executable code that enforces these requirements in the cloud infrastructure components, such as in virtual machines and containers.

Windows operating systems are often the primary targets of malware and ransomware attacks. with 93 % of the ransomware targeting Windows-based systems, there is an urgent need for advanced defensive mechanisms to detect, analyze, and mitigate threats effectively. This paper proposes HoneyWin a high-interaction Windows honeypot that mimics an enterprise IT environment. The HoneyWin consists of three Windows 11 endpoints and an enterprise-grade gateway provisioned with comprehensive network traffic capturing, host-based logging, deceptive tokens, endpoint security and real-time alerts capabilities. The HoneyWin has been deployed live in the wild for 34 days and receives more than 5.79 million unsolicited connections, 1.24 million login attempts, 5 and 354 successful logins via remote desktop protocol (RDP) and secure shell (SSH). The adversary interacted with the deceptive token in one of the RDP sessions and exploited the public-facing endpoint to initiate the Simple Mail Transfer Protocol (SMTP) brute-force bot attack via SSH sessions. The adversary successfully harvested <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\text{1, 2 5 0}$</tex> SMTP credentials after attempting 151,179 credentials during the attack.

With the development of high-speed backbone network, more and more traffic load is pushed to the Internet end system. The satisfactory execution of common business applications depends on the efficient performance of web server. In this paper, we propose a pipeline multi-thread kernel web server open KETA which divides the processing of a request into several independent phases. This architecture reduces parallelism granularity and achieves inner-request parallelism to enhance its processing capability. Furthermore, a thread allocation model is used to manage threads effectively in this special architecture. This model can adjust the thread allocation based on the server load and the work character of each phase so that the thread resource of web server can be utilized properly. Experimental result shows the capability of this web server and the effectiveness of the thread allocation model.KeywordsQueue LengthData CacheManage BufferTask ListHelper ThreadThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Recent technologies including Web services, business process modeling tools, and grid computing, are key to facilitating business agility. Web services standardize application interfaces to ease inter-application communication, and facilitate standards based business process management. Grid computing provides a way for virtualizing heterogeneous resources to collectively yield a computationally powerful IT environment with tremendous promise in improving utilization levels of individual IT resources. By leveraging Web services, a standards based grid is being envisaged in the OGSA model. In this paper, we explore the complementarities of Web services and business process management (BPM) technologies. We also lay the foundation for using Web services based BPM in solving orchestration and workflow issues in grid computing.

The article describes a method for developing and modelling composite web-services. Web-service composition is used to derive new functionality from the interaction of existing web-services. Composite web-services are built in several stages: specifications (determining the type of service); development of the structure of the service based on the algebra of services; service composition modelling; selecting a service variant and generating a service. The main elements of the proposed approach are the algebra of services and web-services interaction models (basic and composite). The above approach formally presents the consideration of the main aspects in solving problems related to the construction of effective composite web-services and the selection of mathematical models, namely: description of web-services, determining the structure of web-services, taking into account the dynamics of information changes, taking into account the main uncertainties in building the structure web-services. Based on the approach, a method for constructing composite web-services has been developed. The method is based on an algebraic description of a web-service based on a specialized algebra of services. The method consists of the following steps: description of the task of developing a web-service; development of the structure of a web service based on the algebra of services; formal description of the structure and clarification of service operations; building models of functioning and interaction of service components; building simulation models of the composite service; defining the final structure of the composite service; web-service implementation. The main tool for describing composite services is the algebra of services, and the model building tool is colouredPetri nets implemented using СPN Tools. As an example of the application of the developed method, the construction of a pharmaceutical service is described, in which the modellingof the interaction of web-services based on Petri nets is used. The process of building a composite model of a web-service is considered. The process begins with building a pharmaceutical web-service model structure based on the service algebra. Based on the service algebra, operators were developed to implement composite services. The structure of the model is developed, which is presented in the form of a formal description. The process of building pharmaceutical service models in the СPN Tools environment is described in detail.

Virtual enterprise is a temporary network of independent companies or enterprises that can quickly bring together to fulfill a value-added task. With the development of Web service technologies, the enterprise business systems can be encapsulated as Web services. Establishing a virtual enterprise is actually a process of Web services composition. As more and more Web services are available, many Web services with different quality of service (QoS) can be found for tasks of the composite Web service. Thus, a significant research problem in Web service composition is how to select the correct Web services for tasks such that the composite Web service gives the best overall quality. In this paper, we propose an approach to achieve Web services selection efficiently with excellent comprehensive quality. Firstly, a comprehensive evaluation model based on generic QoS (GQoS) and domain QoS (DQoS) of composite Web service is established. Secondly, a novel optimization algorithm named culture max–min ant system (C-MMAS) is constructed to solve the problem of Web service selection based on DGQoS. Simulations show that when used in Web service selection, C-MMAS is better than ant colony optimization algorithm and MMAS in efficiency.

Aiming at the hot and difficult issues in Web services and service composition, this paper analyzes and studies the selection of Web services and service composition from the functional and non functional attributes of Web services, and mainly makes the following work and innovation. First of all, the functional attributes of Web services are studied, Web services on various service provision platforms are collected, and Web services are classified. Secondly, aiming at the shortcomings of existing Web service QoS attribute evaluation models, an improved method is proposed, which introduces a comprehensive evaluation mechanism of variable weight vector. Based on the constant weight comprehensive evaluation method, the state variable weight vector is established to dynamically adjust the attribute weights of various service QoS indicators, so as to improve the accuracy and objectivity of the Web service QoS attribute evaluation. Finally, in view of the defects and deficiencies of traditional algorithms in the selection of Web service composition, the particle swarm optimization algorithm with linearly decreasing inertia weight and learning factor is introduced, which better balances the self cognition and social learning ability of particles, and improves the search speed and global search ability of particles. And a large number of experiments are carried out to compare it with the traditional algorithm, which verifies the effectiveness and superiority of the improved particle swarm optimization algorithm.

THE Internet, along with its related technologies, has created an interconnected world in which information flows easily and tasks are processed collaboratively. To make service-oriented applications more robust, Web services must be examined from a transactional perspective. By transactional, we mean first defining the actions that guide the execution of Web services when failures arise and then the states that permit claiming the success of this execution following the handling of these failures. A variety of transactional models are reported in the database community. Some of these models can be leveraged and enhanced in response to Web services characteristics while others are not suitable for Web services due to the dynamic nature of Web services, the long-running execution scenarios that Web services take part in, and the successful execution of Web services despite other peers’ failure. Today’s service-oriented applications require advanced transactional models that guarantee integrity and continuity of business processes despite the dynamic nature of the features of the environments hosting the execution of these applications. This special section sheds light on the latest advances in the fields of Web services and transactional models in order to better address advanced research on and experience with transactional Web services. Four papers out of 19 submissions were selected for inclusion in this special section. Each submission was subject to a double-review process by at least three peer reviewers. In the first paper, entitled “Event-Based Design and Runtime Verification of Composite Service Transactional Behavior,” Gaaloul et al. propose an event-driven approach to validate the transactional behavior of Web services taking part in compositions. A composition life cycle consists of four phases, namely, design, execution, monitoring, and reengineering. The verification of this behavior throughout this life cycle is done either at design time to validate recovery mechanisms’ consistency or after runtime to detect execution deviations and repair design errors, and, therefore, formally ensure the execution reliability of Web services. In addition, this verification is based on the Event Calculus formalism, which offers a sound definition for this reliability. In the second paper, entitled “FACTS: A Framework for Fault-Tolerant Composition of Transactional Web Services,” Liu et al. note that delivering reliable compositions over unreliable Web services is challenging. To address this challenge, Liu et al. identify a set of high-level exception handling strategies and a new taxonomy of transactional Web services to devise a fault-tolerant mechanism that combines exception handling and transaction techniques. In addition, Liu et al. devise two modules, known as specification and verification, to assist service designers in constructing fault handling logic conveniently and correctly. This logic is automatically injected into WS-BPEL. In the third paper, entitled “Rule-Based Coordination of Distributed Web Service Transactions,” von Riegen et al. study the distributed transactional activity control problem in the context of service choreographies. In such a context, many participants are allowed to work together to achieve a global, common goal, and the initiator of a process is not always the one who is able to commit or cancel a transaction. Von Riegen et al. introduce a framework that allows autonomous coordination of dynamic processes. This framework extends WSBusinessActivity to strengthen the role of the coordinator. Predicate rules are developed to let participants cancel or complete a process and help the coordinators decide on the completion processes and the confirmation or cancellation of the participants’ works. In the fourth paper, entitled “TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition,” El Haddad et al. focus on the issues of selecting and composing Web services. A design-time selection algorithm is proposed in which transactional and QoS requirements are both integrated into the selection process. This algorithm is based on the notion of risk that indicates if execution outcomes can either be compensated for or not. Two risk levels of execution in a transactional system are considered: Risk 0, meaning that if the execution is successful, the obtained outcomes can be compensated for by the user, and Risk 1, meaning that the system does not guarantee successful execution, but if it achieves it, the outcomes cannot be compensated for by the user. We hope this special section inspires researchers to develop new transactional models that would guarantee service-oriented applications integrity and continuity. 30 IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 3, NO. 1, JANUARY-MARCH 2010