Multicasting in Generalized Multistage Interconnection Networks

S. Bhattacharya, G. Elsesser, W. T. Tsai, D. Z. Du

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Multistage interconnection networks (MIN) are popular in switching and communication applications. It is also well known as a hypercube derived architecture, offering a fixed-degree alternative to hypercube for a large class of applications. Message routing strategy in MIN is well known, however, multicasting issues for MIN has not been considered. This paper formulates the multicasting problem for MIN. We demonstrate that reordering the dimensions in MIN can lead to traffic reduced multicasting. This leads to the formulation of optimality criteria in MIN multicast operation. Traffic optimum multicasting in MIN is shown as a NP-Complete problem. We present a polynomial time greedy heuristic to generate traffic reduced multicast in MIN. The greedy approach generates a locally optimum solution. Analytical study and simulation results are presented showing the traffic reduction that can be obtained using our approach over traditional linearly ordered dimensions approach.

Original languageEnglish (US)
Pages (from-to)80-95
Number of pages16
JournalJournal of Parallel and Distributed Computing
Volume22
Issue number1
DOIs
StatePublished - Jul 1994
Externally publishedYes

Fingerprint

Multistage Interconnection Networks
Multicasting
Telecommunication traffic
Traffic
Multicast
Hypercube
Computational complexity
Polynomials
Greedy Heuristics
Reordering
Communication
Optimality Criteria
Polynomial time
Routing
NP-complete problem
Linearly
Formulation

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Hardware and Architecture
  • Computer Science Applications

Cite this

Multicasting in Generalized Multistage Interconnection Networks. / Bhattacharya, S.; Elsesser, G.; Tsai, W. T.; Du, D. Z.

In: Journal of Parallel and Distributed Computing, Vol. 22, No. 1, 07.1994, p. 80-95.

Research output: Contribution to journalArticle

Bhattacharya, S. ; Elsesser, G. ; Tsai, W. T. ; Du, D. Z. / Multicasting in Generalized Multistage Interconnection Networks. In: Journal of Parallel and Distributed Computing. 1994 ; Vol. 22, No. 1. pp. 80-95.
@article{8e4c11b4ba034156b07595a7f25cbd48,
title = "Multicasting in Generalized Multistage Interconnection Networks",
abstract = "Multistage interconnection networks (MIN) are popular in switching and communication applications. It is also well known as a hypercube derived architecture, offering a fixed-degree alternative to hypercube for a large class of applications. Message routing strategy in MIN is well known, however, multicasting issues for MIN has not been considered. This paper formulates the multicasting problem for MIN. We demonstrate that reordering the dimensions in MIN can lead to traffic reduced multicasting. This leads to the formulation of optimality criteria in MIN multicast operation. Traffic optimum multicasting in MIN is shown as a NP-Complete problem. We present a polynomial time greedy heuristic to generate traffic reduced multicast in MIN. The greedy approach generates a locally optimum solution. Analytical study and simulation results are presented showing the traffic reduction that can be obtained using our approach over traditional linearly ordered dimensions approach.",
author = "S. Bhattacharya and G. Elsesser and Tsai, {W. T.} and Du, {D. Z.}",
year = "1994",
month = "7",
doi = "10.1006/jpdc.1994.1071",
language = "English (US)",
volume = "22",
pages = "80--95",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Multicasting in Generalized Multistage Interconnection Networks

AU - Bhattacharya, S.

AU - Elsesser, G.

AU - Tsai, W. T.

AU - Du, D. Z.

PY - 1994/7

Y1 - 1994/7

N2 - Multistage interconnection networks (MIN) are popular in switching and communication applications. It is also well known as a hypercube derived architecture, offering a fixed-degree alternative to hypercube for a large class of applications. Message routing strategy in MIN is well known, however, multicasting issues for MIN has not been considered. This paper formulates the multicasting problem for MIN. We demonstrate that reordering the dimensions in MIN can lead to traffic reduced multicasting. This leads to the formulation of optimality criteria in MIN multicast operation. Traffic optimum multicasting in MIN is shown as a NP-Complete problem. We present a polynomial time greedy heuristic to generate traffic reduced multicast in MIN. The greedy approach generates a locally optimum solution. Analytical study and simulation results are presented showing the traffic reduction that can be obtained using our approach over traditional linearly ordered dimensions approach.

AB - Multistage interconnection networks (MIN) are popular in switching and communication applications. It is also well known as a hypercube derived architecture, offering a fixed-degree alternative to hypercube for a large class of applications. Message routing strategy in MIN is well known, however, multicasting issues for MIN has not been considered. This paper formulates the multicasting problem for MIN. We demonstrate that reordering the dimensions in MIN can lead to traffic reduced multicasting. This leads to the formulation of optimality criteria in MIN multicast operation. Traffic optimum multicasting in MIN is shown as a NP-Complete problem. We present a polynomial time greedy heuristic to generate traffic reduced multicast in MIN. The greedy approach generates a locally optimum solution. Analytical study and simulation results are presented showing the traffic reduction that can be obtained using our approach over traditional linearly ordered dimensions approach.

UR - http://www.scopus.com/inward/record.url?scp=38149147375&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149147375&partnerID=8YFLogxK

U2 - 10.1006/jpdc.1994.1071

DO - 10.1006/jpdc.1994.1071

M3 - Article

AN - SCOPUS:38149147375

VL - 22

SP - 80

EP - 95

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 1

ER -