Abstract
The proposed network is a pyramid-like network of hypercubes, called pyramided hypercube. A pyramided hypercube containing m levels and having n-cube as basic configuration is denoted by PH(m,n). A PH(m,n) with fixed degree n+2, possesses logarithmic diameter, optimal fault tolerance, and capability of simple routing. The PH(m,n) can be extended smoothly with a constant predefined building block based on its recursive structure such that there is no change in the basic node configuration as we increase the network size. Moreover, links once connected are left undisturbed when the network grows in size. The PH(m,n) is also Hamiltonian.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
