Path Verification Research Articles

Automated fiber switch with path verification enabled by an AI-powered multi-task mobile robot

As the capacity of optical transport networks undergoes significant growth, there is an ongoing discussion on how to effectively leverage both spectral and spatial degrees of freedom to scale future network capacity. This paper presents an artificial intelligence (AI)-powered multi-task robot comprising a collaborative robotic arm and a mobile robotic base designed for optical network automation. The robot demonstrates the capability of direct fiber switching, establishing static fiber links that consume zero power and have minimal insertion loss from fiber connectors. As a precautionary measure before physically switching fiber cables, the robot performs path verification by detecting robot-driven events using real-time coherent receivers, aiming to avoid accidental unplugging. Additionally, the robot showcases its mobility by efficiently navigating between different network racks and rooms while executing various tasks. Implementing the automation of network operations using robots has the potential to reduce both capital and operational expenditures.

Automated fiber switch with path verification enabled by an AI-powered multi-task mobile robot

Automated fiber switch with path verification enabled by an AI-powered multi-task mobile robot

MASK: Practical Source and Path Verification Based on Multi-AS-Key

The source and path verification in Path-Aware Networking considers the two critical issues: (1) end hosts could verify that the network follows their forwarding decisions, and (2) both on-path routers and destination host could authenticate the source of packets and filter the malicious traffic. Unfortunately, the state-of-the-art mechanisms require heavy communication overhead in the network and computation overhead in the router; moreover, it is difficult to meet the dynamic requirements of the end host. We propose a user-driven mechanism, source and path verification based on Multi-AS-Key (MASK). MASK decreases the communication overhead by a short additional packet header and reduces the computation overhead by separating the control and data plane in terms of the cryptographic operation. Furthermore, it utilizes the stateful user to instruct the stateless routers to process the packet with a user-driven policy, thus satisfying the user’s requirements such as detecting the packet drop and replay attack. With the plausible design, the communication overhead for realistic path lengths is 1/2 to 1/10 compared with the state-of-the-art mechanisms. We implement MASK in the BMv2 environment and commodity Barefoot Tofino programmable switch, testify that MASK introduces significantly less overhead than the state-of-the-art mechanisms, and demonstrate that MASK could achieve the verification in the programmable switch at line rate.

Combination Attacks and Defenses on SDN Topology Discovery

The topology discovery service in Software-Defined Networking (SDN) provides the controller with a global view of the substrate network topology, allowing for central management of the entire network. Unfortunately, emerging topology attacks can poison the network topology and result in unforeseeable disasters. Although researchers have made great efforts to mitigate this problem, security hazards still exist. In this paper, we propose Invisible Assailant Attack (IAA), the first combination topology attack capable of injecting and maintaining fake links even when 12 existing defense strategies are deployed simultaneously. IAA consists of 14 attack phases that apply multiple attack strategies. Attackers skillfully disguise the attack traffic in each phase so that it looks like normal network traffic, and perform these phases in a well-planned sequence, thereby bypassing existing defenses step by step. To mitigate this attack, we propose a Route Path Verification (RPV) mechanism that orchestrates multiple defense strategies to identify fake links. According to the experiments, RPV can successfully detect IAA with low overhead: its detection completes within 1 ms while its per-flow storage consumption is only a few KB.

THE ROLE OF TEACHER COMPETENCY IN MEDIATING THE INFLUENCE OF WORKSHOP AND ACADEMIC SUPERVISION ON STATE HIGH SCHOOL TEACHER PERFORMANCE IN ACEH PROVINCE

The research examines the workshops and academic supervision influence on teacher competency as well as the implications for teacher performance at State High Schools in Aceh Province. The sample size was the same as the population namely 233 respondents, and it used the proportionate stratified random sampling technique to pick them up. Data were processed through a special onesample t-test to prove the hypothesis through descriptive analysis, SEM-AMOS specifically to prove the hypothesis through direct effect path verification analysis, and a special Sobel calculator to prove the hypothesis through indirect effect path Sobel test analysis. The results prove that the descriptive hypothesis proposed states that it has worked well for all research variables. Furthermore, the workshop and academic supervision influence teacher competency and teacher performance, showing that the better the workshop and academic supervision, the better the teacher competency and teacher performance will be. The mediation test produces teacher competency plays a role as a partial mediator on the workshop and academic supervision influence teacher performance. Partial mediation proves that workshop and academic supervision can influence teacher performance directly, or through the mediator, namely teacher competency. These findings explain that the teacher performance model in State High School in Aceh Province is a function of increasing the quantity and quality of workshops and strengthening academic supervision for working teachers.

LRVP: Lightweight Real-Time Verification of Intradomain Forwarding Paths

The correctness of user traffic forwarding paths is an important goal of trusted transmission. Many network security issues are related to it, i.e., denial-of-service attacks, route hijacking, etc. The current path-aware network architecture can effectively overcome this issue through path verification. At present, the main problems of path verification are high communication and high computation overhead. To this aim, this article proposes a lightweight real-time verification mechanism of intradomain forwarding paths in autonomous systems to achieve a path verification architecture with no communication overhead and low computing overhead. The problem situation is that a packet finally reaches the destination, but its forwarding path is inconsistent with the expected path. The expected path refers to the packet forwarding path determined by the interior gateway protocols. If the actual forwarding path is different from the expected one, it is regarded as an incorrect forwarding path. This article focuses on the most typical intradomain routing environment. A few routers are set as the verification routers to block the traffic with incorrect forwarding paths and raise alerts. Experiments prove that this article effectively solves the problem of path verification and the problem of high communication and computing overhead.

Quantum cryptography networks in support of path verification in service function chains

Quantum key distribution (QKD) is a physical technology that enables the secure generation of bit streams (keys) in two separated locations. This technology is designed to provide a solution for very secure (quantum-safe) key agreement, which is nowadays at risk due to advances in quantum computing. The recent demonstration of a QKD network in the metropolitan area of Madrid shows how these networks can be deployed in current production infrastructure by following existing networking paradigms, such as software-defined networking. In particular, a three-node QKD network is implemented on the metropolitan area network using existing infrastructure and coexisting with other data and control services. On the other hand, telecommunication networks are drastically changing the way services are architectured. Users of the operator’s infrastructure are moving from traditional connectivity services (e.g., virtual private networks) to a set of interconnected network functions, either physical or virtual, in the shape of service function chaining (SFC). However, SFC users do not have a method to validate that the traffic flow is appropriately forwarded across the nodes in the network, a situation that may lead to very critical security breaches (e.g., a security node or a firewall in the chain that is bypassed). This work presents a method for validating ordered proof-of-transit (OPoT) on top of the Madrid Quantum Network. We first provide a general description of the QKD network deployed in Madrid. Then, we describe an existing security protocol for PoT in packet networks, analyzing its issues and vulnerabilities. Finally, this work presents a protocol for alleviating the security breach found in this work and for providing OPoT in SFC. Finally, an example of the real implementation is shown, where nodes being part of the OPoT scheme are provisioned with QKD-derived keys.

ASIC STA Path Verification Using Semi-Supervised Learning

To counter manufacturing irregularities and ensure ASIC design integrity, it is essential that robust design verification methods are employed. It is possible to ensure such integrity using ASIC static timing analysis (STA) and machine learning. In this research, uniquely devised machine and statistical learning methods which quantify anomalous variations in Register Transfer Level (RTL) or Graphic Design System II (GDSII) format are discussed. To measure the variations in ASIC analysis data, the timing delays in relation to path electrical characteristics are explored. It is shown that semi-supervised learning techniques are powerful tools in characterizing variations within STA path data and have much potential for identifying anomalies in ASIC RTL and GDSII design data.

Inner Path Verification of T-PACK(Technology-Pedagogy and Contents Knowledge) for Integrated Education Teachers

Inner Path Verification of T-PACK(Technology-Pedagogy and Contents Knowledge) for Integrated Education Teachers

An identity based routing path verification scheme for wireless sensor networks

While the ability to express routing policies in wireless sensor networks (WSNs) has been well-studied, unfortunately, the ability to enforce these policies has not been. The core challenge is that if we assume an adversarial, decentralised, and high-speed environment, then how can the receiving node be sure that the path being announced by the incoming packet is the actual path followed by it? In this paper we describe the networking primitive, called routing path verification (RPV), which serves as a tool to enforce routing policies and presents a solution to the defined core challenge. We assess the security of the proposed RPV construction in a formal way. More significantly we augment a suitable key exchange protocol with our proposed RPV construction, to achieve an overall RPV scheme. We also evaluate the computational, communication and storage overhead of our proposed scheme and the experimental results show that the approach is quite scalable.

Design and analysis of solar-tracking 2D Fresnel lens-based two staged, spectrum-splitting solar concentrators

Abstract This research investigates a spectrum control method that improves the concentration flux uniformity and redirects the energy that tend to build up temperature under a Fresnel lens (FL). The design is mapped via ray tracing technique based on Snell's law and the law of reflection as applicable to the lens, the spectrum splitters, and the 2nd stage reflectors. To examine the illumination patterns on the receivers of a spectrum splitting concentrator that consists of a FL and two dichroic mirrors, a spectrum allocating algorithm, which is able to define the three-point coordinate sets of all the on-lens prisms, has been developed. The coordinates are then ported to TracePro for FL construction and light path verification. This study also investigates suitable second stage compound flat concentrators for recovering the radiation that misses the target range. Computer simulations of acrylic based FLs determine the maximal energy available under the lens. The results have been calibrated with published measured data before they are used to chart out the spectrum segments' locations on each target. This study explores different locations' spectral composition details via target position adjustment and, consequently, helps to fit different concentrated wavelengths to their suitable applications.

Embedded Systems Secure Path Verification at the Hardware/Software Interface

Editor’s note: The article presents a case study comparing two types of properties for formal verification of security requirements in embedded systems. — Wen Chen, NXP

A Wormhole Attack Detection and Prevention Technique in Wireless Sensor Networks

Security is one of the major and important issues surrounding network sensors because of its inherent liabilities, i.e. physical size. Since network sensors have no routers, all nodes involved in the network must share the same routing protocol to assist each other for the transmission of packets. Also, its unguided nature in dynamic topology makes it vulnerable to all kinds of security attack, thereby posing a degree of security challenges. Wormhole is a prominent example of attacks that poses the greatest threat because of its difficulty in detecting and preventing. In this paper, we proposed a wormhole attach detection and prevention mechanism incorporated AODV routing protocol, using neighbour discovery and path verification mechanism. As compared to some preexisting methods, the proposed approach is effective and promising based on applied performance metrics.

Some Aspects of Visualization as the Tool of Education Process Quality Increasing

The article deals with some aspects of visualisation as the tool of education process quality increasing at technical universities. There is described the sequence of 3D modelling activities that students have to pass in order to be successful in the study and consequently in practice. First, they learn to create simple parts, then they learn to assemble the components into the static or welded assemblies, respectively into movable mechanism. In higher levels, if they absorb the fundamental theoretical knowledge, they can subject the 3D models to the analysis, as are stress, kinematic, dynamic analysis, etc. and compare the computer aided results with the values calculated in classical way. Students can apply the other advantages of the virtual models into the drawings preparation in electronic form and at the tool path verification during the machining simulation. The whole production process can be designed by students, too. They can use several CAD/CAM systems for all activities listed above and compare results to verify the solution.

Efficient milling part geometry computation via three-step update of frame-sliced voxel representation workpiece model

This paper presents an efficient method of computing machined part geometry in general multi-axis milling. The method is based on the frame-sliced voxel representation of the workpiece geometry and involves a three-step update process. Virtual prototyping of the machined part geometry is useful for tool path verification and demands fast computations for quick feedback. The frame-sliced voxel representation (FSV-rep) model retains the advantages of efficiency and robustness of voxel modeling in model update along with the accuracy and boundary representation quality comparable to that of triangle meshing. The multi-level FSV-rep model allows a three-step update process of the model, which enables batch processing of the voxels and minimal intersection calculations to achieve fast and accurate modeling results. In a series of test cases, the FSV-rep-based computation has shown up to 3.3 times faster performance compared to that of the existing tri-dexel-based method with similar modeling accuracy. The better performance of the present method is attributed to the bulk workpiece volume to be removed and the complex multi-axis motions of the cutting tool with tilted orientations.

An Identity based Routing Path Verification Scheme for Wireless Sensor Networks

While the ability to express routing policies in wireless sensor networks (WSNs) has been well-studied, unfortunately, the ability to enforce these policies has not been. The core challenge is that if we assume an adversarial, decentralised, and high-speed environment, then how can the receiving node be sure that the path being announced by the incoming packet is the actual path followed by it? In this paper we describe the networking primitive, called routing path verification (RPV), which serves as a tool to enforce routing policies and presents a solution to the defined core challenge. We assess the security of the proposed RPV construction in a formal way. More significantly we augment a suitable key exchange protocol with our proposed RPV construction, to achieve an overall RPV scheme. We also evaluate the computational, communication and storage overhead of our proposed scheme and the experimental results show that the approach is quite scalable.

Policy-Based AS Path Verification with Enhanced Comparison Algorithm to Prevent 1-Hop AS Path Hijacking in Real Time

Policy-Based AS Path Verification with Enhanced Comparison Algorithm to Prevent 1-Hop AS Path Hijacking in Real Time

Improved source path localisation in ring applicators and the clinical impact for gynecological brachytherapy.

PurposeThe path of subsequent dwell positions of an afterloader source being moved through a ring applicator for cervix cancer brachytherapy deviates from an ideal circle and the position of marker wires. This can lead to deviations of several millimetres between real and assumed dwell positions for treatment planning with simplified source path models. The aim of this study was to test video- and autoradiography-based methods for source path determination, and to study the influence of dwell position accuracy on dose-volume histogram (DVH)-parameters.Material and methodsVideos of the exact motion of the source wire through three different (r = 26, 30, 34 mm) computed tomography/magnetic resonance (CT/MR) compatible plastic ring applicators were recorded. Observed dwell positions covering the whole length of each applicators channel were used to adjust the circular source path model. The agreement of the true source positions derived from video analysis with those of the corrected circular source path was verified using autoradiography. The impact of an accurate source path definition on dose planning was analysed by simulating clinically relevant uncertainties in 10 clinical treatment plans.ResultsDepending on the ring size, source path diameters had to be increased by 0.5-1.0 mm in order to achieve acceptable maximum differences between observed and corrected dwell positions (1.3-2.0 mm). Autoradiography analysis showed a positional accuracy within ± 3 mm (extended standard deviation k = 2). For shifts of ± 2.5 mm for even all dwell positions, the systematic and random variation of the D2cm3 for bladder, rectum, and sigmoid was within 3%, while the impact on DVH uncertainties was much smaller for clinical target volume (CTV)HR and gross tumour volume (GTV).ConclusionsIt is strongly advised to verify the real source path for ring applicators during acceptance testing in order to assure accurate source path definition and dose planning. Autoradiography can be used for source path verification with acceptable accuracy for treatment planning and dose reporting.

Redundancy filtering and fusion verification for video copy detection

Recently, the frame fusion based video copy detection scheme provides a possibility to detect copies in a continuous query video stream. However, its computational complexity is high since a large amount of returned reference frames need to be handled by some reference clip reconstruction methods. In addition, dense frame sampling strategies generally used for improving copy localization precision not only further aggravate the computational efficiency but also lead to much more false alarms due to the content redundancy among frames. To alleviate the above problems, a new scheme is proposed for improving the performance of the frame fusion based video copy detection in both efficiency and effectiveness. In particular, the continuous similarity property among neighbor frames is learned for guiding the design of smart frame filtering method so as to greatly reduce the redundancy among frames. Then, two effective path verification schemes, which utilize cross-clip verification strategy, are studied for removing false alarms. The extensive experiments show that the proposed scheme remarkably improves the detection accuracy of the baseline frame fusion scheme and gives a comparable localization accuracy.

Toward an RFID Scheme for Secure Material Flow Tracing and Verification in Supply Chains

Radio Frequency Identification (RFID) is an important wireless communication and pervasive computing technique used for automatic item identification and data capture. In this paper, we present a scheme for securely tracing material flow in supply chains using the inherent RFID authentication and data logging capability. The scheme provides not only an overall path tracing and verification through the entire supply chain, but also the product identification within the scope of a supply chain partner. RFID tags and readers are deployed to ensure that only authorized supply chain partners can identify the tagged items in a secure and private way. The authors develop tag-reader authentication protocols to ensure the authenticity of RFID tags and readers. Their approach avoids the single point failure of the supply chain server – there is no need for each supply chain partner to communicate with the server for every material flow. Therefore, it minimizes the risks caused by system interruptions due to network failures or server unavailability.