The Routing Techniques in HPC Interconnection Networks for the Parallel and Distributed Systems
Year: 2026
Type: article
Abstract: This paper presents a comprehensive analysis of routing technique for interconnection networks and proposes a costenergy-based route selection algorithm called Congestion Aware Adaptive Routing (CAAR).The aim of this study is to identify the shortcomings of traditional routing algorithms and design an efficient route selection algorithm that balances energy consumption, delay and data packet delivery rate.The proposed algorithm is compared with Dijkstra, AODV, DSR, and other energy-based methods.The results show that traditional methods based solely on shortest paths are insufficient to maintain network energy balance and long-term stability.The CAAR algorithm comprehensively considers cost, energy availability and network congestion conditions, effectively improving the stability and service life of interconnection networks by reducing energy consumption, reducing delay and increasing packet delivery efficiency.This success is primarily due to its comprehensive consideration of cost, energy conditions, and network congestion levels when selecting routes.This algorithm will improve the interconnection network stability and lifetime by avoiding energy-constrained or heavily utilized nodes.
Institution: Awadhesh Pratap Singh University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7203822271