CFP last date
20 October 2026
Call for Paper
November Edition
IJCA solicits high quality original research papers for the upcoming November edition of the journal. The last date of research paper submission is 20 October 2026

Submit your paper
Know more
The week's pick
Responsive image
Contextual Sentiment Analysis of Airbnb Customer Reviews in Albania: An Investigation of BERT-based Classification

Blerina Zanaj Serxhio Kurti Elma Zanaj
Random Articles
Reseach Article

The Routing Techniques in HPC Interconnection Networks for the Parallel and Distributed Systems

by Bhimnarayan Tiwari, Surya Prakash Pandey, Rakesh Kumar Katare
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 187 - Number 136
Year of Publication: 2026
Authors: Bhimnarayan Tiwari, Surya Prakash Pandey, Rakesh Kumar Katare
10.5120/ijca0c802d373b43

Bhimnarayan Tiwari, Surya Prakash Pandey, Rakesh Kumar Katare . The Routing Techniques in HPC Interconnection Networks for the Parallel and Distributed Systems. International Journal of Computer Applications. 187, 136 ( Aug 2026), 10-15. DOI=10.5120/ijca0c802d373b43

@article{ 10.5120/ijca0c802d373b43,
author = { Bhimnarayan Tiwari, Surya Prakash Pandey, Rakesh Kumar Katare },
title = { The Routing Techniques in HPC Interconnection Networks for the Parallel and Distributed Systems },
journal = { International Journal of Computer Applications },
issue_date = { Aug 2026 },
volume = { 187 },
number = { 136 },
month = { Aug },
year = { 2026 },
issn = { 0975-8887 },
pages = { 10-15 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume187/number136/the-routing-techniques-in-hpc-interconnection-networks-for-the-parallel-and-distributed-systems/ },
doi = { 10.5120/ijca0c802d373b43 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2026-08-20T21:55:02.660763+05:30
%A Bhimnarayan Tiwari
%A Surya Prakash Pandey
%A Rakesh Kumar Katare
%T The Routing Techniques in HPC Interconnection Networks for the Parallel and Distributed Systems
%J International Journal of Computer Applications
%@ 0975-8887
%V 187
%N 136
%P 10-15
%D 2026
%I Foundation of Computer Science (FCS), NY, USA
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
  1. 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
  2. Agrawal, D. P., & Zeng, Q. A. (2010). Introduction to wireless and mobile systems (3rd ed.). Cengage Learning.
  3. 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
  4. 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
  5. Kim, J., et al. (2014). Routing and flow control in interconnection networks. IEEE Computer. https://doi.org/10.1109/MC.2014.75
  6. Borkar, S. (2011). Exascale computing challenges. In Proceedings of the International Symposium on VLSI Technology. https://doi.org/10.1109/VLSIT.2011.5783764
  7. Hoefler, T., & Snir, M. (2011). Generic topology mapping strategies. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/TPDS.2010.162
  8. Agarwal, A., et al. (2009). Adaptive routing in high performance networks. ACM SIGARCH Computer Architecture News. https://doi.org/10.1145/1555815.1555774
  9. 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
  10. 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
  11. Shalf, J., Dosanjh, S., & Morrison, D. (2011). Exascale computing technology challenges. High Performance Computing.
  12. 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
  13. 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).
  14. Mittal, S. (2014). A survey of techniques for improving energy efficiency in HPC systems. Journal of Parallel and Distributed Computing.
  15. 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
  16. Snir, M., et al. (1998). MPI—The complete reference: The MPI core. MIT Press. https://doi.org/10.7551/mitpress/4230.001.0001
  17. 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
  18. 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
  19. Bhardwaj, P., et al. (2025). Energy-aware routing algorithms for exascale supercomputers. Sustainable Computing. https://doi.org/10.1016/j.suscom.2025.100812
  20. 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
  21. 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
  22. 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
  23. 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
  24. 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
  25. 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
  26. 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.
  27. 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.
  28. 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
  29. 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
  30. 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
Index Terms

Computer Science
Information Sciences

Keywords

HPC Interconnection Networks Congestion Aware Adaptive Routing (CAAR) Routing Techniques Algorithms Adaptive Routing Parallel and Distributed Systems

Powered by PhDFocusTM