Service-oriented Architecture Research Articles

Distributed virtual selective-forwarding units and SDN-assisted edge computing for optimization of multi-party WebRTC videoconferencing

Network service providers (NSP) have growing interest in placing network intelligence and services at network edges by deploying software-defined network (SDN) and network function virtualization infrastructure. In multi-party WebRTC videoconferencing using scalable video coding, a selective forwarding unit (SFU) provides connectivity between peers with heterogeneous bandwidth and terminals. An important question is where in the network to place the SFU service in order to minimize end-to-end delay between all pairs of peers. Clearly, there is no single optimal place for a cloud SFU for all possible peer locations. We propose placing virtual SFUs at network edges leveraging NSP edge datacenters to optimize end-to-end delay and usage of overall network resources. The main advantage of the distributed edge-SFU framework is that each peer video stream travels the shortest path to reach other peers similar to mesh connection model, whereas each peer uploads a single stream to its edge-SFU avoiding the upload bottleneck. While the proposed distributed edge-SFU framework applies to both best-effort and managed service models, this paper proposes a premium managed, edge-integrated multi-party WebRTC service architecture with bandwidth and delay guarantees within access networks by SDN-assisted slicing of edge networks. The performance of the proposed distributed edge-SFU service architecture is demonstrated by means of experimental results.

A Noise Validation for Quantum Circuit Scheduling Through a Service-Oriented Architecture

Progress in the realm of quantum technologies is paving the way for a multitude of potential applications across different sectors. However, the reduced number of available quantum computers, their technical limitations, and the high demand for their use are posing some problems for developers and researchers. Mainly, users trying to execute quantum circuits on these devices are usually facing long waiting times in the task queues. In this context, this work proposes a Service-Oriented architecture to reduce waiting times and optimize quantum computer usage by scheduling the circuits from different users into combined circuits that are executed at the same time. To validate this proposal, different widely known quantum algorithms have been selected and executed in combined circuits. The obtained results are then compared with the results of executing the same algorithms in an isolated way. This allowed us to measure the impact of the use of the scheduler against quantum noise. Among the obtained results, it has been possible to verify that the noise suffered by executing a combination of circuits through the proposed scheduler does not critically affect the outcomes.

Evaluation of a New-Concept Secure File Server Solution

Ransomware attacks are becoming increasingly sophisticated, and defensive solutions must necessarily evolve. Unfortunately, automated backup management through validation—critical for data recovery after an attack—and strengthening file server protection are not sufficiently addressed in current protection strategies. To focus on this area, an architectural model has been developed that complements traditional central data storage with an additional high-level file server protection solution. However, in addition to the functional adequacy of file server protection solutions, the measurability of operational performance is also important. In order to validate and evaluate the developed ransomware-proof file server protection, a dynamic performance metric is introduced for comparability, by which the performance results measured on the tested client–server architectures are presented, together with the methodology and results of the measurements. Our results show that the investigated model does not cause any performance degradation when moving sensitive data files and their backups during operation and even shows performance improvements in some frequently used configurations. The result proves that the developed real-time approach provides a solution to this critical problem in terms of the time required to restore key data from backups and to ensure file availability and continuity of accessibility. Based on a review of the literature and available solutions, it is concluded that there is no integrated solution for implementing a similar concept in practice, and therefore, the developed model is a gap-filling in this priority area.

OMOP-on-FHIR: A FHIR Server Development to Facilitate Data Interaction with the OMOP-CDM and FHIR for PGHD.

This paper introduces the concept of the implementation of a FHIR server for bidirectional data exchange with the OMOP-CDM. Leveraging FHIR as a metamodel, the implementation aims to promote a more interconnected and patient-centric healthcare ecosystem. The methodology involves utilizing the Java HAPI FHIR API for server architecture and validating the solution through patient data exchange with a FHIR reference implementation server. This initiative signifies a significant advancement in healthcare data interoperability, promising improved patient care quality and clinical research vigor.

Fault-tolerant security-efficiency combined authentication scheme for manned-unmanned teaming

Manned-unmanned teaming (MUM-T) is an emerging network system which interconnects manned aerial vehicles (MAVs) with unmanned aerial vehicles (UAVs) to enhance mission effectiveness and reduce workloads. Like other wireless systems, MUM-T is prone to attacks from the open communication channel. Therefore, an authentication scheme is required to establish secure and trusted communication between the MAV and the UAV. However, existing schemes fail to provide adequate security features and necessary efficiency, mostly due to their incomprehensive threat modeling and improper use of authentication techniques. Moreover, traditional centralized architecture of the authentication server leads to the single point of failure (SPOF) problem, which jeopardizes the robustness and scalability of MUM-T. In this paper, we propose a fault-tolerant authentication scheme for MUM-T that will solve these problems. To enhance its security, we construct a new threat model consisting of adversary's capabilities, security features, and security challenges to ensure the security of a scheme under combination attacks. To preserve the highest possible efficiency, we propose the design principle of using lightweight primitives for authentication and applying public key operations in key establishment. To address the SPOF problem, we employ a distributed fault-tolerant mechanism to share registration information within authentication servers and defend against faulty nodes. As is demonstrated by the security proof and performance comparison, our scheme succeeds in improving security and reducing overall costs, which provides a better solution than existing schemes.

Software Update Methodologies for Feature-Based Product Lines: A Combined Design Approach

The automotive industry is experiencing a significant shift, transitioning from traditional hardware-centric systems to more advanced software-defined architectures. This change is enabling enhanced autonomy, connectivity, safety, and improved in-vehicle experiences. Service-oriented architecture is crucial for achieving software-defined vehicles and creating new business opportunities for original equipment manufacturers. A software update approach that is rich in variability and based on a Merkle tree approach is proposed for new vehicle architecture requirements. Given the complexity of software updates in vehicles, particularly when dealing with multiple distributed electronic control units, this software-centric approach can be optimized to handle various architectures and configurations, ensuring consistency across all platforms. In this paper, our software update approach is expanded to cover the solution space of the feature-based product line engineering, and we show how to combine our approach with product line engineering in creative and unique ways to form a software-defined vehicle modular architecture. Then, we offer insights into the design of the Merkle trees utilized in our approach, emphasizing the relationship among the software modules, with a focus on their impact on software update performance. This approach streamlines the software update process and ensures that the safety as well as the security of the vehicle are continuously maintained.

An efficient blockchain-based framework for file sharing

File sharing, being the foundation of the Internet, has traditionally relied on a centralized service architecture resulting in significant maintenance costs. Moreover, due to the lack of an effective file management system, instances of sensitive information going out of control and loss of confidentiality in file sharing have occurred frequently. In order to address the difficulty of tamper detection and the lack of supervision in the entire process of file transfer in the current Internet environment, this paper designs a blockchain-based system architecture for secure sharing of electronic documents. An efficient blockchain model is used in our framework, and with the help of distributed storage system and asymmetric encryption technology, file sharing can be controlled, reliable and traceable in the transfer process. Referring to existing consensus mechanisms, e.g., Delegated Proof of Stake (DPoS) and Practical Byzantine Fault Tolerance (PBFT), we propose a new consensus for efficient and secure file sharing. Our experimental results show that our framework can maintain a higher throughput than existing schemes

Rethinking the mobile edge for vehicular services

The growing connected car market requires mobile network operators (MNOs) to rethink their network architecture to deliver ultra-reliable low-latency communications. In response, Multi-Access Edge Computing (MEC) has emerged as a solution, enabling the deployment of computing resources at the network edge. For MNOs to tap into the potential benefits of MEC, they need to transform their networks accordingly. Consequently, the primary objective of this study is to design a realistic MEC architecture and corresponding optimal deployment strategy – deciding on the placement and configuration of computing resources – as opposed to prior studies focusing on MEC run-time management and orchestration (e.g., service placement, computation offloading, and user allocation). To cater to the heterogeneous demands of vehicular services, we propose a multi-tier MEC architecture aligned with 5G and Beyond-5G radio access network deployments. Therefore, we frame MEC deployment as an optimization problem within this architecture, assuming 3 MEC tiers. Our data-driven evaluation, grounded in realistic assumptions about network architecture, usage, latency, and cost models, relies on datasets from a major MNO in the UK. We show the benefits of adopting a 3-tier MEC architecture over single-tier (centralized or distributed) architectures for heterogeneous vehicular services, in terms of deployment cost, energy consumption, and robustness.

A scoping review of rule-based clinical decision support malfunctions.

Conduct a scoping review of research studies that describe rule-based clinical decision support (CDS) malfunctions. In April 2022, we searched three bibliographic databases (MEDLINE, CINAHL, and Embase) for literature referencing CDS malfunctions. We coded the identified malfunctions according to an existing CDS malfunction taxonomy and added new categories for factors not already captured. We also extracted and summarized information related to the CDS system, such as architecture, data source, and data format. Twenty-eight articles met inclusion criteria, capturing 130 malfunctions. Architectures used included stand-alone systems (eg, web-based calculator), integrated systems (eg, best practices alerts), and service-oriented architectures (eg, distributed systems like SMART or CDS Hooks). No standards-based CDS malfunctions were identified. The "Cause" category of the original taxonomy includes three new types (organizational policy, hardware error, and data source) and two existing causes were expanded to include additional layers. Only 29 malfunctions (22%) described the potential impact of the malfunction on patient care. While a substantial amount of research on CDS exists, our review indicates there is a limited focus on CDS malfunctions, with even less attention on malfunctions associated with modern delivery architectures such as SMART and CDS Hooks. CDS malfunctions can and do occur across several different care delivery architectures. To account for advances in health information technology, existing taxonomies of CDS malfunctions must be continually updated. This will be especially important for service-oriented architectures, which connect several disparate systems, and are increasing in use.

Distributed service function chaining in NFV-enabled networks: A game-theoretic learning approach

In network function virtualization (NFV), Service Function Chaining (SFC) provides an ordered sequence of virtual network functions (VNFs) and subsequent steering of traffic flows through them to cater to end-to-end services. This paper addresses the NP-hard problem of minimum cost SFC deployment to support customer services that access the carrier network’s NFV infrastructure (NFVI) through some edge routers. To determine the mappings of VNFs to physical servers, a challenging aspect would be the inter-server latencies that may fluctuate over time because of the sharing nature of cloud data centers. To construct the SFC, we come up with three different formulations, each corresponding to a different informational assumption about the link latencies: First, a centralized integer linear programming (ILP) formulation is given under the assumption of the non-causal availability of exact and instantaneous inter-server latencies. The solution to this ILP can serve as a lower bound to benchmark more scalable and realistic schemes. Next, we give a distributed game-theoretic formulation (with service broker agents as players) which only requires the statistical knowledge of link latency fluctuations. The game provably admits a pure Nash equilibrium (NE) and can be solved iteratively through the well-known best response dynamics (BRD) algorithm. Our main novelty lies in the third formulation in which each service broker has neither instantaneous nor statistical knowledge of the latencies. Instead, it relies on a game-theoretic learning algorithm to compose its VNF chain only based on its own history of adopted decisions and experienced delays on each logical link. We prove that the proposed learning algorithm asymptotically converges to NE and evaluate its performance through simulations in terms of convergence and the impact of network parameters.

2FAKA-C/S: A Robust Two-Factor Authentication and Key Agreement Protocol for C/S Data Transmission in Federated Learning

As a hot technology trend, the federated learning (FL) cleverly combines data utilization and privacy protection by processing data locally on the client and only sharing model parameters with the server, embodying an efficient and secure collaborative learning model between clients and aggregated Servers. During the process of uploading parameters in FL models, there is susceptibility to unauthorized access threats, which can result in training data leakage. To ensure data security during transmission, the Authentication and Key Agreement (AKA) protocols are proposed to authenticate legitimate users and safeguard training data. However, existing AKA protocols for client–server (C/S) architecture show security deficiencies, such as lack of user anonymity and susceptibility to password guessing attacks. In this paper, we propose a robust 2FAKA-C/S protocol based on ECC and Hash-chain technology. Our security analysis shows that the proposed protocol ensures the session keys are semantically secure and can effectively resist various attacks. The performance analysis indicates that the proposed protocol achieves a total running time of 62.644 ms and requires only 800 bits of communication overhead, showing superior computational efficiency and lower communication costs compared to existing protocols. In conclusion, the proposed protocol securely protects the training parameters in a federated learning environment and provides a reliable guarantee for data transmission.

Verifiable and hybrid attribute-based proxy re-encryption for flexible data sharing in cloud storage

Cloud computing is a promising service architecture that enables a data owner to share data in an economic and efficient manner. To ensure data privacy, a data owner will generate the ciphertext of the data before outsourcing. Attribute-based encryption (ABE) provides an elegant solution for a data owner to enforce fine-grained access control on the data to be outsourced. However, ABE cannot support ciphertext transformation when needing to share the underlying data with a public-key infrastructure (PKI) user further. In addition, an untrusted cloud server may return random ciphertexts to the PKI user to save expensive computational costs of ciphertext transformation. To address above issues, we introduce a novel cryptographic primitive namely verifiable and hybrid attribute-based proxy re-encryption (VHABPRE). VHABPRE provides a transformation mechanism that re-encrypts an ABE ciphertext to a PKI-based public key encryption (PKE) ciphertext such that the PKI user can access the underlying data, meanwhile this PKI user can ensure the validity of the transformed ciphertext. By leveraging a key blinding technique and computing the commitment of the data, we construct two VHABPRE schemes to achieve flexible data sharing. We give formal security proofs and comprehensive performance evaluation to show the security and efficiency of the VHABPRE schemes.

A Semantic Digital Twin for the Dynamic Scheduling of Industry 4.0-based Production of Precast Concrete Elements

Precast concrete construction enhances project efficiency, sustainability, and durability by leveraging a controlled production environment that ensures high-quality outputs. Still, the sequential nature of off-site production, encompassing casting, curing, and storage of the precast elements, is subject to significant uncertainties, including supply chain variability and environmental factors affecting curing times. Dynamic adjustments to the production schedule are essential for aligning with real-time changes, necessitating a robust framework for real-time data acquisition and analysis. Dynamic Scheduling (DS) is a responsive and adaptive approach that accommodates real-time changes, optimizes the production flow, and minimizes downtime or delays. However, the DS approach demands real-time data to quickly and efficiently respond to unforeseen challenges, which requires acquiring and analyzing production-relevant data throughout the production process. The Digital Twin (DT) emerges in Industry 4.0 (I4.0) as a bridge between physical operations and digital capabilities, enabling a seamless flow of information, for which the Asset Administration Shell (AAS) is a reference implementation. This study introduces a DS framework to optimize precast element production, utilizing a DT for real-time data aggregation across the production system. The framework implements a Semantic DT based on the AAS and the Linked Data approach. It employs Resource Description Framework (RDF) serialization of the AAS and an ontological representation of the production system for data integration. The framework leverages a simulation-based scheduler, which exchanges data with the DT in a Service-oriented Architecture (SoA) using SPARQL, a language for querying and updating graph databases. The approach is evaluated through a proof of concept, demonstrating effective uncertainty management in a dynamic production environment.

Ontological description method for building service-oriented distributed learning systems

The subject of the research is the analysis and justification of the use of software engineering processes based on ontologies of data access and representation of access to knowledge bases and knowledge reuse in the language of algebra of finite predicates, which is a class of descriptive logics. This approach allows you to use the advantages of ontologies and logic programming in the refactoring of distributed distance learning systems. The purpose of the work is to create a formalism for describing the interaction of services and algorithms for building web service interfaces for the implementation of an effective SOA system using the paradigm of access to data based on ontologies. To achieve the goal, the following tasks were solved: an analysis of the main types of interaction structures of SOA services, an overview of implementations of systems working with a family of descriptive logic languages, namely, algebra of finite predicates, and a description of the structure of the ontology necessary for the operation of service-oriented systems, which has the markup of the Semantic Web standard using finite predicate algebra equations. The task is an urgent task of ensuring the organization of interaction of Internet resources in the development of distributed virtual learning systems, and such interaction is enabled by the service-oriented architecture of software development. The article examines modern technologies of the Semantic Web and their role in ensuring the creation of applied software systems of distributed learning resources built using distributed interactive services. The considered methods and materials include methods of algebra of finite predicates, theory of algorithms, object-oriented design, theory of unification. The results. The semantics of the SOA system is obtained, which makes it possible to describe SOA systems in the languages of descriptive logic. The effectiveness of the mathematical formalism of the algebra of finite predicates for the tasks of logical analysis of applied ontologies, the use of knowledge reuse methods, and the description of service-oriented systems is shown. The necessity of using algorithms for automatic construction of web interfaces is shown. The conclusions of the work highlight the advantages of the researched solution, namely, algorithms for the automated construction of web service interfaces for SOA architecture, which make it possible to automatically build web service interfaces. Algorithms differ in a more general model and speed of work and require an assessment of complexity.

COMPARISON OF MESSAGE PASSING SYSTEMS IN CONTEXT OF ADAPTIVE LOGGING METHOD

Computer software is an important part of technological progress. As it becomes more and more complex and sophisticated, so does the need to protect it. Apart from typical information security aspects of integrity, availability and confidentiality, the scale and complexity of modern computer systems require a high level of control and observability. The main goal of this research is to build upon the foundations laid by the general idea of an adaptive logging method and introduce the next iteration of its design in the form of an appropriate message passing system to be used to propagate required changes to corresponding implementation in an effective and performant manner. Four different message passing system models are introduced, based on different technologies such as RabbitMQ message broker, communication channels in PostgreSQL database management system, general web server architecture and Linux-based process signaling interface. For each of those an overview description and graphical model is presented. Finally, the resulting comparison is conducted, comparing aspects such as reliance on third-party software, communication medium, error surface increase and authentication related considerations. As a result, the design based on process signaling approach is determined to be the most suitable for adaptive logging method, as it does not introduce any third-party software (and as such affects error surface in a somewhat negligible manner), binds directly to an observed application, is built using low level concepts that should be present in multiple different platforms and programming languages and should be able to reuse authentication logic that is already used when accessing computational machine where observed program is executed.

Digital Protection and Innovative Development Path of Red Culture Resources Based on Distributed Machine Learning Supported by Intelligent Information

As a product of the revolutionary war years, red culture, with its strong vitality, strong cohesion and extraordinary charm, with its incomparable positive energy, resists vulgar and flattering culture, promotes people to rebuild their faith, purify their minds, stimulate their motivation, and promote the process of cultural power. Yan’an, represented by red culture, is rich in resources. This is the holy land of Chinese revolution, the first batch of famous historical and cultural cities named by the State Council, and the three major education bases of patriotism, revolutionary tradition, and Yan’an spirit. The development and utilization of such resources have great political, cultural, educational and economic values. This research is based on the development of red culture, and uses the distributed machine learning system to realize in the system architecture of parameter server. In the distributed system set in this study, node downtime and network interruption are random. When the parameter server system adopts static scheduling, it leads to poor scalability and robustness. The experimental results show that under the intelligent simulation of machine learning system, the development of red culture resources meets the expected assumptions, and the accuracy of the model is relatively high.

부동산 중개업 조직 구성에 관한 연구

The domestic real estate market and brokerage market are gradually weakening their competitiveness due to the market structure centered on individuals and small businesses. Accordingly, in order to actively respond to changes in domestic and foreign conditions, expand services in the brokerage industry, and strengthen the competitiveness of the brokerage industry, the government is inducing the incorporation and enlargement of the real estate brokerage industry. In this study, it was revealed that incorporation and enlargement cannot be a solution to the organization of licensed real estate agents to promote the professionalism of brokers and improve brokerage services to the public while overcoming the smallness of private licensed real estate agents, and derived brokerage cooperatives as an alternative as a practical alternative. Currently, the legal conflicts between the “Licensed Real Estate Agents Act” and the “Framework Act on Cooperatives” can be resolved through the revision of the “Licensed Real Estate Agents Act”. In addition, under the current legal system, it is necessary to operate a cooperative focusing on supporting the brokerage business, such as strengthening the capabilities of “Licensed Real Estate Agents Act”, under the current legal system, which is one of the best ways to organize and operate immediately.

Architecture of a recommendation service for choosing training areas at a higher education institution by applicants with the method of collaborative filtering of machine learning

Architecture of a recommendation service for choosing training areas at a higher education institution by applicants with the method of collaborative filtering of machine learning

Социальный маркетинг искусственной экосистемы: теоретический аспект

The article analyzes the main structural components of the "social marketing" definition, and formulates the author's vision of this definition. It is determined that social marketing uses marketing and communication strategies and methods to solve social problems. It has been revealed that an artificial ecosystem is an environment where artificial intelligence, data analytics and process automation combine to ensure effective interaction between companies, consumers and the state. Social marketing in this context is aimed at creating a positive impact on society, forming sustainable relationships and supporting values that contribute to the prosperity of society. The functions of social marketing with their own characteristics that help marketers effectively carry out their work and achieve social changes and improvements are highlighted and described. It is highlighted that social marketing is the main component in the process of social services' effective provision, on the basis of which the social services architecture was created.

HSC Honest Broker Service, Applying the Health Data Research UK Transparency Guidelines in Northern Ireland

HSC Honest Broker Service, Applying the Health Data Research UK Transparency Guidelines in Northern Ireland