Abstract
At present, most of the proposed architectures for interconnecting nodes in processor networks are based on graph topologies. In this paper we study topologies based on the hypergraph theory, taking advantage of the wavelength division multiplexing (WDM) that allows the huge bandwidth of optical fiber to be divided into several high-speed logical channels. We show that our topologies compare very well against graph-based ones, in terms of maximum hop distance, expandability, and connectivity. Furthermore, they use a constant number of transceivers per node, and a sub-linear number of multiplexed channels. We also give schemes for some global routing operations: the one-to-all and the all-to-all broadcast, analyzing their performance in hops.
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.
