Title

Near-optimal Broadcast in All-port Wormhole-routed Hypercubes Using Error-correcting Codes

Document Type

Article

Publication Date

3-2000

Publication Title

IEEE Transactions on Parallel and Distributed Systems

Volume

11

First page number:

247

Last page number:

260

Abstract

A new broadcasting method is presented for hypercubes with wormhole routing mechanism. The communication model assumed allows an n-dimensional hypercube to have at most n concurrent 110 communications along its ports. It further assumes a distance insensitivity of (n+1) with no intermediate reception capability for the nodes along the communication path. 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 at most 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; this number is optimal for all hypercube dimensions n⩽12, except for n=10

Keywords

Error-correcting codes (Information theory); Hypercube networks (Computer networks); Multicasting (Computer networks); Routing (Computer network management); Wormhole routing

Disciplines

Digital Communications and Networking | Electrical and Computer Engineering | Engineering | Systems and Communications

Language

English

Permissions

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.

Identifier

DOI: http://dx.doi.org/10.1109/71.841741

UNLV article access

Search your library

Share

COinS