Abstract
Alters and Krishnamurthy developed a formal group-theoretic modelCayley graph model, for designing and analyzing proccssor/communication interconnection networks. Using this model they have developed two classes of interconnection networks, the star graph and the pancake graph. Analysis has shown that star graphs are markedly superior to the widely used n-cube. In this paper, applying the concept of internal direct product of groups, we study a family of interconnection networks–product networks. Both the n-cube and the star graph are member of this family of networks. We study such properties of product networks as degree, diameter, connectivity, and fault-tolerance. We show that product networks are hierarchical in structure. Using this hierarchical property we have developed an optimal one-to-all broadcasting algorithm for the product graph.
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.
