This paper presents a new logical mechanism called as Cluster Based Hierarchical Routing (CBHR) to improve the efficiency of NoC. This algorithm comprises the following steps: 1) the network is segmented logically into clusters with same size or different sizes; 2) algorithms are assigned for internal and global routing; 3) routers working functions are modified logically to support local and global communication. The experiments have conducted for CBHR algorithm for two dimensional mesh and torus architectures. The performance of this mechanism is analyzed and compared with other deterministic and adaptive routing algorithms in terms of energy, throughput with different packet injection ratios.
 ITRS, International Technology Roadmap for Semicon ductors, 2012.
 J. Henkel, W. Wolf and S. T. Chakradhar, “On-Chip Net works: A Scalable, Communicationcentric Embedded Sys tem Design Paradigm,” Proceedings of 17th International Conference on VLSI Design, Mumbai, 5-9 January 2004, p. 845. doi:10.1109/ICVD.2004.1261037
 M. Dehyadgari, M. Nickray, A. Afzali-kusha and Z. Na vabi, “Evaluation of Pseudo Adaptive XY Routing Using an Object Oriented Model for NOC,” Proceedings of the 17th International Conference on Microelectronics, Is lamabad, 13-15 December 2005.
 W. Zhang, L. Hou, J. Wang, S. Geng and W. Wu, “Com parison Research between XY and Odd-Even Routing Algorithm of a 2-Dimension 3X3 Mesh Topology Net work-on-Chip,” Proceedings of the WRI Global Congress on Intelligent Systems (GCIS '09),” Washington DC, 19-21 May 2009, pp. 329-333. doi:10.1109/GCIS.2009.110
 R. Holsmark, S. Kumar, M. Palesi and A. Mejia, “HiRA: A Methodology for Deadlock Free Routing in Hierarchi cal Networks on Chip,” Proceedings of 3rd ACM/IEEE International Symposium on Networks-on-Chip, San Die go, 10-13 May 2009, pp. 2-11.