Search

The network topology is marked with the device type, which is difficult to reflect the service relationship between the device nodes. Aiming at this problem, this paper proposes a network service node division algorithm based on service mapping. The algorithm judges the ownership of the service community through the service mapping relationship between network nodes, and finds the key nodes of network services and the subordinate relationship between nodes. This paper introduces virtual community based on traditional membership matrix. The network service community membership influence degree algorithm not only give the community membership degree of nodes, but also reflect the global influence degree of nodes, providing a basis for the selection of key network nodes in network security. In the experiment based on LFR network, this paper compares the algorithm sensitivity and performance with similar algorithms, and validates the effectiveness of algorithm partitioning in the Internet2 OS3E simulation experiment by simulating denial of service attacks. The comparative experimental results show that the service mapping algorithm has the characteristics of low sensitivity and high practicability in threshold selection, and its performance is better than that of similar algorithms. The simulation results show that the service community partition is effective and can give the correlation between node services.

The network topology is marked with the device type, which is difficult to reflect the service relationship between the device nodes. Aiming at this problem, this paper proposes a network service node division algorithm based on service mapping. The algorithm judges the ownership of the service community through the service mapping relationship between network nodes, and finds the key nodes of network services and the subordinate relationship between nodes. This paper introduces virtual community based on traditional membership matrix. The network service community membership influence degree algorithm not only give the community membership degree of nodes, but also reflect the global influence degree of nodes, providing a basis for the selection of key network nodes in network security. In the experiment based on LFR network, this paper compares the algorithm sensitivity and performance with similar algorithms, and validates the effectiveness of algorithm partitioning in the Internet2 OS3E simulation experiment by simulating denial of service attacks. The comparative experimental results show that the service mapping algorithm has the characteristics of low sensitivity and high practicability in threshold selection, and its performance is better than that of similar algorithms. The simulation results show that the service community partition is effective and can give the correlation between node services. [ABSTRACT FROM AUTHOR]

In network services, there are often conflicts among privacy protection, trust, and service quality, which greatly reduces the regulatory effectiveness of networks. Using the basic method of information theory, this paper considers the optimization mechanism of trust and the balance between privacy and service utility from the perspective of quantifying information flow. First, we build a trust model based on multiple factors, such as direct trust, service trust, and trust cloud network. The weight of trust factors is determined by category diversity and information entropy theory. Second, based on statistical knowledge and information entropy, we propose a new privacy measurement model with hierarchical weights. Third, we establish a trust privacy service relationship model to realize the trade-off between privacy, service, and trust in networks. The demander can choose to establish trust, protect privacy, or obtain high-quality services according to personal preferences and needs. Fourth, we propose a privacy trust mapping relationship model and a privacy disclosure selection model. Finally, we design different experimental schemes. These simulation results show that our research can not only provide better quality of service but also better protect privacy and help interactive parties in networks establish a strong trust relationship. This research will improve the effectiveness of networks and can be applied to class II vaccine multi-agent collaborative supervision based on technology. [ABSTRACT FROM AUTHOR]

Computation offloading in edge-assisted virtual reality (VR) relies on image reprojection to mitigate motion sickness caused by long latency, but this introduces black borders due to missing pixels, which can degrade the user experience. Overfill rendering, which renders an expanded viewport beyond its native size, offers a solution to the black border problem. However, this comes at the cost of increased pixel data size, thus necessitating optimization to balance the quality of experience and service costs. Consequently, determining the optimal overfill image size becomes closely linked to offloading decisions and wireless network management. Current overfill rendering techniques rely on a fixed scaling factor, and comprehensive optimization of edge-assisted VR systems that incorporate dynamic adaptation of overfilling factors has not yet been explored in the literature. In this context, we formulate a unified problem of overfilling, offloading, and subband allocation for an edge-assisted VR system utilizing non-orthogonal multiple access. Our solution employs a deep reinforcement-learning-based approach, which consists of the overfilling decision component, employing per-user agents, and the radio resource allocation component for determining offloading decisions and subband allocation, with the aid of motion prediction. We develop four dynamic overfilling strategies: asymmetric overfilling with different overfilling factors for different sides of the VR frame, symmetric overfilling with a single factor, and velocity-adaptive overfilling with a coefficient factor. In each strategy, the overfilling factors are determined by the overfilling decision component as its action. Our numerical evaluation, conducted using real VR motion traces, demonstrates that the proposed solution, along with the developed overfilling strategies, outperforms other benchmarks, reducing black border amounts by up to 92% while consuming comparable energy to the fixed overfilling strategy.

We provide artifacts to reproduce the evaluation results of our article: “NSFuzz: Towards Efficient and StateAware Network Service Fuzzing”. The provided artifacts can be downloaded from https://zenodo.org/record/ 7134490. It includes 14 docker containers, several scripts for execution and analysis, one additional proof for the crash results, and six related documents for the running of experiments. We claim for all three badges, i.e., Available, Functional, and Reusable. This report gives instructions on how to reproduce the answers which mainly involve basic operations on the Ubuntu operating system [ABSTRACT FROM AUTHOR]

As an essential component responsible for communication, network services are security critical, thus, it is vital to find their vulnerabilities. Fuzzing is currently one of the most popular software vulnerability discovery techniques, widely adopted due to its high efficiency and low false positives. However, existing coverage-guided fuzzers mainly aim at stateless local applications, leaving stateful network services underexplored. Recently, some fuzzers targeting network services have been proposed but have certain limitations, for example, insufficient or inaccurate state representation and low testing efficiency. In this article, we propose a new fuzzing solution NSFuzz for stateful network services. We studied typical implementations of network service programs to determine how they represent states and interact with clients. Accordingly, we propose (1) a program variable–based state representation scheme and (2) an efficient interaction synchronization mechanism to improve fuzzing efficiency. We implemented a prototype of NSFuzz, which uses static analysis and annotation application programming interfaces (APIs) to identify synchronization points and state variables within the services. It then achieves fast I/O synchronization and accurate service state tracing to carry out efficient state-aware fuzzing via lightweight compile-time instrumentation. The evaluation results show that compared with other network service fuzzers, including AFLnet and StateAFL, our solution NSFuzz could infer a more accurate state model during fuzzing and improve fuzzing throughput by up to 200×. In addition, NSFuzz could improve code coverage by up to 25% and trigger more crashes in less time. We also performed a fuzzing campaign to find new bugs in the latest version of the target services; 8 zero-day vulnerabilities have been found by NSFuzz. [ABSTRACT FROM AUTHOR]

Existing network service provisioning and lifecycle management (LCM) workflows rely on heterogeneous devices from multiple vendors and collaboration between multiple network actors, which can lead to numerous trust management and interoperability issues. Blockchain networks (BCNs) are a revolutionary way to establish trust in untrusted environments. In this complex environment, BCNs can help ensure transparency and security for network service LCM. However, BCNs are also vulnerable to quantum attacks. Advances in quantum computing will challenge the security of existing blockchain technology based on Public Key Infrastructure (PKI) technologies. In this paper, we explore how network services can be managed in a multiple administrative scenario. Our approach uses BCNs to track the operational steps of network service instantiation metrics while benefiting from the security features of post-quantum cryptography (PQC). Together with the use of N-th degree Truncated polynomial Ring Units (NTRU) as an example of a PQC algorithm that relies on the parallelization power of the Toom-Cook computation method with different security levels, we have shown that Quorum can provide a lower average time-to-write value compared to other BCNs considered (Ethereum and Hyperledger). At the end of the paper, we discuss the evaluation results and future directions regarding the coexistence of PQC algorithms and BCNs for network service orchestration and service federation between multiple administrative domains.

The purpose of this paper is to illuminate the role and importance of National Research & Education Network (NREN) in the national research and education field and to establish the future strategy of KREONET in Korea. To this end, we first carefully analyze the footsteps of NREN in major overseas countries, KREONET achievements, and future demand for KREONET. The history of NREN’s development is divided into the 2000s, 2010s, and present by era, and classified into network infrastructure, network service, and next-generation network technology by subject. KREONET achievements are divided into advanced research support, network backbone and operation, and network service. Future demand analysis of users who use KREONET was conducted through Korea Research International Incorporation, a survey company. This paper presents the future development strategy of KREONET by analyzing KREONET achievements and future demand.

Aim of this study to examine the mediating role of network service between perceived quality, retailer service and customer satisfaction during COVID-19. Primary data gathered through adopted questionnaire from previous studies and 200 university students were asked to fill online questionnaire during COVID-19 situation in country. Structural Equation Modelling technique applied in order to test the proposed hypothesis generated from existing literature review. Findings revealed full mediation effect of network service for both perceived quality and retailer service on customer satisfaction during COVID-19. New insights of this study are key role of network services is identified and university students’ satisfaction is measured for online classes in developing country, Pakistan. In future serial mediation is suggested for validity of existing results in developed and developing countries. [ABSTRACT FROM AUTHOR]

The number of computers that provide information services via the Internet is constantly increasing, particularly for IoT applications. Compared to the servers in managed data centers, IoT computers have an increased risk of contamination from unidentified computers. It is therefore important for applications that utilize IoT to identify the appropriate computers to use. However, it is difficult to assign digital identifiers with adequate protection to a huge number of IoT computers. In this work, we have devised a method to extract computer-specific features from the characteristics of the CPU core temperature and the drift of the time information. This feature data can be treated as computer-specific information, just like human biometric information. We performed experiments on two types of computer (three of each) with the same software settings and obtained a regression linear equation for each that represents the time deviation per temperature. The correlation coefficients of these equations were greater than 0.9 for all, and a strong positive correlation was obtained. From the equation and the temperature values, we found that it is possible to estimate the computer-specific time deviation. Our method does not require the implementation of a special temperature sensor. Therefore, it shows good potential for future applications.

Maintaining an excellent level of service in a network Cleft Lip and Palate service in the UK has been an added challenge for both clinicians and patients throughout the COVID-19 pandemic. We describe the changes to our service, and report a high level of patient satisfaction with the changes. Some of the enforced changes may last beyond the duration of this pandemic. [ABSTRACT FROM AUTHOR]

Network Functions Virtualization (NFV) promotes a paradigm shift in the core network, by enabling the execution of network functions on a virtualized software plane instead of on dedicated hardware. Despite its benefits, NFV introduces new challenges, of which we highlight those related to the deployment of virtualized network services. Current NFV deployment solutions (i.e., those for composition, embedding, and scheduling) are usually limited to optimize hard-coded criteria, and cannot be customized to address specific demands defined by both network operators and NFV-as-a-Service customers. In this paper, we present a customizable NFV deployment framework that allows multiple criteria and multiple objectives to be applied to service composition, embedding, and scheduling. We evaluate the proposed framework integrated to deployment solutions specified in the literature. A case study is presented for the customized deployment of a traffic control and security service, and demonstrates the flexibility and effectiveness of the proposed framework. [ABSTRACT FROM AUTHOR]

This paper interprets the evolution route of network service capability provided by telecom operators in traditional Internet of Vehicles industry chain. On the basis of the development trend of future Internet of Vehicles and intelligent transportation, this paper explains the growth bottlenecks and capacity challenges faced by traditional channel service, and analyses the service capability improvement brought by 5G key technologies such as edge computing and network slicing with Internet of Vehicles. This paper also explores the innovation of Internet of Vehicles service mode and business mode that operators can carry out.

Abstract Technologies such as Bluetooth, RFID, WiFi, 4G, and the Internet of things are mutually converged with ADSL and fiber to the home network. Users can get information in the forms of word, voice, images, etc. through ubiquitous networks including the fixed telephone, the mobile telephone, the television, the computer, and diversified informational zed terminal equipment. Ubiquity informatization may be the trend of future network development, which is the development direction of the ubiquitous intelligent comprehensive network information society. Its physical representation is the appearance of ubiquitous network or the named universal network. It represents the ubiquitous prosperity that all people, all organizations, and industries can get benefits from the ubiquity informatization. This article studies the internal and external structures of network service model and introduces technology dynamics, demand dynamics, competition, and security as adjustment variables. Then, the evaluation model of network service based on network convergence is proposed and tested. The test results prove the validity of the evaluation model.

The research of network service scalability is essentially the research of the capability of providing service, which is based on services and the relationship among the services. However, most of the researches ignore the systematic research on analytical methods of service scalability in network systems, owing to the complexity and the diversity of the network system. In this paper, we propose an analytical method of network service scalability, which is composed of a network description model and a service evaluation model. The method uses the network description model to describe services and the relationship among them. After presenting the network description, the method uses the service evaluation model to analyze the network service scalability. For analyzing and simulating purposes, we select three P2P network models, which are different with each other in network topologies as an example. Our simulation results which are in accord with the results of the example analysis verify the correctness and applicability of the analytical method.

With the development of converged all-IP networks, new network services-supporting, among others, image, audio, and video-with high diversity emerge, which brings huge pressure and fierce competition to service providers because of increasing choices for users. Assessing end user's quality of experience (QoE) has become one of the main issues to meet high user requirements and satisfaction under any circumstances, which means receiving any service, anytime, anywhere, on any device, by any media and networking technology, across any operator domain. In this paper, we provide an overview of the field of QoE assessment approaches including three aspects: subjective assessment, objective assessment, and hybrid assessment. The discussion includes the definition, influence factors, and quantification approaches for QoE. Then, these three assessment methodologies are surveyed and compared across a number of factors. This paper also introduces challenges and opportunities in the area of QoE assessment.

Aeronautic swarm was a new kind of aeronautic operationa1 system inspired by bio1ogica1 swarm behaviors.Whi1e 1eading to a new usage way of future aeronautic operationa1 resources，aeronautic swarm wou1d bring new cha11enges to the airborne tactica1 network（ATN），which was as a bond between the swarm members.Based on the operationa1 demand of aeronautic swarm，the airborne tactica1 network of aeronautic swarm（ATNAS）was introduced，The basic capabi1ity requirements of ATNAS were ana1yzed，and the advantages of app1ying the SDN network design idea to the construction of ATNAS were a1so summarized.Then on the bases above，software defined airborne tactica1 networking for aeronautic swarm（SDATN-AS）was proposed.The basic architecture of SDATN-AS was described，and a series of future research directions and cha11enges re1ating to SDATN-AS were a1so summarized.A new exp1oration of the ATN's morpho1ogy was made which supported the efficient information interaction of aeronautic swarm members，and reference and guidance were offered for deciding the deve1opment orientations of ATN in the future.

Policies in network function virtualization (NFV) systems may conflict when they have different restrictions on the shared resources. In this context, it is of paramount importance to identify such conflicts before sending network service (NS) request (NS-Req) to the embedding algorithm to avoid unexpected behavior in its execution. Since both NS-Req and NFV infrastructure (NFVI) may contain many policies, the process of conflict detection and diagnosis is an intricate work both for humans and computer systems. Besides, as conflicts may occur among a set of constraints, pairwise detection will not suffice. Therefore, this paper proposes NSChecker, a semantic verification system to detect and diagnose policy conflicts in NFV environments. To achieve its functionality, NSChecker uses an ontology, called Onto-NFV, to describe the NFVI, NS, and associated policies. With Onto-NFV, conflicts detection is carried out through description logic (DL) inconsistency verification. We develop a prototype of NSChecker in Java and validate its capabilities on a small scenario with three use cases, showing that it supports conflict detection concerning the following policies: network function precedence, resource usage, and location. Finally, we evaluate NSChecker performance using some real topologies. The results shows that our solution is efficient even in scenarios with 50 000 nodes. [ABSTRACT FROM AUTHOR]