Table Entries Research Articles

Table representation learning using heterogeneous graph embedding

Tables, especially when having complex layouts, contain rich semantic information. However, effectively learning from tables to uncover such semantic information remains challenging. The rapid progress in natural language processing does not necessarily correspond to equivalent advancements in table parsing, which often requires joint visual and language modeling. Indeed, humans can quickly derive semantic meaning from table entries by associating them with corresponding column and/or row headers. Motivated by this observation, we propose a new heterogeneous Graph-based Table Representation Learning (GTRL) framework. GTRL combines graph-based visual modeling with sequence-based language modeling to learn granular per-cell embeddings that are sensitive to the semantic meaning of cells within their corresponding table context. We systematically evaluate the proposed GTRL framework using two datasets: a new adhesive table benchmark comprising complex tables extracted from industrial documents for learning per-entry semantics, and a publicly available large-scale dataset that enables learning header semantics from column tables. Experimental results demonstrate the competitive performance of the proposed GTRL, which often exhibits reduced computational complexity compared to state-of-the-art table representation learning models.

An architecture to improve performance of software-defined optical networks

The software-defined optical network (SDON) is a revolutionary approach in the field of optical networks. The separation of the control plane and data plane in software-defined networking (SDN) provides enhanced security and simplified network administration. Nevertheless, performance and control plane scalability are significant issues in SDN. SDN performance can be evaluated using parameters such as burst loss, delay, channel occupancy, packet loss, throughput, and average response time. The number of messages exchanged between the data plane and the control plane is used as a metric to determine controller scalability. As the network load increases, the controller experiences a higher flow of messages. It causes delay and burst loss in transmitting the burst. Occasionally, bursts exceed the capacity of the fixed-sized burstifier and are discarded because it takes a long time to identify a suitable route for the burst. Hence, it is essential to minimize the volume of messages exchanged between the control plane and the data plane to improve performance and controller scalability. In this paper, we propose a scalable SDN optical network architecture that minimizes the number of messages exchanged between the data plane and the control plane. We proposed mechanisms like channel reservation, transmission cycles, and guard time between cycles to enhance both the speed and the quality of burst transmission. Prior to transmission, resources or channels are allocated to bursts to minimize the possibility of burst collision and loss. The data plane comprises an optical burst switching (OBS) network, and the flow table entries are periodically updated to minimize inter-plane communication. We perform simulations to evaluate and compare the performance of the proposed architecture with the existing state-of-the-art architecture reported in the literature. The proposed architecture performs better than the existing state-of-the-art in terms of metrics including burst loss, delay, channel occupancy, packet loss, throughput, average response time, and reduction in the number of messages exchanged between the data plane and the control plane. Experimental results indicate a 41% reduction in mean burst loss probability and a 40.5% reduction in mean burst sending delay compared to existing architectures. Additionally, 42.1% fewer messages are exchanged between the control plane and the data plane compared to the number of exchanged messages in existing architectures.

MaP: Increasing node capacity of programmable cloud gateways

Virtual routing table lookup is a crucial operation in multi-tenant cloud gateways, the essential devices to enable the elastic management of Virtual Private Clouds (VPCs). However, software-based cloud gateways face performance bottlenecks when handling ever-increasing traffic. To address this challenge, a recent trend involves accelerating virtual routing table lookups using programmable switches, with Sailfish being the state-of-the-art solution. Nonetheless, Sailfish’s table scale on a single programmable switch is limited by the ASIC memory sizes. We introduce a novel scheme, named MaP (Merge and Partition), to significantly increase the memory efficiency on a single Tofino 1.0 programmable switch. MaP exploits the similarities in routing table entries across various VPCs for table compression and leverages the hardware architecture of programmable chips to minimize the memory occupancy. Performance evaluations using real-world virtual routing tables demonstrate that our approach reduces the memory cost from 25% to 47.7% compared to Sailfish, without negatively impacting the throughput and latency. With MaP, a single programmable switch can manage a massive table containing over 2 million entries for nearly 1 million VPCs, while only occupying 59.0% of memory and 63.0% of stages.

Utilizing TabNet Deep Learning for Elephant Flow Detection by Analyzing Information in First Packet Headers.

Rapid and precise detection of significant data streams within a network is crucial for efficient traffic management. This study leverages the TabNet deep learning architecture to identify large-scale flows, known as elephant flows, by analyzing the information in the 5-tuple fields of the initial packet header. The results demonstrate that employing a TabNet model can accurately identify elephant flows right at the start of the flow and makes it possible to reduce the number of flow table entries by up to 20 times while still effectively managing 80% of the network traffic through individual flow entries. The model was trained and tested on a comprehensive dataset from a campus network, demonstrating its robustness and potential applicability to varied network environments.

Dynamic Link Metric Selection for Traffic Aggregation and Multipath Transmission in Software-Defined Networks

Software-defined networks (SDNs) are expanding their presence beyond laboratories, campus networks, ISPs, and data centre networks, moving into various domains. Although originally designed for campus networks, SDNs face scalability challenges, especially with the use of OpenFlow. Addressing these challenges requires innovative traffic management mechanisms to efficiently handle the growing number of connected devices and the increasing volume of traffic from various types of applications. This article proposes an innovative method for link weight selection that incorporates multipath transmission and flow aggregation in the SDNs. This novel approach improves resource utilization in two key ways. First, it involves the preservation of bandwidth during congestion. Second, it minimizes internal resource usage, as illustrated by a reduction in the number of table entries in switches. Resources undergo optimization through the introduction of a novel mechanism for flow aggregation. This novel mechanism, coupled with multipath transmission, enables adaptive responses to dynamic changes in network conditions. The aggregation process leads to a reduced number of flow entries in the core switches compared to the conventional operation of OpenFlow. The proposed scenarios for link weight allocation allow for a reduction in the number of entries in the core switches by up to 99%. The application of the proposed method also results in an increase of 58% in traffic transmission.

Galor: Global view assisted localized fine-grained routing for LEO satellite networks

Low Earth Orbit (LEO) satellite networks have been expected to provide global coverage for Internet services with immediacy requirements. The dynamics of an LEO satellite network topology induce the challenges of achieving efficient content retrieval. This article takes an initial step toward achieving efficient content retrieval in LEO satellite networks from the routing perspective. We start with investigating the topology characteristics of LEO satellite networks in terms of the deterministic neighbor relation and the intermittent inter-satellite links. We then propose a Global view Assisted Localized fine-grained Routing (GALOR), which is an information-centric routing mechanism customized to LEO satellite networks. Specifically, GALOR disseminates the link state within a predefined range instead of the entire constellation, incurring less convergence time and control overhead. Therefore, GALOR can calculate the routing table (to guide interest forwarding) based on the local link state and the global neighbor relations. Moreover, GALOR improves the forwarding method of the information-centric routing by reconstructing a failed Pending Interest Table (PIT) entries in response to occasional link failures. Our packet-level experiments show that GALOR outperforms state-of-the-art mechanisms (up to 103.4%) in terms of average packet delivery ratio in content-sharing.

ERT-EDR: Online defense framework for TCP-targeted LDoS attacks in SDN

The Low-rate denial of service (LDoS) attack is a variant of denial of service (DoS) attack that exploits low overhead to render target services unreachable for legitimate users. Unlike legacy networks, software-defined networking (SDN) separates the behavior of controlling and forwarding, providing excellent programmability to achieve real-time defense against LDoS attacks. Leveraging the potential of SDN’s programmability, we propose a real-time anomaly defense framework tailored for SDN, named ERT-EDR. This framework is capable of detecting and mitigating TCP-targeted LDoS Attacks and comprises three modules: (1) The Information Collection Module. It periodically samples the traffic statistics for analysis. (2) The LDoS Attack Detection Module. It combines six features of traffic statistics and utilizes the Extremely Randomized Trees (ERT) algorithm to detect. (3) LDoS Attack Mitigation Module. It locates attacked ports with the Edit Distance on Real sequence (EDR) algorithm and installs flow table entries to filter attack traffic.Extensive experiments are conducted under various background traffic scenarios to validate the effectiveness and scalability of ERT-EDR. The results demonstrate that ERT-EDR can effectively detect TCP-targeted LDoS attacks with 96.4667% accuracy and 96.4977% F1score. Furthermore, it accurately identifies the attacked port and successfully mitigates attacks.

A conflict-free CAN-to-TSN scheduler for CAN-TSN gateway

The automotive Electrical/Electronic (E/E) architecture with Time-Sensitive Networking (TSN) as the backbone network and Controller Area Network (CAN) as the intra-domain network has attracted extensive research attention. In this architecture, the CAN-TSN gateway serves as a vital hub for communication between the CAN and TSN networks. However, with frequent information exchange between domains, multiple real-time applications inevitably compete for the same network resources. The limited availability of schedule table entries and bandwidth allocation pose challenges in scheduling design. To mitigate the transmission conflicts at the CAN-TSN gateway, this paper proposes a CAN-to-TSN scheduler consisting of two primary stages. The first stage introduces the Message Aggregation Optimization (MAO) algorithm to aggregate multiple CAN messages into a single TSN message, ultimately decreasing the communication overhead and the schedule table entries number. The second stage proposes the Exploratory Message Scheduling Optimization (EMSO) algorithm based on MAO. EMSO disaggregates and reassembles the CAN messages with small deadlines within the currently un-scheduled TSN message to improve the acceptance ratio of CAN messages. Experimental results demonstrate that EMSO achieves an average acceptance ratio of CAN messages 4.3% higher in preemptive mode and 8.2% higher in non-preemptive mode in TSN than state-of-the-art algorithms.

A Mixed-Criticality Traffic Scheduler with Mitigating Congestion for CAN-to-TSN Gateway

The network architecture that Time-Sensitive Networking (TSN) is used as the backbone network and the Controller Area Network (CAN) serves as the intra-domain network is considered as the CAN-TSN interconnection network architecture, which has gained considerable attention within industrial embedded networks, such as spacecraft, intelligent automobiles, and factory automation. The architecture employs the CAN-TSN gateway as a central hub for transmitting and managing a significant volume of communications between the CAN domains and TSN. However, the CAN-TSN gateway faces a high congestion challenge due to the rapid growth in data volume, making it difficult to effectively support different time planning mechanisms provided by TSN. In this paper, we propose a two-stage mixed-criticality traffic scheduler. The scheduler in the first stage adopts a Message Optimization Algorithm (MOA) to aggregate multiple CAN messages into a single TSN message (including the aggregation of critical and non-critical CAN messages), which reduces the number of CAN messages requiring transmission. In the second stage, the scheduler proposes a Message Scheduling Optimization Algorithm (MSOA) to schedule critical TSN messages. This algorithm reassembles all the critical CAN messages (within the un-schedulable TSN messages) to generate new TSN messages for rescheduling. Experimental results show that our proposed scheduler effectively improves the acceptance ratio of critical and non-critical CAN messages and outperforms the state-of-the-art message scheduling method in terms of acceptance ratio while improving the bandwidth utilization and the number of schedule table entries. We further construct a hardware platform to evaluate the performance of MSOA. The consistency between practical results and theoretical results shows the effectiveness of MSOA.

ComPipe: A Novel Flow Placement and Measurement Algorithm for Programmable Composite Pipelines

Programmable networks comprise heterogeneous network devices based on both hardware and software. Hardware devices provide superior bandwidth and low latency but encounter challenges in managing large table entries. Conversely, software devices offer abundant flow tables but have a limited forwarding capacity. To overcome this limitation, some commercial switches offer implementations that combine both hardware and software devices. In this context, this paper presents the Composite Pipeline (ComPipe), an algorithm for high-performance and high-precision flow placement and measurement. ComPipe utilizes a multi-level hashing algorithm for the real-time identification of heavy hitters, incorporates a unique flow eviction strategy, and is implemented on commercial programmable hardware. For non-heavy flows, ComPipe employs sketch structures to accomplish a high-performance flow synopsis within limited memory constraints. This design allows to replace flow rules entirely in the data plane, ensuring the timely detection and offloading of heavy-hitter flows, and offering a unified interface to the controller. The ComPipe prototype has been implemented in both testbed and simulation environments. The results indicate that ComPipe is an effective solution for dynamic flow placement in programmable networks, distinguished by its low cost, high performance, and high accuracy.

A versatile look-up algorithm for mapping pH values and magnesium ion content using 31P MRSI.

31P MRSI allows for the non-invasive mapping of pH and magnesium ion content (Mg) in vivo, by translating the chemical shifts of inorganic phosphate and adenosine-5'-triphosphate (ATP) to pH and Mg via suitable calibration equations, such as the modified Henderson-Hasselbalch equation. However, the required constants in these calibration equations are typically only determined for physiological conditions, posing a particular challenge for their application to diseased tissue, where the biochemical conditions might change manyfold. In this article, we propose a multi-parametric look-up algorithm aiming at the condition-independent determination of pH and Mg by employing multiple quantifiable 31P spectral properties simultaneously. To generate entries for an initial look-up table, measurements from 114 model solutions prepared with varying chemical properties were made at 9.4 T. The number of look-up table entries was increased by inter- and extrapolation using a multi-dimensional function developed based on the Hill equation. The assignment of biochemical parameters, that is, pH and Mg, is realized using probability distributions incorporating specific measurement uncertainties on the quantified spectral parameters, allowing for an estimation of most plausible output values. As proof of concept, we applied a version of the look-up algorithm employing only the chemical shifts of γ- and β-ATP for the determination of pH and Mg to in vivo 3D 31P MRSI data acquired at 7 T from (i) the lower leg muscles of healthy volunteers and (ii) the brains of patients with glioblastoma. The resulting volumetric maps showed plausible values for pH and Mg, partly revealing differences from maps generated using the conventional calibration equations.

Energy Efficient Clustering Mechanism for Malicious Sensor Nodes in IOT Based MWSN

A mobile wireless sensor network (MWSN) is a collection of wireless nodes that may be set up anywhere and at any time without the need for a pre-existing network structure. Network performance is challenging factor due to nature of mobility and misbehaving nodes. Data loss and misbehaving in sensor nodes degrades performance of network. Some circumstances some malevolent sensor nodes predisposed to eradicate capability of network. The goal of this study is to use an irregular set approach to distinguish hostile nodes. Broadcasting information in route entry table identifies malicious node. Each sensor node in network preserves entry table and broadcast record regarding nearby nodes. To estimate broadcasting record metrics are premeditated as data deliverance proportion, throughput, delay, packet drop, fault rate. Mobile nodes with diverse velocity are simulated in NS2 environment which contains variable node clusters. Based broadcasting records of mobile nodes with diverse velocity are considered to create information table. Fine and malicious nodes are recognized based on rules derived in table of irregular set tactic. Shortest path without malicious node is elected to broadcast packets in the environment. Proposed tactic consequences reveal irregular set tactic amplifies network capability data deliverance percentage, throughput and dwindled end-to-end delay in mobile sensors.

A Proficient Obtrusion Recognition Clustered Mechanism for Malicious Sensor Nodes in a Mobile Wireless Sensor Network

A collection of wireless nodes that may be installed at any location and at any time without requiring an established network structure is called a mobile wireless sensor network. The problem of network performance arises from the mobility of nodes and their misbehaviour. Network performance is negatively impacted by data loss and sensor node misbehaviour. In certain cases, there are malicious sensor nodes that are designed to destroy the network’s capacity. This work aims to identify hostile nodes using an irregular set technique. The route entry table’s broadcasting metadata helps identify rogue nodes. Every sensor node in the network broadcasts information about adjacent nodes and maintains a sentry table. Premeditated data delivery proportion, throughput, delay, packet drop, and fault rate are used to estimate broadcasting record parameters. In the NS2 environment, mobile nodes with varying velocities are simulated. To generate an information table, mobile nodes with varying speeds are examined based on their broadcasting records. On the basis of guidelines taken from the irregular set tactic table, good and bad nodes are distinguished. Packets are disseminated along the shortest path that doesn’t contain any malicious nodes. The results of the proposed technique show that an irregular set tactic increases throughput, network capability, data delivery percentage, and end-to-end delay reduction in mobile sensors.

A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond

Short spanning trees subject to additional constraints are important building blocks in various approximation algorithms, and moreover, they capture interesting problem settings on their own. Especially in the context of the traveling salesman problem (TSP), new techniques for finding spanning trees with well-defined properties have been crucial in recent progress. We consider the problem of finding a spanning tree subject to constraints on the edges in a family of cuts forming a laminar family of small width. Our main contribution is a new dynamic programming approach in which the value of a table entry does not only depend on the values of previous table entries, as is usually the case, but also on a specific representative solution saved together with each table entry. This allows for handling a broad range of constraint types. In combination with other techniques—including negatively correlated rounding and a polyhedral approach that, in the problems we consider, allows for avoiding potential losses in the objective through the randomized rounding—we obtain several new results. We first present a quasi-polynomial time algorithm for the minimum chain-constrained spanning tree problem with an essentially optimal guarantee. More precisely, each chain constraint is violated by a factor of at most [Formula: see text], and the cost is no larger than that of an optimal solution not violating any chain constraint. The best previous procedure is a bicriteria approximation violating each chain constraint by up to a constant factor and losing another factor in the objective. Moreover, our approach can naturally handle lower bounds on the chain constraints, and it can be extended to constraints on cuts forming a laminar family of constant width. Furthermore, we show how our approach can also handle parity constraints (or, more precisely, a proxy thereof) as used in the context of (path) TSP and one of its generalizations and discuss implications in this context. Funding: This project received funding through the Swiss National Science Foundation [Grants 200021_184622 and P500PT_206742], the European Research Council under the European Union’s Horizon 2020 research and innovation program [Grant 817750], and the Deutsche Forschungsgemeinschaft (German Research Foundation) under Germany’s Excellence Strategy – EXC 2047/1 [Grant 390685813].

The Design of a Dynamic Configurable Packet Parser Based on FPGA.

To meet the evolving demands of programmable networks and address the limitations of traditional fixed-type protocol parsers, we propose a dynamic and configurable low-latency parser implemented on an FPGA. The architecture consists of three protocol analysis modules and a TCAM-SRAM. Latency is reduced by optimizing the state machine and parallel extraction matching. At the same time, we introduce the chain mapping idea and container concept to formulate the matching and extraction rules of table entries and enhance the extensibility of the parser. Furthermore, our system supports dynamic configuration through SDN control, allowing flexible adaptation to diverse scenarios. Our design has been verified and simulated with a cocotb-based framework. The resulting architecture is implemented on Xilinx Ultrascale+ FPGAs and supports a throughput of more than 80 Gbps, with a maximum latency of only 36 nanoseconds for L4 protocol parsing.

A Machine Learning-Aided Network Contention-Aware Link Lifetime- and Delay-Based Hybrid Routing Framework for Software-Defined Vehicular Networks

The functionality of Vehicular Ad Hoc Networks (VANETs) is improved by the Software-Defined Vehicular Network (SDVN) paradigm. Routing is challenging in vehicular networks due to the dynamic network topology resulting from the high mobility of nodes. Existing approaches for routing in SDVN do not exploit both link lifetimes and link delays in finding routes, nor do they exploit the heterogeneity that exists in links in the vehicular network. Furthermore, most of the existing approaches compute parameters at the controller entirely using heuristic approaches, which are computationally inefficient and can increase the latency of SDVN as the network size grows. In this paper, we propose a novel hybrid algorithm for routing in SDVNs with two modes: the highest stable least delay mode and the highest stable shortest path mode, in which the mode is selected by estimating the network contention. We distinctly identify two communication channels in the vehicular network as wired and wireless, where network link entropy is formulated accordingly and is used in combination with pending transmissions to estimate collision probability and average network contention. We use the prospect of machine learning to predict the wireless link lifetimes and one-hop channel delays, which yield very low Root Mean Square Errors (RMSEs), depicting their very high accuracy, and the wireless link lifetime prediction using deep learning yields a much lower average computational time compared to an optimization-based approach. The proposed novel algorithm selects only stable links by comparing them with a link lifetime threshold whose optimum value is decided experimentally. We propose this routing framework to be compatible with the OpenFlow protocol, where we modify the flow table architecture to incorporate a route valid time and send a packet_in message to the controller when the route’s lifetime expires, requesting new flow rules. We further propose a flow table update algorithm to map computed routes to flow table entries, where we propose to incorporate an adaptive approach for route finding and flow rule updating upon reception of a packet_in message in order to minimize the computational burden at the controller and minimize communication overhead associated with control plane communication. This research contributes a novel hybrid routing framework for the existing SDVN paradigm, scrutinizing machine learning to predict the lifetime and delay of heterogeneity links, which can be readily integrated with the OpenFlow protocol for better routing applications, improving the performance of the SDVN. We performed realistic vehicular network simulations using the network simulator 3 by obtaining vehicular mobility traces using the Simulation of Urban Mobility (SUMO) tool, where we collected data sets for training the machine learning models using the simulated environment in order to test models in terms of RMSE and computational complexity. The proposed routing framework was comparatively assessed against existing routing techniques by evaluating the communication cost, latency, channel utilization, and packet delivery ratio. According to the results, the proposed routing framework results in the lowest communication cost, the highest packet delivery ratio, the least latency, and moderate channel utilization, on average, compared to routing in VANET using Ad Hoc On-demand Distance Vector (AODV) and routing in SDVN using Dijkstra; thus, the proposed routing framework improves routing in SDVN. Furthermore, results show that the proposed routing framework is enhanced with increasing routing frequency and network size, as well as at low vehicular speeds.

FEAROL: Aging Flow Entries Based on Local Staircase Randomized Response for Secure SDN Flow Tables

Software-Defined Networking (SDN) systems are sensitive to the lifespans of flow entries in flow tables as such lifespans affect the overall network-forwarding latency and the flow table space usage, particularly when the systems are under cyber attack. Instead of developing extra approaches to reactively detect the attacks and mitigate the impact of the attacks, this paper views the lifespans of flow entries as the privacy of the SDN systems and proposes a Flow-Entry Aging RandOmization Layer (FEAROL), which applies the staircase randomized response mechanism in the flow-entry-aging process at switches. FEAROL locally perturbs the lifespan of each flow entry in the flow table. Since the true lifespan of each flow entry is different from the lifespan set in the entry by the controller and dynamically perturbed by FEAROL, Low-rate Denial-of-Service (LDoS) attacks based on the sniffed flow-entry timeouts cannot be effectively organized. FEAROL proactively prevents LDoS attacks from overflowing the flow tables and legitimate flow packets from being dropped due to the broken synchronization between attack flows and the network settings. FEAROL can adjust its aging policies and privacy budget based on the real-time monitored network performance. FEAROL is prototyped in an open-source soft switch (OpenVSwitch) and evaluated through simulations on real network traces. The results show that FEAROL increases the overhead of aging a flow entry. However, this overhead can be significantly reduced by adjusting the interval at which the aging process is triggered. FEAROL also effectively defends against flow table overflow LDoS attacks by significantly reducing the table usage of LDoS attack flows. When the aging strategy is carefully chosen, the table space used by attack flow entries can be reduced to 0.

DDoS ATTACK DETECTION METHODS BASED ON DEEP LEARNING IN HEALTHCARE

Software-defined network (SDN) is a new network structure, which has the characteristics of centralized management and programmable, and is widely used in the field of Internet of things. Distributed denial of service (DDoS) attack is one of the most threatening attacks in SDN network. How to effectively detect DDoS attacks has become a research hotspot in the field of SDN security management. Aiming at the above problems, this paper proposes a DDoS attack detection method based on Deep belief network (DBN) in SDN network architecture. By extracting the characteristics of OpenFlow switch flow table entries, DBN algorithm is trained to detect whether there are DDoS attacks. The experimental results show that the method is better than the other algorithms in accuracy, precision and recall.

Enhancing Software-Defined Networks with Intelligent Controllers to Improve First Packet Processing Period

Software-Defined Networking (SDN) has a detailed central model that separates the data plane from the control plane. The SDN controller is in charge of monitoring network security and controlling data flow. OpenFlow-enabled routers and switches work as packet-forwarding devices in the network system. At first, OpenFlow forwarding devices like routers and switches do not know how to handle the data packets transmitted by the host. This is because they do not have any security controls, policies, or information. These packets are sent to their destination. In this situation, the OpenFlow forwarding device sends the first data packet of a host to the SDN controller, which checks the control packets for the data packet and creates flow entries in the switch flow table to act on the following categories of data packets coming from the host. These activities at the SDN controller and switch levels are time-intensive, and the first data packet from the host always takes a longer time to reach its destination. In this article, we suggest an SDN controller with instant flow entries (SDN-CIFE) to reduce the amount of time it takes for the host to transmit its first data packet. Before traffic comes from the host, our method adds the necessary flow entries to the flow table of the OpenFlow switch. The technique was made in Python and tested on a Mininet network emulator using the RYU controller. The results of the experiment show that the time it takes to process the first data packet is reduced by more than 83%.

Skyrmion based 3D low complex runtime reconfigurable architecture design methodology of universal logic gate

In this study, we introduce the area efficient low complex runtime reconfigurable architecture design methodology based on Skyrmion logic for universal logic gate (ULG) i.e. NOR/NAND implementation using micromagnetic simulations. We have modelled the two input 3D device structure using bilayer ferromagnet/heavy metal where the magnetic tunnel junctions inject and detect the input and output skyrmions by exploiting the input reversal mechanism. The implementation of NOR and NAND is performed using this same device where it is reconfigured runtime with enhanced tunability by the ON and OFF state of current passing through a non magnetic metallic gate respectively. This gate acts as a barrier for skyrmion motion (additional control mechanism) to realize the required Skyrmion logic output states. To the best of authors’s knowledge the boolean optimizations and the mapping logic have been presented for the first time to demonstrate the functionalities of the NOR/NAND implementation. This proposed architecture design methodology of ULG leads to reduced device footprint with regard to the number of thin film structures proposed, low complexity in terms of fabrication and also providing runtime reconfigurability to reduce the number of physical designs to achieve all truth table entries (∼75% device footprint reduction). The proposed 3D ULG architecture design benefits from the miniaturization resulting in opening up a new perspective for magneto-logic devices.