Abstract

This paper presents a comprehensive analysis of routing technique for interconnection networks and proposes a cost-energy-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.

References

• Scott, S. L. (1996). Synchronization and communication in the T3E multiprocessor. Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). https://doi.org/10.1145/237090.237140
• Agrawal, D. P., & Zeng, Q. A. (2010). Introduction to wireless and mobile systems (3rd ed.). Cengage Learning.
• Lakshmivarahan, S., Dhall, S. K., & Agrawal, V. K. (1987). Symmetry in interconnection networks based on Cayley graphs. IEEE Transactions on Computers, 36(9), 1038–1047. https://doi.org/10.1109/TC.1987.1676990
• Buyya, R., et al. (2018). High performance computing: Systems and applications. Future Generation Computer Systems. https://doi.org/10.1016/j.future.2017.09.020
• Kim, J., et al. (2014). Routing and flow control in interconnection networks. IEEE Computer. https://doi.org/10.1109/MC.2014.75
• Borkar, S. (2011). Exascale computing challenges. In Proceedings of the International Symposium on VLSI Technology. https://doi.org/10.1109/VLSIT.2011.5783764
• Hoefler, T., & Snir, M. (2011). Generic topology mapping strategies. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/TPDS.2010.162
• Agarwal, A., et al. (2009). Adaptive routing in high performance networks. ACM SIGARCH Computer Architecture News. https://doi.org/10.1145/1555815.1555774
• Linder, D. H., & Harden, J. C. (1991). An adaptive and fault-tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers, 40(1), 2–12. https://doi.org/10.1109/12.65707
• Tamir, Y., & Frazier, G. L. (1992). Dynamically allocated multi-queue buffers for VLSI communication switches. IEEE Transactions on Computers, 41(6), 725–737. https://doi.org/10.1109/12.144888
• Shalf, J., Dosanjh, S., & Morrison, D. (2011). Exascale computing technology challenges. High Performance Computing.
• Kandula, S., Sengupta, S., Greenberg, A., Patel, P., & Chaiken, R. (2009). The nature of data center traffic: Measurements and analysis. In Proceedings of the ACM SIGCOMM Internet Measurement Conference. https://doi.org/10.1145/1644893.1644905
• Hoefler, T., et al. (2010). Characterizing the influence of routing on HPC performance. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC).
• Mittal, S. (2014). A survey of techniques for improving energy efficiency in HPC systems. Journal of Parallel and Distributed Computing.
• Dongarra, J., et al. (2011). The International Exascale Software Project roadmap. The International Journal of High Performance Computing Applications. https://doi.org/10.1177/1094342010391989
• Snir, M., et al. (1998). MPI—The complete reference: The MPI core. MIT Press. https://doi.org/10.7551/mitpress/4230.001.0001
• Sterling, T. L., Anderson, M., & Brodowicz, M. (2017). High performance computing: Modern systems and practices. Morgan Kaufmann. https://doi.org/10.1016/C2015-0-01736-7
• Al-Saadi, M., et al. (2021). Machine learning-based dynamic routing for high-performance interconnects. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/TPDS.2021.3068998
• Bhardwaj, P., et al. (2025). Energy-aware routing algorithms for exascale supercomputers. Sustainable Computing. https://doi.org/10.1016/j.suscom.2025.100812
• Zhang, H., et al. (2025). Machine learning-based fault prediction in large-scale HPC systems. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/TPDS.2025.11304816
• Cong, G., Almasi, G., & Saraswat, V. (2010). Fast PGAS implementation of distributed graph algorithms. In Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC 2010). https://doi.org/10.1109/SC.2010.26
• Patel, S., et al. (2025). A review on high-performance computing architectures and design trends. The Journal of Supercomputing. https://doi.org/10.1007/s11227-025-05891-2
• Katare, R. K., Pandey, S. P., & Katare, C. (2025). Study of structural relationship between vectors using hypercube interconnection network. International Journal of Basic and Applied Sciences, 14(4), 320–329. https://doi.org/10.14419/m7a8kz38
• Pandey, S. P., Katare, R. K., & Charvi, K. (2025). The study of communication networks using vectors of an interconnection network: A review. Proceedings Copyright, 530, 537. https://doi.org/10.5220/0013886000004919
• Pandey, S. P., & Katare, R. K. (2018). Application of fixed-point algorithm in parallel systems. International Journal of Computer Sciences and Engineering, 6(6). https://doi.org/10.26438/ijcse/v6i6.714719
• Katare, R. K., & Chaudhari, N. S. (2008). Study of parallel algorithms for sparse linear systems and different interconnection networks. Journal of Computer, Mathematical Science and Applications. Serial Publications.
• Katare, S., & Kumar, R. (n.d.). A study of interconnection network for parallel and distributed system. BEST: International Journal of Management, Information Technology and Engineering. ISSN 2348-0513.
• Pandey, S. P., Katare, R. K., Charvi, K., Shrivastava, A., & Tiwari, D. (2025). Exploring the structural analysis of the vectors connectivity of Josephus cube interconnection network: A graph theoretic approach. Journal of Information Systems Engineering and Management, 10(3), 1466–1475. https://doi.org/10.52783/jisem.v10i3.7951
• Pandey, S. P., Katare, R. K., Gupta, M. K., & Katare, C. (2025). Study of the structural relationship between the addresses of nodes of an interconnection network. In Proceedings of ICITSM Part I. EAI. https://doi.org/10.4108/eai.28-4-2025.2357929
• Tiwari, B., Pandey, S. P., & Katare, R. K. (2026). Analysis of topological sort algorithm for the connectivity and complexity of an interconnection network. International Journal of Scientific Research in Science, Engineering and Technology, 13(3), 508–514. https://doi.org/10.32628/IJSRSET2613365