Search

The task of router alias resolution for IPv4 networks presents a formidable challenge in the realm of router-level topology inference. Despite the considerable potential exhibited by machine-learning-based alias-resolution methods for IPv4 networks, several constraints impede their effectiveness. These constraints include a low discovery rate of aliased IPs, a failure to account for router aggregation, and a dearth of valid features in current schemes. In this study, we introduce a novel alias resolver, AliasClassifier, which is based on the Random Forest model and the alias triangulation algorithm. This innovative model identifies the key six features from a set of four prevalent routing behaviors that are typically employed to distinguish aliased IPs from non-alienated IPs. Subsequently, the AliasClassifier aggregates aliased IP pairs into routers using an alias triangulation algorithm. Experimental results demonstrate that AliasClassifier excels in discovering aliased IPs in IPv4 networks, boasting a resolution accuracy as high as 94.8% and a recall rate of 40.4%. Its comprehensive performance significantly surpasses that of state-of-the-art alias resolvers such as TreeNET, MLAR, and APPLE. Furthermore, as a typical centralized alias parser, AliasClassifier's deployment cost is remarkably low. Consequently, AliasClassifier emerges as an ideal tool for router alias resolution in large-scale IPv4 networks. [ABSTRACT FROM AUTHOR]

Wireless sensor networks have gradually attracted widespread attention from academia and industry due to their wide application potential and versatility. In response to the coverage and routing issues of wireless sensor networks, this study combines the improved cuckoo algorithm and non-uniform clustering algorithm to design a coverage and routing optimization scheme for wireless sensor networks. Firstly, a wireless sensor network system is studied and built. Subsequently, the traditional cuckoo algorithm is optimized using the Cauchy distribution, and a coverage optimization scheme for wireless sensor networks based on the Cauchy distribution improved cuckoo algorithm is designed. Finally, by optimizing the dynamic range of network area and cluster radius respectively to improve the shortcomings of non-uniform clustering routing algorithms, a wireless sensor networks routing optimization scheme based on dynamic cluster radius optimization non-uniform clustering algorithm is designed. The research results indicated that the designed coverage scheme and routing scheme achieved good application results. Among them, the designed coverage scheme had a minimum running time of 0.89 minutes in node coverage problems and a maximum node coverage rate of 99.52%. The designed routing scheme had a minimum running time of 1.47 minutes and an energy loss rate of 0.84% in the routing optimization problem. In summary, the coverage scheme and routing optimization scheme designed by this research institute have good application effects and can provide certain technical support for the application of wireless sensor networks in other fields.

The semiconductor industry has seen significant technological advancements, leading to an increase in the number of processing cores in a system-on-chip (SoC). To facilitate communication among the numerous on-chip cores, a network-on-chip (NoC) is employed. One of the main challenges of designing NoCs is power management since the NoC consumes a significant portion of the total power of the SoC. Among the power-intensive components of the NoC, routers stand out. We observe that some power-intensive components of routers, responsible for implementing turn in the mesh topology, are underutilized compared to others. Therefore, we propose Tulip, a turn-free low-power network-in-chip, that avoids within-router turns by removing the corresponding components from the router structure. On a turn (e.g., at the end of the current dimension), Tulip forces the packet to be ejected and then reinjects it to the next dimension channel (i.e., the beginning of the path along the next dimension). Due to its deadlock-free nature, Tulip's scheme may be used orthogonally with any deterministic, partially-adaptive, and fully-adaptive routing algorithms, and can easily be extended for any n-dimensional mesh topology. Our analysis reveals that Tulip can reduce the static power and area by 24%−50% and 25%-55%, respectively, for 2D-5D mesh routers. [ABSTRACT FROM AUTHOR]

A network on a chip is a solitary silicon chip utilized to perform the communication characteristics of large-scale (LSI) to very large-scale integration (VLSI) systems. Network-on-chip (NoC) architecture includes links, network interfaces (NI), and routers to unite with external memories or processors. NoC is designed to flow messages from the source module to the destination module through several links involving routing decisions. The design of NoC is complex and the buffer section's expensiveness creates problems while providing secured data service. Moreover, routers and links in NoC setups are liable to faults. This work introduces a minimal buffered router, and the faults in the network are optimized using moth flame optimized (MFO) fault-tolerant technique. The software named Xilinx ISE design suite 14.5 is employed for the minimum buffered router model. The suggested scheme is operated with less area, low power (0.241 mW), and high speed (965.261 Megahertz (MHz)) when matched with previous works. [ABSTRACT FROM AUTHOR]

The chip application has become the trending element in all digital applications because of its easy and flexible use. However, chip-based communication’s chief demerits are power consumption and delay. The huge data broadcasting often raises these two problems in Network-onChip (NoC) architecture. So, the present research work has aimed to create a novel Strawberry-based Recurrent neural (SbRN) framework for minimizing the NoC buffer length and reducing the latency and power consumption. Here, the fitness of Strawberry was utilized to sense the large data size; once the large data size was identified, the compression process was started to compress the data. Moreover, the NoC architecture was designed with an optimized buffer with strawberry fitness. Once the compressed data was present in the network medium, it allowed broadcasting to the other end. If the data is not compressed or not in the minimum compression range, the compression process was again to optimize the data buffer. Finally, the proposed architecture was validated with other conventional schemes and has gained the best outcome by reducing 5% of device utilization and 0.5% of power consumption than other methods. [ABSTRACT FROM AUTHOR]

In this paper we describe the development of a small, office-friendly CNC machine. We compare popular CNC archetypes and their ability to be operated in a non-workshop environment. We have made an enclosed machine that is safe both for the operator and people nearby and clean to use, with outer walls fully integrated into the frame for improved rigidity. We made some unique design decisions for increasing the working area without sacrificing stiffness in a small form factor CNC. [ABSTRACT FROM AUTHOR]

The multi-Fano interference, which is obtained through the simultaneous acquisition of bright and dark states in different phase transitions of Eu3+ : BiPO4 (7 : 1, 6 : 1, 1 : 1, and 0.5 : 1) and Eu3+ : NaYF4 (1 : 1/4) crystals, were reported in this work. Multidressed spontaneous four-wave mixing and multidressed fluorescence (multiorder) were adopted to optimize the strong photon–phonon nested dressing effect, which results in more obvious multi-Fano interference. Firstly, the multi-Fano is produced through interference in continuous and multibound states. Secondly, five multi-Fano dips are originated from the nested five dressings (one photon and four phonons) under symmetrical splitting of 7F1 energy level. It is found that the pure H-phase (0.5 : 1) sample exhibits the strongest photon–phonon dressed effect (five Fano dips). Further, high-order non-Hermitian exceptional points in multi-Fano interference were investigated by adjusting the ratio of Rabi frequency to dephase rate through nested photon and phonon dressing. The experimental results are validated by theoretical simulations, which may be applied to designing optoelectronic devices such as non-Hermitian multi-Fano interferences (multichannel) router.

Time-correlated single-photon counting (TCSPC) is a powerful technique for time-resolved measurement of fast and weak light signals used in a variety of scientific fields, including biology, medicine, and quantum cryptography. Unfortunately, given its repetitive nature, TCSPC is recognized as a relatively slow technique. In the last ten years, attempts have been made to speed it up by developing multichannel integrated architectures. Yet, for the solutions proposed thus far, the measurement speed has not increased proportionally to the number of channels, reducing the benefits of a multichannel approach. Recent theoretical studies and prototypes have shown that it is possible to implement a new multichannel architecture, so-called router-based architecture, capable of optimizing the efficiency of data transfer from the integrated chip to the data processor, increasing the overall measurement speed. However, the first implementations failed to achieve the theoretical results due to implementation flaws. In this paper, we present a new logic for the router-based architecture that can operate at the same laser frequency and solve the issues of the previous implementation. Alongside the new logic, we present a new integrated low-jitter delay line combined with a new method for timing-signal distribution that allows the proper management of the pixel timing information. The new implementation is a step closer to realizing a router-based architecture that achieves the expected theoretical results. Simulations and bench tests support the results here reported. [ABSTRACT FROM AUTHOR]

The quasi-delay-insensitive (QDI) based asynchronous network-on-chip (ANoC) has several advantages over clock-based synchronous network-onchips (NoCs). The asynchronous router uses a virtual channel (VC) as a primary flow-control mechanism however, the spatial division multiplexing (SDM) based mechanism performs better over input traffics over VC. This manuscript uses an asynchronous spatial division multiplexing (ASDM) based router for NoC architecture on a field-programmable gate array (FPGA) platform. The ASDM router is configurable to different bandwidths and VCs. The ASDM router mainly contains input-output (I/O) buffers, a switching allocator, and a crossbar unit. The 4-phase 1-of-4 dual-rail protocol is used to construct the I/O buffers. The performance of the ASDM router is analyzed in terms of lower urinary tract symptoms (LUTs) (chip area), delay, latency, and throughput parameters. The work is implemented using Verilog-HDL with Xilinx ISE 14.7 on artix-7 FPGA. The ASDM router achieves < 1% chip area and obtains 0.8 ns of latency with a throughput of 800 Mfps. The proposed router is compared with existing asynchronous approaches with improved latency and throughput metrics. [ABSTRACT FROM AUTHOR]

To ensure the safety and correctness of the critical ‘mimic bracket’ components such as protocol proxies of mimic routers, a BGP (border gateway protocol) proxy was designed and implemented, and formal methods were applied to verify the safety and correctness of the BGP proxy.The BGP packets communicated between the peer routers and the master actor were monitored by the BGP proxy.The BGP sessions with the slave actors on behalf of peer routers were established, ensuring the consistency of the BGP protocol states for all actors.The formal specification of the BGP proxy was written based on separation logic.The VeriFast theorem prover was used to prove that the program had no memory safety problems such as null pointer reference.Furthermore, the formal verification of high-level attributes of each module in BGP proxy was also conducted to strictly ensure that the implementation met the specification.The implementation to proof code ratio of BGP proxy is about 1.8:1, and the implementation to proof labor hour ratio is about 1:3.The formally verified BGP proxy consume 0.16 seconds to process 100 000 BGP routes, which is about 7 times as long as the unverified one.Works done provide a reference for applying formal methods to verify the safety and correctness of critical components in mimic defense equipment and systems.

Network‐on‐Chip (NoC) is a key component in chip multiprocessors (CMPs) as it supports communication between many cores. NoC is a network‐based communication subsystem on an integrated circuit, most typically between modules in a system on a chip (SoC). Designing a reliable NoC against failures that can prevent failure using some measures or preventing error or system failure while failure happens and proper performance became a significant concern. For a reliable design against failures, first, the system should be analysed to discover the critical points. Hence, in this research, it is tried first to investigate the scale of fault tolerance effect on the mechanism in the router on the network by injecting simulated errors, and then these errors are prevented. As the major novelty, the authors implemented a router on a synchronised network and calculated the network buffering fault tolerance by injecting error in the buffer. Specifically, a new method for improving fault tolerance is proposed, which uses the existing resources efficiently. So, it does not impose any overhead on hardware and improves the error tolerance scale. The authors also evaluate it from different perspectives to show its superior performance. [ABSTRACT FROM AUTHOR]

We proposed a new scheme of multichannel quantum routing for single plasmons (SPs) using the cross-type plasmonic waveguides (PWs) that couples to four two-level InGaAs quantum dots (QDs). In our proposed system, each of two PWs in cross type can be infinite silver nanowire. We theoretically studied the routing properties of the proposed system for the incident SPs by using the real-space formalism. Our results show that in such a coupled system, the routing of incident SPs can be achieved depending on several physical parameters, such as the detuning of the transition frequencies of QDs from the frequency of propagating SPs, the coupling strengths of the QDs to PWs and the separation distance between the QDs. It is shown that the transmission of SPs can be switched on or off by adjusting the separation distance between the QDs, which could be exploited to probe the spacing between the QDs. It is also shown that the transfer rate of SPs can be switchable and redirected by appropriately adjusting the QDs' separation distance and coupling strengths, which is a prerequisite for quantum routers. Our multichannel scheme for the routing of the SPs could be utilized for making quantum devices realizable, such as quantum routers, quantum filters, directional couplers and quantum switches. [ABSTRACT FROM AUTHOR]

On-chip topological nanophotonic filtering and routing devices are important components of integrated nanophotonic chip. The device filters topological photonic states with multiple frequencies and routes them into different output ports, respectively. However, there is no effective method to implement such devices to date. Here, an on-chip topological five-channel filtering and routing device is realized for the first time. Topological edge states are constructed based on synthetic dimension, which can use dielectric materials to construct topological photonic states without external magnetic field. This method has advantages including simple structure, easy integration, and high signal-to-noise ratio. The implementation of on-chip topological multichannel filtering and routing device is of great significance to the development of topological nanophotonic devices.

Copyright of Journal on Communication / Tongxin Xuebao is the property of Journal on Communications Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We report a fiber loop quantum buffer based on a low-loss 2 × 2 switch and a unit delay made of a fiber delay line. We characterize the device by using a two-photon polarization entangled state in which one photon of the entangled photon pair is stored and retrieved at a repetition rate up to 78 kHz. The device, which enables integer multiples of a unit delay, can store the qubit state in a unit of fiber delay line up to 5.4 km and the number of loop round-trips up to 3. Furthermore, we configure the device with other active elements to realize integer multiplier and divider of a unit delay of a qubit. The quantum state tomography is performed on the retrieved photon and its entangled photon. We obtain a state fidelity ${\gt}$ 94 $\%$ with a maximum storage time of 52 μ s with an insertion loss of 5.56 dB. To further characterize the storing and retrieving processes of the device, we perform entanglement-assisted quantum process tomography on the buffered qubit state. The process fidelity of the device is ${\gt}$ 0.98. Our result implies that the device preserves the superposition and entanglement of a qubit state from a two-photon polarization-entangled state. This is a significant step towards facilitating applications in optical asynchronous transfer mode based quantum networks.

Network-on-Chip (NoC) is one of the basic chip designs with advantages and challenges especially when the number of transistors increases and the data transfer rate across network is important. For these reasons, Photonic Network-on-Chip was proposed. These networks are important for intra chip communication. The data transfer with photonics between devices with long distance on the chip without any transfer rate loss is one of the most important advantages of Photonic Network-on-Chip. This paper reviews basic and fundamental concepts of Network-on-Chip and Photonic Network-on-Chip to understand their key points of designs and rules for implementation. [ABSTRACT FROM AUTHOR]

The mimic defense technology in cyberspace is a new active defense technology based on dynamic heterogeneous redundancy. By introducing multiple heterogeneous redundant executants, the generalized robustness is enhanced. By implementing policies or periodic scheduling for multiple executants, the uncertain changes of characteristics are presented externally to enhance security. The security of routing protocol is an important part of network security. OSPF protocol is the most widely deployed and most complex routing protocol in the real network world. The most urgent problem for network devices that supports mimic defense is how to realize the equivalence of OSPF protocol functions among various heterogeneous implementations. Firstly, the design of mimic defense is described scientifically, the architecture of router supporting mimic defense is described in detail, and the processing method of OSPF protocol in the mimic defense architecture is discussed in depth. The OSPF protocol proxy is introduced to realize the equivalence of OSPF protocol functions among various heterogeneous implementations. The feasibility and effectiveness of this method are verified in a router prototype that supports mimic defense. Finally, the security risks of routers under the conditions of two classic OSPF routing attacks are specifically explained and verified by experiments, which effectively improves the ability to deal with OSPF network attacks. [ABSTRACT FROM AUTHOR]

We have proposed a new multi-channel scheme of quantum routing for single plasmons (SPs) with two two-level InGaAs quantum dots (QDs) placed at the junctions of H-type plasmonic waveguides (PWs), two of which are infinite, and the rest is a finite silver nanowire. We investigated theoretically the routing properties of the proposed system for the incident SPs via the real-space approach. Our results show that in such a coupled system, the incident single plasmons can be routed by controlling the parameters, such as the detuning, the atomic transition frequencies, the coupling strengths between the QDs and PWs, and the spacing between QDs. We also showed that the transmission of SPs can be switched on or off by properly adjusting the distance between the two QDs, which could be exploited to probe the distance between the QDs. Our multi-channel scheme for routing and switching of SPs could be utilized for realizing quantum devices, such as quantum routers, quantum switches, quantum filters, and directional couplers. [ABSTRACT FROM AUTHOR]

Time-correlated single-photon counting (TCSPC) is a powerful technique for time-resolved measurement of fast and weak light signals used in a variety of scientific fields, including biology, medicine, and quantum cryptography. Unfortunately, given its repetitive nature, TCSPC is recognized as a relatively slow technique. In the last ten years, attempts have been made to speed it up by developing multichannel integrated architectures. Yet, for the solutions proposed thus far, the measurement speed has not increased proportionally to the number of channels, reducing the benefits of a multichannel approach. Recent theoretical studies and prototypes have shown that it is possible to implement a new multichannel architecture, so-called router-based architecture, capable of optimizing the efficiency of data transfer from the integrated chip to the data processor, increasing the overall measurement speed. However, the first implementations failed to achieve the theoretical results due to implementation flaws. In this paper, we present a new logic for the router-based architecture that can operate at the same laser frequency and solve the issues of the previous implementation. Alongside the new logic, we present a new integrated low-jitter delay line combined with a new method for timing-signal distribution that allows the proper management of the pixel timing information. The new implementation is a step closer to realizing a router-based architecture that achieves the expected theoretical results. Simulations and bench tests support the results here reported.

High-performance multicast packet switching technologies are evolving to meet the growing demand for scalability on the Internet and datacenters, etc. Implementing a high-performance switch/router relies on a polynomial-time group membership query algorithm within the Packet Forwarding Engines (PFEs) to determine whether a packet is forwarded through an egress. Among these, Bloom filter (BF)-based and Residue Number System (RNS)-based are being considered as two representatives of the membership query algorithms. However, both approaches suffer from some fatal weaknesses such as false-positive probability and time inefficiencies, especially for a carrier-grade PFE with high port-density features. According to similar properties of the RNS, we propose a simplified forwarding algorithm in this paper, named Per-Port Prime Filter Array (P3FA). The simulation results indicate that the P3FA can significantly improve space efficiencies under specific lower egress-diversities conditions. Under the same space constraints, P3FA improves multicast and unicast time efficiency by 1 to 4 orders of magnitude in the port-density 16–1024 range compared to previous works. Although it comes at the expense of hardware cost, it is still acceptable compared to recently improved previous work. [ABSTRACT FROM AUTHOR]

With the ever-increasing deployment of 5G and IoT, the number of end-hosts/terminals is increasing rapidly, so that routers have to cache more and more forwarding entries to guarantee communication reachability of these terminals, which makes Ternary Content Addressable Memory (TCAM)-based routers keep expanding resource requirements. However, the design and implementation of large-capacity TCAM-based routers are faced with such challenges: difficult circuit design, high production cost and energy consumption, thereby posing an urgent requirement on a lightweight TCAM that can still maintain those massive communication connections. In this paper, we aim to design a lightweight router with small storage requirement while still retaining the original communication connection performance, which is not straightforward due to the following two challenges: First, under the condition of massive sequential flow data, it’s difficult to accurately and timely select the entries to cache for a small capacity TCAM. Second, given the strict prefix matching principle, how to efficiently insert the selected entries into TCAM is also challenging. To address these problems, we propose A&B: an AI-based Routing entry prediction strategy (AIR) and a Block-based entry Insertion Tactic (BIT). AIR can precisely select entries by conducting accurate entry predictions, which converts dynamic flow-based prediction into stable and parallelizable entry-based prediction by decoupling spatio-temporal characteristics. BIT optimizes entry insertion by isolating TCAM into several blocks, thus eliminating the time-consuming entry movements. The experiment results based on real backbone traffic show that our lightweight A&B achieves comparable performance compared to the traditional schemes by using only 1/8 TCAM storage. [ABSTRACT FROM AUTHOR]

Purpose. At present, the computer networks of the information and telecommunication system (ITS) of railway transport use the OSPF protocol, which does not allow taking into account several metrics when determining the optimal route. Therefore, there is a need to study the possibility of organizing routing in computer networks of rail transport ITS using a two-colonial ant algorithm. Methodology. According to the Two-ACO software model, created in the Python language based on the two-colonial ant algorithm, the optimal route in a computer network was determined. Two-ACO model inputs: computer network parameters (network adjacency matrix, number of routers); parameters of the ant algorithm (number of iterations; number of ants in the colony; number of elite ants; initial pheromone level; evaporation rate; parameter for adjusting the amount of pheromone deposition). Findings. The results of the Two-ACO model are presented in the form of graphs depicting the optimal paths: the criterion of the total delay on the routers (for the first colony of ants) and the number of hops (for the second colony of ants). Originality. According to the created Two-ACO software model for a computer network of 7 routers and 17 channels, a study of the time for determining the optimal path in a computer network by the number of ordinary and elite ants, evaporation rate and deposited pheromone was conducted. It is determined that it is enough to use the number of ants equal to the number of routers and have 2 elite ants in the colony, with 1000 iterations, evaporation rate from 0.2 to 0.7, and pheromone deposition by ants close to one. Practical value. Created Two-ACO software model using two colonies of ants on the following criteria: the total delay on the routers (for the first colony of ants) and the number of hops that make up the route (for the second colony of ants) allows you to parallel determine the optimal routes in a computer network of railway transport. It is estimated that for a computer network of 15 routers and 17 channels, it is sufficient to have 30 agents (two ants on top), the value of the pheromone deposited by the agents is close to one, and the evaporation rate is 0.4.