Abstract

This paper attempts to derive the performance properties of the Leafycube (LC) interconnection network. The Leafycube is already observed to have quite superior topological properties in comparison to the other contemporary networks. The various performance parameters of the LC network are studied and compared with the existing HC and its variants. The routing and broadcasting algorithms are proposed and the time complexities are also compared. The paper attempts to evaluate the cost effectiveness, reliability and fault tolerance aspects of LC interconnection network in order to justify the novelty in the design of the proposed structure. The leafy structure helps to retain the original hypercube while improving the node packing density in the interconnection network.

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 call

Disclaimer: 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.