Abstract
We propose a new family of interconnection topology that can be used to design communication architecture for distributed systems with an arbitrary number of computing nodes. The design is based on a novel generalization of the well known hypercube graphs. The proposed topology is shown to be incrementally extensible in steps of 1 (cost of restructuring or adding edges is very low), optimally fault tolerant and its diameter is logarithmic in the number of nodes. Moreover, for any given number of nodes, the difference of the maximum and the minimum degree of a node in the graph is ≤1, i.e., the graph is almost regular. A shortest routing algorithm for the proposed family of graphs has been developed.
Sign-in/Register to access full text options 
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.
