Abstract
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicast connections between the network inputs and network outputs. However, due to the complex communication patterns and routing control in multicast networks, there is still a considerably large gap in network cost between the currently best known multicast networks and permutation networks. In this paper, we will present a class of interconnection networks which can support a substantial amount of well-defined multicast patterns in a nonblocking fashion and yet have a comparable cost to permutation networks. We will also provide an efficient routing algorithm for satisfying multicast connection requests in such networks. Moreover, the multicast capability of the networks will be represented as a function of fundamental network structural parameters so that the trade-off between the network multicast capability and the network cost can be determined.
| Original language | English |
|---|---|
| Pages (from-to) | 899-906 |
| Number of pages | 8 |
| Journal | IEEE Transactions on Computers |
| Volume | 47 |
| Issue number | 8 |
| DOIs | |
| State | Published - 1998 |
Keywords
- Collective communication
- Interconnection networks
- Multicast
- Nonblocking
- Routing algorithms
Fingerprint
Dive into the research topics of 'A class of interconnection networks for multicasting'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver