Wormhole broadcast in hypercubes
We consider the problem of broadcasting a message in the n-cube, Qn, equipped with wormhole switching. The communication model assumed is one-port, and the broadcasting scheme is path-based whereby, during broadcasting along a path by a node, all the nodes on that path will receive the message. The wormhole path length is m where
Broadcasting; Gray codes; Hypercube networks (Computer networks); Multicasting (Computer networks); Routing (Computer network management); Wormhole routing
Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications
Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.
Lee, M. H.,
Srimani, P. K.
Wormhole broadcast in hypercubes.
Journal of Supercomputing, 15(2),