Wormhole Broadcast in Star Graph networks
First page number:
Last page number:
We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is derived and efficient algorithms are developed to achieve broadcasting in O(n) communication time in a star graph Sn (with n! nodes which is sublogarithmic in the number of nodes in the network).
Cayley graphs; Computer algorithms; Computer network resources; Computer networks; Routing (Computer network management); Wormhole routing
Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | 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.
Wormhole Broadcast in Star Graph networks.
Parallel Computing, 24(8),