Generalized shuffle-exchange networks: Combinatorial and fault tolerant properties

Hongfang D Liu, D. Frank Hsu

Research output: Contribution to journalArticle

Abstract

Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and denoted as GS(k, N), where k is the node degree and N is the number of nodes. We study various combinatorial and interconnection properties of GS(k, N) such as diameter, wide-diameter, connectivity, embedding property, and self-routing property. We also study fault tolerant properties of shuffle-exchange networks and propose a modified version of shuffle-exchange networks that improve some of the properties of shuffle-exchange networks.

Original languageEnglish (US)
Pages (from-to)717-733
Number of pages17
JournalDynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms
Volume14
Issue number5
StatePublished - Oct 2007
Externally publishedYes

Fingerprint

Shuffle
Fault-tolerant
Interconnection
Wide Diameter
Vertex of a graph
Interconnection Networks
Connectivity
Routing
Generalise

Keywords

  • Combinatorial property
  • Fault-diameter
  • Fault-tolerant properties
  • Generalized shuffle-exchange network
  • Rabin number
  • Shuffle-exchange network
  • Wide-diameter

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Cite this

@article{4046bbd240b44a2e84ad62f668b870d8,
title = "Generalized shuffle-exchange networks: Combinatorial and fault tolerant properties",
abstract = "Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and denoted as GS(k, N), where k is the node degree and N is the number of nodes. We study various combinatorial and interconnection properties of GS(k, N) such as diameter, wide-diameter, connectivity, embedding property, and self-routing property. We also study fault tolerant properties of shuffle-exchange networks and propose a modified version of shuffle-exchange networks that improve some of the properties of shuffle-exchange networks.",
keywords = "Combinatorial property, Fault-diameter, Fault-tolerant properties, Generalized shuffle-exchange network, Rabin number, Shuffle-exchange network, Wide-diameter",
author = "Liu, {Hongfang D} and Hsu, {D. Frank}",
year = "2007",
month = "10",
language = "English (US)",
volume = "14",
pages = "717--733",
journal = "Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms",
issn = "1492-8760",
publisher = "Watam Press",
number = "5",

}

TY - JOUR

T1 - Generalized shuffle-exchange networks

T2 - Combinatorial and fault tolerant properties

AU - Liu, Hongfang D

AU - Hsu, D. Frank

PY - 2007/10

Y1 - 2007/10

N2 - Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and denoted as GS(k, N), where k is the node degree and N is the number of nodes. We study various combinatorial and interconnection properties of GS(k, N) such as diameter, wide-diameter, connectivity, embedding property, and self-routing property. We also study fault tolerant properties of shuffle-exchange networks and propose a modified version of shuffle-exchange networks that improve some of the properties of shuffle-exchange networks.

AB - Shuffle-exchange networks have been proposed as an attractive choice for interconnection networks. They have constant node degree and sublogarithmic diameter. Several researchers have studied various combinatorial and interconnection properties of them. In this paper, we generalize shuffle-exchange networks and define a new class of networks, called generalized shuffle-exchange network and denoted as GS(k, N), where k is the node degree and N is the number of nodes. We study various combinatorial and interconnection properties of GS(k, N) such as diameter, wide-diameter, connectivity, embedding property, and self-routing property. We also study fault tolerant properties of shuffle-exchange networks and propose a modified version of shuffle-exchange networks that improve some of the properties of shuffle-exchange networks.

KW - Combinatorial property

KW - Fault-diameter

KW - Fault-tolerant properties

KW - Generalized shuffle-exchange network

KW - Rabin number

KW - Shuffle-exchange network

KW - Wide-diameter

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

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

M3 - Article

AN - SCOPUS:35248817004

VL - 14

SP - 717

EP - 733

JO - Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms

JF - Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms

SN - 1492-8760

IS - 5

ER -