Comparative study of product networks

Abdel Elah Al-Ayyoub, Khaled Day

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The Cartesian product of interconnection networks has been investigated recently as a method for combining desirable properties of component networks. This paper presents a unified framework for obtaining and comparing properties of a virtually unlimited number of product networks. This work complements results appeared in the literature for product networks and conducts a comparative study between several networks including hyper-cubes, meshes, star graphs, deBruijn networks, product-shuffle networks, hyper-Petersen networks, mesh-connected-trees, hyper-deBruijn networks, dBCubes, star-cube networks, and hyperstar networks. The comparison is based on network scalability, broadcasting cost, embedding of other topologies, VLSI layout, cost/performance ratio, and other static parameters such as degree, diameter, and number of links.

Original languageEnglish
Pages (from-to)1-18
Number of pages18
JournalJournal of Parallel and Distributed Computing
Volume62
Issue number1
DOIs
Publication statusPublished - 2002

Fingerprint

Stars
Comparative Study
Network components
Broadcasting
Scalability
Costs
Topology
Regular hexahedron
VLSI Layout
Hypertree
Star Graph
Mesh Networks
Shuffle
Interconnection Networks
Cartesian product
Star
Complement
Mesh

Keywords

  • Cost/performance
  • Embedding
  • Interconnection networks
  • Product networks

ASJC Scopus subject areas

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

Cite this

Comparative study of product networks. / Al-Ayyoub, Abdel Elah; Day, Khaled.

In: Journal of Parallel and Distributed Computing, Vol. 62, No. 1, 2002, p. 1-18.

Research output: Contribution to journalArticle

Al-Ayyoub, Abdel Elah ; Day, Khaled. / Comparative study of product networks. In: Journal of Parallel and Distributed Computing. 2002 ; Vol. 62, No. 1. pp. 1-18.
@article{c83b1ddde2b14e6980e9d535ded94eec,
title = "Comparative study of product networks",
abstract = "The Cartesian product of interconnection networks has been investigated recently as a method for combining desirable properties of component networks. This paper presents a unified framework for obtaining and comparing properties of a virtually unlimited number of product networks. This work complements results appeared in the literature for product networks and conducts a comparative study between several networks including hyper-cubes, meshes, star graphs, deBruijn networks, product-shuffle networks, hyper-Petersen networks, mesh-connected-trees, hyper-deBruijn networks, dBCubes, star-cube networks, and hyperstar networks. The comparison is based on network scalability, broadcasting cost, embedding of other topologies, VLSI layout, cost/performance ratio, and other static parameters such as degree, diameter, and number of links.",
keywords = "Cost/performance, Embedding, Interconnection networks, Product networks",
author = "Al-Ayyoub, {Abdel Elah} and Khaled Day",
year = "2002",
doi = "10.1006/jpdc.2001.1770",
language = "English",
volume = "62",
pages = "1--18",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - Comparative study of product networks

AU - Al-Ayyoub, Abdel Elah

AU - Day, Khaled

PY - 2002

Y1 - 2002

N2 - The Cartesian product of interconnection networks has been investigated recently as a method for combining desirable properties of component networks. This paper presents a unified framework for obtaining and comparing properties of a virtually unlimited number of product networks. This work complements results appeared in the literature for product networks and conducts a comparative study between several networks including hyper-cubes, meshes, star graphs, deBruijn networks, product-shuffle networks, hyper-Petersen networks, mesh-connected-trees, hyper-deBruijn networks, dBCubes, star-cube networks, and hyperstar networks. The comparison is based on network scalability, broadcasting cost, embedding of other topologies, VLSI layout, cost/performance ratio, and other static parameters such as degree, diameter, and number of links.

AB - The Cartesian product of interconnection networks has been investigated recently as a method for combining desirable properties of component networks. This paper presents a unified framework for obtaining and comparing properties of a virtually unlimited number of product networks. This work complements results appeared in the literature for product networks and conducts a comparative study between several networks including hyper-cubes, meshes, star graphs, deBruijn networks, product-shuffle networks, hyper-Petersen networks, mesh-connected-trees, hyper-deBruijn networks, dBCubes, star-cube networks, and hyperstar networks. The comparison is based on network scalability, broadcasting cost, embedding of other topologies, VLSI layout, cost/performance ratio, and other static parameters such as degree, diameter, and number of links.

KW - Cost/performance

KW - Embedding

KW - Interconnection networks

KW - Product networks

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

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

U2 - 10.1006/jpdc.2001.1770

DO - 10.1006/jpdc.2001.1770

M3 - Article

AN - SCOPUS:0036190141

VL - 62

SP - 1

EP - 18

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 1

ER -