Near optimal broadcast in all-port wormhole routed hypercubes using error correcting codes
A new broadcasting method is presented for hypercubes with wormhole routing mechanism. The approach is based on determination of the set of nodes (called stations) in the hypercube such that for any node in the network there is a station at distance of at most 1. Once stations are identified, parallel disjoint paths are formed from the source to all stations. The broadcasting is accomplished first by sending the message to all stations which will in turn inform the rest of the nodes of the message. To establish node-disjoint paths between the source node and all stations, we introduce a new routing strategy. We prove that multicasting can be done in one routing step as long as the number of destination nodes are fewer than or equal to n in an n-dimensional hypercube. The number of broadcasting steps using our routing is equal to or smaller than that obtained in an earlier work.
Computer networks; Hypercube networks (Computer networks); Multicasting (Computer networks); Wormhole routing
Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | Other Electrical and Computer Engineering | 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.
Srimani, P. K.
Near optimal broadcast in all-port wormhole routed hypercubes using error correcting codes.
IEEE International Performance, Computing and Communications, 1998