network hardware engineers

Abstract: TCP-SYN port scanning often precedes cyber-attacks, and early detection of scanner fingerprints embedded in packet headers can provide timely intrusion alerts. Existing approaches are either too computationally expensive for line-rate operation or limited to offline analysis. This brief presents a lightweight FPGA architecture for reconfigurable line-rate fingerprint detection, where each fingerprint is compiled into a shallow Boolean LUT tree, enabling parallel evaluation with constant two-cycle latency regardless of fingerprint count, while resource cost grows linearly with fingerprint count. This detection core is decoupled from a MAC-layer frontend that performs streaming field extraction with no frame buffering or higher-layer state, allowing deployment across different line rates by modifying only the frontend. A Python framework automatically compiles Boolean expressions into synthesizable HDL, eliminating manual RTL changes. For TCP-SYN port-scan fingerprint detection, the architecture uses approximately 0.5% LUTs at 10 Gbps on a Versal VCK190 for 18 deployed fingerprints, with capacity for over 2,000 concurrent fingerprints, and under 2.5% on a Virtex-6 at 1 Gbps, with a detection latency of 10 ns at both rates, three to four orders of magnitude below typical per-packet processing latency in software intrusion-detection systems. The system was cross-validated against a software re-implementation on an 8-hour production packet trace, confirming detection correctness with zero false positives/negatives.

Abstract: In this paper, we examine the energy efficiency (EE) of a base station (BS) with multiple antennas. We use a state-of-the-art power consumption (PC) model that captures the passive and active parts of the transceiver circuitry, including the effects of radiated power, signal processing, and passive consumption. The paper treats the transmit power, bandwidth, and number of antennas as the optimization variables. We provide novel closed-form solutions for the optimal ratios of power per unit bandwidth and power per transmit antenna, and discover a new relationship in which the radiated power equals the total transceiver power at the EE-optimal operating point. A central finding is that the EE-optimal signal-to-noise ratio (SNR) collapses to a universal numerical constant of approximately 5.93 dB, independent of channel and hardware parameters. We present an algorithm that jointly optimizes the three design variables to achieve maximum EE under practical constraints, and provide analytical insight into whether maximum power or maximum bandwidth is optimal and how many antennas a BS should utilize. We further extend the optimization framework to incorporate quality-of-service (QoS) requirements and three advanced sleep modes of varying depth: absolute sleep, deep sleep, and idle mode. We characterize the optimal hardware configuration for each mode and determine when the rush-to-sleep strategy, which transmits briefly at the EE-optimal active configuration and sleeps the rest of the time, is optimal. Incorporating wake-up transition delays, we reveal how latency constraints and sleep-mode-specific transition times jointly dictate the optimal sleep mode for data packets with absolute deadlines. Together, these results indicate that energy-efficient operation requires treating transmission and sleep as a single coupled optimization.

Abstract: Degree-six triangular-lattice interconnection networks offer substantial minimal-path diversity, but their additional directions complicate deadlock-free routing under wormhole flow control. We study a finite hexagon-shaped mesh and its periodic torus quotient in a common six-direction coordinate system. For the finite mesh, we construct a minimal partially adaptive routing relation that uses one virtual channel and forbids only two directed turns. For the torus, we prove that every source-destination pair has a unique closest lattice lift, but that the same two-turn physical routing relation still has a cyclic one-VC resource CDG for every n >= 3. We eliminate this residual periodic dependency by combining two virtual channels with Hamiltonian coordinates and group-specific datelines. Each same-group segment crosses its dateline at most once, which permits a global rank on VC-labelled channel resources. We prove minimal all-pairs connectivity for both physical routing relations and acyclicity of the complete resource CDG for the proposed one-VC mesh and two-VC torus constructions. For a single static bidirectional link failure known before a routing epoch, we further rotate the turn rule toward the failed orientation and replace a failed hop by a same-group two-hop triangle bypass. This restricted extension preserves all-pairs connectivity and the original VC counts, with at most one additional hop relative to the healthy shortest-path distance.