Cross-domain Service Research Articles

Optimizing Key Value Indicators in Intent-Based Networks through Digital Twins aided service orchestration mechanisms

For many years, the orchestration of network resources and services has been addressed by considering homogeneous communication infrastructures and simple Service Level Agreements (SLAs), generally defined through a list of traditional Key Performance Indicators (KPIs). Unfortunately, state-of-the-art solutions risk being quite ineffective for future telecommunication systems. Beyond 5G networks, for instance, are emerging as complex and heterogeneous ecosystems where resources belonging to diverse network domains with evolving capabilities can be dynamically exposed to support much more complex and cross-domain services and applications. At the same time, SLAs will be defined by also considering novel performance demands, including security, economic, and environmental needs. Based on these premises, this work proposes a novel orchestration strategy designed to fulfill service requirements expressed through Key Value Indicators (KVIs), while combining the potentials of both Network Digital Twins and Intent-Based Networking. Leveraging insights from Network Digital Twins, multiple service orchestration options are explored to optimize resource utilization. Simultaneously, Intent-Based Networking is adopted to streamline network management via intents, specifying Beyond 5G requirements through KPIs and KVIs. An optimal orchestration scheme has been conceived through a multi-criteria decision-making algorithm and a many-to-many matching game between domains and service requests mapped into intents, aiming to minimize SLA violations over time. The performance of the conceived solution has been investigated through computer simulations in realistic scenarios. The obtained results clearly highlight its effectiveness and demonstrate that it is able to reduce SLA violations (related to latency, throughput, costs, and cyber risk requirements) by up to 22.44% compared to other baseline techniques.

A secure cross-domain authentication scheme based on threshold signature for MEC

The widespread adoption of fifth-generation mobile networks has spurred the rapid advancement of mobile edge computing (MEC). By decentralizing computing and storage resources to the network edge, MEC significantly enhances real-time data access services and enables efficient processing of large-scale dynamic data on resource-limited devices. However, MEC faces considerable security challenges, particularly in cross-domain service environments, where every device poses a potential security threat. To address this issue, this paper proposes a secure cross-domain authentication scheme based on a threshold signature tailored to MEC’s multi-subdomain nature. The proposed scheme employs a (t,n) threshold mechanism to bolster system resilience and security, catering to large-scale, dynamic, and decentralized MEC scenarios. Additionally, the proposed scheme features an efficient authorization update function that facilitates the revocation of malicious nodes. Security analysis confirmed that the proposed scheme satisfies unforgeability, collusion resistance, non-repudiation and forward security. Theoretical evaluation and experimental simulation verify the effectiveness and feasibility of the proposed scheme. Compared with existing schemes, the proposed scheme has higher computational performance while implementing secure authorization updates.

Automated Data Transfer From ADAS to Android-Based IVI Domain Over SOME/IP

Automotive systems are complex and comprise of numerous components, which are developed simultaneously by different companies, rely on different technologies, and have different requirements in terms of safety and user experience. This leads to the multiple implementations of the similar functionalities within different domains of the vehicle, and the redundancy of hardware resources. Having separate domains communicating with each other would certainly lower the cost of the vehicle hardware and facilitate software development. Nevertheless, establishing inter-domain connectivity is not a trivial solution, and requires determining the suitable communication protocol, as well as the consideration of the use-case variety, specialized domain knowledge of automotive developers, platforms and software standards heterogeneity, safety and security issues, etc. This article presents a verified automated solution for data exchange between Advanced Driver Assistance System (ADAS) and In-Vehicle Infotainment (IVI) domains over SOME/IP. The backbone of the generated solution uses the most common interface definition languages for specific domains - ARXML, FIDL and AIDL, and enables the translation between those languages, as well as the generation of the required cross-domain services and clients, while supporting various architectural aspects and different software platforms.

Cross-Domain Service Function Chain Routing: Multiagent Reinforcement Learning Approaches

The service function chain (SFC) routing has been increasingly associated with multi-domain networks. However, several multi-domain SFC routing issues, linked to cross-domain interactions and emphasized by the heterogeneity of substrate topologies and administrative authorities, present a challenge. We propose the Cooperative Multi-agent Reinforcement Learning (CMRL) based algorithm for multi-domain SFC routing problem. Simulations on the real-world network topology demonstrate that our proposal can provide more than two and four times reduction in terms of the run time and network resource cost, respectively.

Cross-Domain Resource Allocation Scheme with Unified Control Architecture in Software Defined Optical Access Network

With the rapid development of communication and the rise of new network services, the resource provisioning of the optical access network becomes more significant than before, especially under the multiple-domain networking situation with the requirement of cross-domain service support. For the sake of high resource utilization to establish more connections of services, this paper proposes a cross-domain resource allocation (CDRA) scheme in a software-defined optical access network to meet the huge bandwidth supporting the requirement of new network services. To achieve this purpose, the global evaluation strategy with the consideration of the traffic situation in each node in its domain is presented in the CDRA scheme, and its interaction process makes decisions for comprehensive optimal resource allocation by integrating radio resources and optical aggregation resources of the entire access network. Furthermore, to manage the resources among multiple domains and support the interaction process of the CDRA scheme, a cross-domain unified control architecture is firstly upgraded by using software-defined networking technology, which includes the further design of CDRA function modules with the global evaluation strategy. The simulation results verify the feasibility of the upgraded architecture and further show that the proposed CDRA scheme can effectively decrease the blocking probability with a 29.35% improvement, balance the network load, and enhance the utilization of network resources of the network.

Research on Cloud Printing Technology Based on LBS and Knowledge Sharing

In cloud print, this paper USES block chain as the underlying technology, the implementation of large database to ensure the safety of mass data storage, and based on this foundation to carry out knowledge sharing service, easy to play article includes more than five thousand specialization vocabulary and its derivative data table, auxiliary ai machine training, in order to provide the knowledge in knowledge sharing service type map search, Expand the search range and precision by plane search, and build intelligent large screen. Cross-domain services result in a 40% conversion rate and a 4 times gross profit margin.

Research on Service Value Chain Model Based on Technology Service Platform

For the technology service platform, serving users with science and technology resources is the purpose of platform construction, and the quality of the service value chain affects the operation of the technology service platform. Aiming at the immature status of the research on the service value chain model of the technology service platform, this paper proposes a set of construction ideas based on the service value chain model of the technology service platform. The model takes the technology service platform as the central node, and at the same time integrates users, third-party technology service platforms, service resource providers in various fields and other participant nodes, and links the interests of all parties through a dynamic chain with value flow as the core. Each participant node cooperates with each other to form a complex, cross-domain service value chain model. In order to ensure the service quality of the platform, a feedback mechanism that reflects the attitude of users using scientific and technological service resources is introduced into the service value chain model. By taking the manufacturing of vertical elevators as an example, the operation of the service value chain is simulated, and the usability of the service value chain model is verified.

A Cross-Domain Service Function Chain Deployment Scheme Based on Bargaining Game

Software-defined networking (SDN) and network function virtualization (NFV) technologies provide support for service function chain (SFC) deployment. As the scale of a network expands, SDN domains are maintained and managed by their respective network operators. When deploying an SFC in multiple domains, to protect the privacy of each domain is challenging. We propose a cross-domain SFC deployment scheme based on a bargaining game. We establish an effective cross-domain service chain system model and combine resource consumption cost and load balance to translate SFC deployment to an optimization problem. A bargaining game model is established so as to reasonably optimize these contradictory parameters. We solve the model by an improved imperialist competition algorithm and obtain the optimal node mapping relationship. Experimental results show that our method performs better than the current one in terms of network load balancing and mapping overhead and has better scalability.

On cross-domain Service Function Chain orchestration: An architectural framework

Service Function Chaining (SFC) has gained momentum as one of the building blocks of the 5G ecosystem. Indeed, SFC combined with other promising technologies such as Software Defined Networking (SDN) as well as Network Slicing form the basis for enabling the 5G network services and fulfilling their requirements. Many contributions have been made to support and enforce SFC, from chain composition to its deployment and life-cycle management. However, few research works study SFC orchestration, and even fewer consider the multi-domain context, which remains an open issue with many challenges that need to be tackled in order to provide end-to-end services. In this paper, we contribute to filling this gap by introducing a novel architecture for orchestrating and enforcing multi-domain SFCs. The proposed architecture leverages on the ETSI MANO standard, as well as SDN and the hierarchical SFC principles, and is agnostic to the packet forwarding technology used by each administrative domain. We also implement a Proof of Concept (PoC) that employs different SFC encapsulation types to evaluate the architecture, where the obtained results prove our architecture’s efficiency, we are also able to draw conclusions related to the encapsulation methods to implement. Finally, we discuss open research issues.

크로스 도메인 서비스를 위한 신뢰 관리 시스템 개발

ICT 기술의 발달로 다양한 장치와 서비스 활용이 보편화 되면서, 사용자를 중심으로 이러한 다양한 서비스 환경을 연결하여 새로운 가치를 제공하는 크로스 도메인 서비스가 대두되고 있다. 하지만 다양한 구성요소의 융합을 기반으로 하는 특성상, 통합적인 신뢰 관리가 요구된다. 따라서 본 논문은 크로스 도메인 서비스를 위한 신뢰 관리 시스템을 제안한다. 제안하는 시스템은 온톨로지 기반의 메타데이터 모델을 통해 서비스 구성요소의 정보를 수집하고 관계를 정의하여 신뢰측정, 신뢰기반 자원탐색, 사용성 제어를 제공한다. 또한 신뢰관리 라이브러리와 관리 시스템 사용자 인터페이스를 구현하여 서비스 신뢰관리를 보다 쉽게 할 수 있도록 한다. 성능분석 결과 제안하는 시스템은 18.3ms의 쓰기지연, 7.6ms의 읽기지연을 보여 실시간 서비스에 활용될 수 있을 것이다.

Simulating services from power-to-heat components in integrated energy systems

The integration of thermal and electrical systems offers potential for exchanging system services. Studies of integrated energy systems typically represent the system quasi-statically, and use implicit control schemes, e.g. through optimisation formulations. However, properly characterising services offered between these systems and their cross-domain impact, requires both modelling these systems at time-scales congruent with operation, and explicitly modelling their control flow. By modelling both domain- and control systems explicitly, we show how a co-simulation tool-chain allows examining the impact of flexibility provision in one domain on another, as well as evaluating cross-domain control strategies. We further examine the impact time resolution has on the perceived benefit of cross-domain service provision, specifically whether quasi-static studies lead to systematic over- or under-estimation of the benefits from cross-domain integration.

GDM: A General Distributed Method for Cross-Domain Service Function Chain Embedding

Emerging technologies such as network function virtualization (NFV) and software defined networking (SDN) provide a promising way to implement service function chain (SFC), a chain-ordered set of network functions, to support heterogeneous network services through a shared substrate network. A major challenge in this respect is the SFC embedding with respect to constraints of physical resources. Furthermore, for practical purposes, SFC embedding across multiple domains becomes essential. This challenge is referred to as the cross-domain SFC embedding problem, which is intractable due to various reasons, such as the confidentiality of intra-domain information and the domain's local autonomy. In this paper, we propose GDM, a general distributed method for cross-domain SFC embedding. Besides preserving the privacy and autonomy of domains, GDM guarantees fair competition among domains while balancing loads among domains. It first partitions SFC by utilizing an algorithm that can be instantiated to support different embedding goals. Then it allows domains to embed their assigned segments following their policies. Finally, to improve the capability of the whole substrate network to accommodate more SFCs, it implements domain-level load balancing by migrating the deployed VNFs while avoiding excessive influence on the SFC embedding solution. Evaluation results demonstrate that our method performs better in improving acceptance ratio and optimizing domains' embedding goals compared to the existing methods, and it has better scalability.

BCON: Blockchain based access CONtrol across multiple conflict of interest domains

In today's on-demand computing and virtual coalition environment, cross-domain services are acquired and provided. These business domains may belong to either the same or different conflict of interest system. “Transitive access” can cause leakage of information between competitors through some other conflict of interest system's member. Therefore, a secure access control mechanism is required to detect and deny “transitive access” efficiently with minimal trust in externalist. Existing access control mechanisms focused on either single or multiple conflict of interest domains but with no “transitive access”. In addition, these existing mechanisms are centralized with inherited unfair access control and are a single point of failure. Blockchain (BC) is a shared digital ledger encompassing a list of connected blocks stored on a decentralized distributed network that is secured through cryptography. We propose a BC based access control for conflict of interest domains. We have integrated a BC in our architecture to make access control fair, verifiable and decentralized. Users access histories and “transitive accesses” are stored on BC ledger. We propose a novel mechanism called “Transitive Access Checking and Enforcement (TACE)” i.e., “Algorithm.1”. It makes an authorization decision based on BC endorsement that “transitive access” will not occur. “Algorithm.2” verifies and updates users access histories stored at BC before each request approval. Similarly, “Algorithm.3” detects possible future “transitive accesses” and updates Transitive Access Set (TAS) stored at BC after each request approval. The Simple Promela Interpreter (SPIN) model checker is used to verify the proposed mechanisms for “transitive access” detection and prevention. We have identified four conflicting sequences of execution that can cause “transitive access”. Results show that the proposed mechanism is safe against “transitive access” by checking all the four possible conflicting sequences of execution.

Secure data sharing scheme for VANETs based on edge computing

The development of information technology and the abundance of problems related to vehicular traffic have led to extensive studies on vehicular ad hoc networks (VANETs) to meet various aspects of vehicles, including safety, efficiency, management, and entertainment. In addition to the security applications provided by VANETs, vehicles can take advantage of other services and users who have subscribed to multiple services can migrate between different wireless network areas. Traditionally, roadside units (RSUs) have been used by vehicles to enjoy cross-domain services. This results in significant delays and large loads on the RSUs. To solve these problems, this paper introduces a scheme to share data among different domains. First, a few vehicles called edge computing vehicles (ECVs) are selected to act as edge computing nodes in accordance with the concept of edge computing. Next, the data to be shared are forwarded by the ECVs to the vehicle that has requested the service. This method results in low latency and load on the RSUs. Meanwhile, ciphertext-policy attribute-based encryption and elliptic curve cryptography are used to ensure the confidentiality of the information.

Knowledge empowered prominent aspect extraction from product reviews

Many existing systems for analyzing and summarizing customer reviews about products or service are based on a number of prominent review aspects. Conventionally, the prominent review aspects of a product type are determined manually. This costly approach cannot scale to large and cross-domain services such as Amazon.com, Taobao.com or Yelp.com where there are a large number of product types and new products emerge almost everyday. In this paper, we propose a novel method empowered by knowledge sources such as Probase and WordNet, for extracting the most prominent aspects of a given product type from textual reviews. The proposed method, ExtRA (Extraction of Prominent Review Aspects), (i) extracts the aspect candidates from text reviews based on a data-driven approach, (ii) builds an aspect graph utilizing the Probase to narrow the aspect space, (iii) separates the space into reasonable aspect clusters by employing a set ofproposed algorithms and finally (iv) generates K most prominent aspect terms or phrases which do not overlap semantically automatically without supervision from those aspect clusters. ExtRA extracts high-quality prominent aspects as well as aspect clusters with little semantic overlap by exploring knowledge sources. ExtRA can extract not only words but also phrases as prominent aspects. Furthermore, it is general-purpose and can be applied to almost any type of product and service. Extensive experiments show that ExtRA is effective and achieves the state-of-the-art performance on a dataset consisting of different product types.

CDAKA: A Provably-Secure Heterogeneous Cross-Domain Authenticated Key Agreement Protocol with Symptoms-Matching in TMIS.

Telecare Medical Information System (TMIS) provides the flexible and convenient e-health care. It helps the patients to gain health monitoring information and provides patients to share their experience wirelessly. Traditional authentication and key agreement (AKA) protocols in TMIS are mostly considered in same-domain environment. However, future generation network may integrate various of wireless mesh networks under various domain. What's more, patients heterogeneous cross-domain service has become an inevitable trend. However, there is still no heterogeneous cross-domain authenticated protocol between PKI-domain and IBC-domain in TMIS. In this paper, we propose a heterogeneous cross-domain AKA protocol with symptoms-matching in TMIS (short for CDAKA). It not only keeps good security features, but also truly provides patients' anonymity to protect sensitive information from illegal interception. It still provides patients in two different domains to share their experience, broaden their understanding of illness by using their mobile device freely. Besides, it can realize AKA with extremely low computing cost and communication cost. What's more, it is proved to be secure against known possible attacks under the Elliptic Curve Computable Diffie-Hellman problem (ECDHP) assumption in the random oracle model. Hence, these features make CDAKA protocol very suitable for mobile application scenarios, where resource is severely constrained and security is particularly concerned.

Low Latency Security Function Chain Embedding Across Multiple Domains

5G network is envisioned to provide massive connectivity for a wide range of applications, such as ultra-clear media, internet of vehicles, and smart home. The traditional way of providing security services is difficult to support these new 5G applications flexibly and effectively. In our previous work, we proposed a SFC-based framework that chains security functions in different domains to provide security services on demand. However, creating cross-domain service function chains will inevitably result in the additional network latency. In this paper, we study this problem of minimizing the end-to-end latency when deploying cross-domain service function chains for 5G applications. First, an exact approach, consisting of service chain partition and service subchain embedding, is proposed to derive an optimal solution for cross-domain service function chain placement. Second, we improve the Viterbi algorithm and propose an efficient heuristic approach to derive near-optimal solutions for large networks. We also compare the performance of the proposed exact approach, the proposed heuristic approach, and the simple greedy approach in different scales of network infrastructures. Simulation results are presented to demonstrate the effectiveness of the proposed approaches.

EIMAKP: Heterogeneous Cross-Domain Authenticated Key Agreement Protocols in the EIM System

In recent years, instant messaging (IM) has increasingly become a popular communication technology around the world, and the enterprise instant messaging (EIM) system is one of IM’s applications for enterprise use. The existing studies of EIM systems are directed at the design of functional components and the process of communication, which are usually based on XMPP protocol suite. However, in this paper, the security of EIM is more concerned from another perspective, which is the problem of identity authentication and key agreement between users and services. Several EIM systems are based on public key infrastructure (PKI) to achieve the high-security requirements of enterprises, while identity-based cryptography (IBC) brings new development direction for EIM systems. Although most of the EIM applications are applied independently in different enterprises, users’ heterogeneous cross-domain service access has become an inevitable trend. However, there is still no heterogeneous cross-domain authentication protocol between the PKI domain and the IBC domain having been proposed. Therefore, in order to address this problem, a novel and detailed heterogeneous cross-domain authenticated key agreement scheme is proposed in this paper. By utilizing the PKI-based distributed trust model and the access authorization tickets, this scheme can realize interconnection and seamless authentication between the PKI domain and the IBC domain. Analysis shows that the proposed scheme is theoretically correct, while guaranteeing high security and efficiency.

58 Open flow-based medical network minimum cost algorithm

Objectives Focusing on the problem of medical network performance bottlenecks in multiple domains, this paper proposes a federation across domain architecture, an inter-domain routing resource-providing method based on software defined networking (SDN) and a multi-controller minimum cost algorithm, and realizes resource optimization for cross-domain services. Methods Particle swarm optimization (PSO) was used to solve the problem of cross-domain medical network minimum cost. In the basic PSO algorithm, the particles are randomly distributed, with each particle representing a possible solution. The basic framework of the particle swarm algorithm shows that in each generation, each individual has a global optimum value and a historical optimum value. The best values found in the search replace the lesser values, and particles in each iteration adjust their flight direction and speed according to the optimum position. After several iterations comparing the particle’s fitness value, the particle’s speed and position are updated according to the formula. Finally, iteration or termination of the algorithm is carried out depending on the fitness value. Results Experimental results show that in the cross-domain medical network, inter-domain resources are the main cause of network blocking. When the number of domains is fixed, the inter-domain resource optimization algorithm decreases the blocking rate by more than 15% compared to a random strategy network, with the average hop count being about 12% less than with a random strategy, showing the proposed algorithm improves the medical network performance. Conclusions The algorithm proposes a multiple domain vertically integrated inter-domain routing architecture, the realization of a cross-domain business domain between resource optimization, thus achieving optimization of all medical network resources. Acknowledgments This research was financially supported by a project grant from the International Science and Technology Cooperation and Exchange Project of China (Grant No. 2013DEF13130).

Achieving consistence for cross-domain WAN control in Software-Defined Networks

When applying Software-Defined Networks (SDN) to WANs, the SDN flexibility enables the cross-domain control to achieve a better control scalability. However, the control consistence is required by all the cross-domain services, to ensure the data plane configured in consensus for different domains. Such consistence process is complicated by potential failure and errors of WANs. In this paper, we propose a consistence layer to actively and passively snapshot the cross-domain control states, to reduce the complexities of service realizations. We implement the layer and evaluate performance in the PlanetLab testbed for the WAN emulation. The testbed conditions are extremely enlarged comparing to the real network. The results show its scalability, reliability and responsiveness in dealing with the control dynamics. In the normalized results, the active and passive snapshots are executed with the mean times of 1.873s and 105ms in 135 controllers, indicating its readiness to be used in the real network.