Logo image
Avoiding Malicious Nodes of a 3-D NoC with Security-Aware Priority-Based Routing
Conference proceeding   Open access

Avoiding Malicious Nodes of a 3-D NoC with Security-Aware Priority-Based Routing

Alec Aversa, Hasin Ishraq Reefat, Naghmeh Karimi and Ioannis Savidis
GLSVLSI '25: Proceedings of the Great Lakes Symposium on VLSI 2025, pp 478-485
29 Jun 2025
url
https://doi.org/10.1145/3716368.3735242View
Published, Version of Record (VoR)Open Access via Drexel Libraries Read and Publish Program 2025CC BY V4.0 Open

Abstract

In heterogeneous three-dimensional Network-on-Chip (3-D NoC) systems, security threats arise from malicious nodes in untrusted dies that disrupt data flow and leak proprietary information. To mitigate such risks, a security-aware priority-based packet routing algorithm is proposed. The developed routing methodology prioritizes routing security sensitive data packets through trusted dies. The algorithm dynamically computes a cost metric that accounts for router utilization, distance between the source and destination nodes, directions of traversal, and packet priority, and determines whether data is routed via a slower but secure path or a faster yet compromised path. High-priority packets are reliably delivered, while low-priority packets that tolerate delay traverse untrusted dies. When high-priority packets are sparse and the untrusted die is placed as the middle plane of a three-tier 3-D IC stack, the algorithm reduces high-priority packet hops in the untrusted die by approximately , averaged across flit sizes and packet generation rates, while the increase in average packet latency and dynamic power consumption is and , respectively. Running t-tests to compare ZXYZ routing and the proposed routing algorithm yield p-values of 0.3347 and 0.6322 for average packet latency and dynamic power consumption, respectively, which indicates no significant difference in performance and power consumption.

Metrics

5 Record Views

Details

Logo image