HIERARCHICAL EXTENDED FffiONACCI CUBES

In this paper, a new interconnection network structure called hierarchical extended Fibonacci cubes interconnection networks HEFCI(n) is proposed, and its properties are evaluated. A set of the HEFC1(n)s constructed by the proposed method is a two level conventional hierarchical network. For each n (dimension of extended Fibonacci cube-Ef Cnnj), a HEFCJ(n) interconnection network can be constructed. All EFCJ(n) for 0 4 are recursively constructible, hence HEFCJ(n)s for n 4 are also recursively constructible with some extra EFCJ(n-l)s and EFC[(n-2)s. Furthermore, since a HEFC\(n) has a hierarchically structured character and the feature of uniformity. a wide variety of inter-cluster connections are possible. The comparisons of HEFCJ(n)s with some of the traditional cubic and hierarchical cubic networks are presented in this study. The routing in HEFC\(n+2)s is as easy as routing in HCN(n,n) and the scalability ofHEFC\(n+2) is betler than the scalability of HCN(n,n) and H(2n). H(2n) and HCN(n,n) are symmetric interconnection networks, however, HEFC1(n+2) is not a symmetric interconnection network and HEFC\(n+2)s have a recurrent structure as H(2n) and HCN(n,n). The cost of HEFC,(n+2) is betler than the costs of HCN(n,n) and H(2n).The edge connectivity of HEFC\(n+2) is worse than the edge connectivity of H(2n)and HCN(n,n). This makes the VLSI design ofHEFC,(n+2) simpler than the VLSIdesigns of H(2nland HCN(n,n).