Product-closed networks

Khaled Day, Abdel Elah Al-Ayyoub

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

We present a uniform mathematical characterization of interconnection network classes referred to as product-dosed networks (PCN). A number of popular network classes fall under this characterization including binary hypercubes, tori, k-ary n-cubes, meshes, and generalized hypercubes. An unlimited number of other networks can be defined using the presented mathematical characterization. An important common feature for all PCN classes is their closure under the Cartesian product of graphs. This provides a tool for generating new PCN classes of interconnection graphs. We evaluate a number of commonly used metrics for all PCN networks including the size, degree, diameter, average distance, connectivity, and fault diameter. We show how all PCN networks share various desirable properties such as simple distributed routing, hierarchical structure, complete sets of node-disjoint paths between arbitrary nodes, attractive embeddings, distributed broadcasting, and fault tolerance properties. The proposed characterization provides a unified model for representing and further analyzing the various known PCN networks, and for building new ones with predetermined properties and characteristics.

Original languageEnglish
Pages (from-to)323-338
Number of pages16
JournalJournal of Systems Architecture
Volume45
Issue number4
Publication statusPublished - Dec 1 1998

Fingerprint

Fault tolerance
Broadcasting

Keywords

  • Broadcasting
  • Cartesian product of graphs
  • Embedding
  • Hierarchical structure
  • Interconnection networks
  • Node-disjoint paths
  • Routing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Day, K., & Al-Ayyoub, A. E. (1998). Product-closed networks. Journal of Systems Architecture, 45(4), 323-338.

Product-closed networks. / Day, Khaled; Al-Ayyoub, Abdel Elah.

In: Journal of Systems Architecture, Vol. 45, No. 4, 01.12.1998, p. 323-338.

Research output: Contribution to journalArticle

Day, K & Al-Ayyoub, AE 1998, 'Product-closed networks', Journal of Systems Architecture, vol. 45, no. 4, pp. 323-338.
Day K, Al-Ayyoub AE. Product-closed networks. Journal of Systems Architecture. 1998 Dec 1;45(4):323-338.
Day, Khaled ; Al-Ayyoub, Abdel Elah. / Product-closed networks. In: Journal of Systems Architecture. 1998 ; Vol. 45, No. 4. pp. 323-338.
@article{f5894186620d4e57b07d1f846e2c36bc,
title = "Product-closed networks",
abstract = "We present a uniform mathematical characterization of interconnection network classes referred to as product-dosed networks (PCN). A number of popular network classes fall under this characterization including binary hypercubes, tori, k-ary n-cubes, meshes, and generalized hypercubes. An unlimited number of other networks can be defined using the presented mathematical characterization. An important common feature for all PCN classes is their closure under the Cartesian product of graphs. This provides a tool for generating new PCN classes of interconnection graphs. We evaluate a number of commonly used metrics for all PCN networks including the size, degree, diameter, average distance, connectivity, and fault diameter. We show how all PCN networks share various desirable properties such as simple distributed routing, hierarchical structure, complete sets of node-disjoint paths between arbitrary nodes, attractive embeddings, distributed broadcasting, and fault tolerance properties. The proposed characterization provides a unified model for representing and further analyzing the various known PCN networks, and for building new ones with predetermined properties and characteristics.",
keywords = "Broadcasting, Cartesian product of graphs, Embedding, Hierarchical structure, Interconnection networks, Node-disjoint paths, Routing",
author = "Khaled Day and Al-Ayyoub, {Abdel Elah}",
year = "1998",
month = "12",
day = "1",
language = "English",
volume = "45",
pages = "323--338",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Product-closed networks

AU - Day, Khaled

AU - Al-Ayyoub, Abdel Elah

PY - 1998/12/1

Y1 - 1998/12/1

N2 - We present a uniform mathematical characterization of interconnection network classes referred to as product-dosed networks (PCN). A number of popular network classes fall under this characterization including binary hypercubes, tori, k-ary n-cubes, meshes, and generalized hypercubes. An unlimited number of other networks can be defined using the presented mathematical characterization. An important common feature for all PCN classes is their closure under the Cartesian product of graphs. This provides a tool for generating new PCN classes of interconnection graphs. We evaluate a number of commonly used metrics for all PCN networks including the size, degree, diameter, average distance, connectivity, and fault diameter. We show how all PCN networks share various desirable properties such as simple distributed routing, hierarchical structure, complete sets of node-disjoint paths between arbitrary nodes, attractive embeddings, distributed broadcasting, and fault tolerance properties. The proposed characterization provides a unified model for representing and further analyzing the various known PCN networks, and for building new ones with predetermined properties and characteristics.

AB - We present a uniform mathematical characterization of interconnection network classes referred to as product-dosed networks (PCN). A number of popular network classes fall under this characterization including binary hypercubes, tori, k-ary n-cubes, meshes, and generalized hypercubes. An unlimited number of other networks can be defined using the presented mathematical characterization. An important common feature for all PCN classes is their closure under the Cartesian product of graphs. This provides a tool for generating new PCN classes of interconnection graphs. We evaluate a number of commonly used metrics for all PCN networks including the size, degree, diameter, average distance, connectivity, and fault diameter. We show how all PCN networks share various desirable properties such as simple distributed routing, hierarchical structure, complete sets of node-disjoint paths between arbitrary nodes, attractive embeddings, distributed broadcasting, and fault tolerance properties. The proposed characterization provides a unified model for representing and further analyzing the various known PCN networks, and for building new ones with predetermined properties and characteristics.

KW - Broadcasting

KW - Cartesian product of graphs

KW - Embedding

KW - Hierarchical structure

KW - Interconnection networks

KW - Node-disjoint paths

KW - Routing

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

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

M3 - Article

VL - 45

SP - 323

EP - 338

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 4

ER -