Ant colony based routing architecture for minimizing hot spots in NOCs
SBCCI '06 Proceedings of the 19th annual symposium on Integrated circuits and systems design
| Hi-index | 0.00 |
An adaptive routing algorithm based on AntNetalgorithm is designed and implemented with a newrouting table formation scheme. This addresses theunrealistic requirement for global information of theoriginal AntNet algorithm. The new algorithm requireslimited routing information in the routing andtraffic statistics tables. The routers only have themost popular destinations in their routing tables andupdate these destinations at a scheduled time. Eachrouter keeps a traffic table to record data packetsvisiting. Under this approach, a data packet will beforwarded randomly if its destination does not exist inthe routing table. Unlike the original AntNet algorithm,ants and data packets will have time flags toavoid them having infinite lives. Experiments showthat the new approach gives promising results.