An efficient tree-based topology for network-on-chip

Performance of the network is measured in the term of throughput. The throughput and efficiency of interconnect depends on network parameters of the topology. Therefore, topology of any communication networks has an important role to play for efficient design of network. This paper considers the design of efficient topology based on binary trees structure. We have obtained degree of proposed topology as 6×(2^n-1)-4/2ⁿ-1, while the diameter of topology is obtained as D=1+2×(n-1). The degree of proposed topology is 25% less than the torus along with drastic reduction in the diameter of proposed topology. The paper also presents an efficient BST based routing algorithm and layout of the proposed topology that could be easily extended for 3-D NoC architectures.