Abstract
A new family of almost regular interconnection topology is proposed that can be defined for an arbitrary number of nodes. The proposed network can be very efficiently used to design communication architecture for distributed systems with an arbitrary number of computing nodes. The design involves a novel generalization of the concept of group based star graphs. The proposed topology is shown to be incrementally extensible in steps of 1 and optimally fault tolerant, and its diameter is sublogarithmic in the number of nodes. We have also developed a simple routing algorithm for any source destination pair of nodes.
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.
