This paper presents a new routing algorithm for on-chip networks based on Ant Colony Optimization (ACO) and subnetting. The algorithm uses ACO to find the optimal path for data transmission within subnets, and packets carry pheromone values, similar to how ants lay pheromone trails to guide other ants to food sources. Subnetting is used to divide the network into smaller subnets, reducing routing complexity and improving overall network performance. The productivity of the algorithm was evaluated using the GEM5 Garnet simulator on an 8x8 mesh topology with 64 nodes. The developed ACO-based routing algorithm provides an effective solution for the challenges facing on-chip networks, improving the tradeoff between latency and throughput, reducing network congestion, and improving system scalability.
Paper
Full text
Metaheuristics-Based Routing Optimization in On-Chip Network
Semantic Scholar · Computer Science · 2023
Abstract
This paper presents a new routing algorithm for on-chip networks based on Ant Colony Optimization (ACO) and subnetting. The algorithm uses ACO to find the optimal path for data transmission within subnets, and packets carry pheromone values, similar to how ants lay pheromone trails to guide other ants to food sources. Subnetting is used to divide the network into smaller subnets, reducing routing complexity and improving overall network performance. The productivity of the algorithm was evaluated using the GEM5 Garnet simulator on an 8x8 mesh topology with 64 nodes. The developed ACO-based routing algorithm provides an effective solution for the challenges facing on-chip networks, improving the tradeoff between latency and throughput, reducing network congestion, and improving system scalability.