On the routing problem in faulty supercubes

Arunabha Sen, Abhijit Sengupta, Subir Bandyopadhyay

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

The supercube network, a generalization of the hypercube, was introduced by A. Sen (Acta Inform. 26 (1989) 741-748). The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper analyzes the properties of a supercube in presence of node failures. We compute the fault diameter and develop the routing algorithm in a faulty supercube.

Original languageEnglish (US)
Pages (from-to)39-46
Number of pages8
JournalInformation Processing Letters
Volume42
Issue number1
DOIs
StatePublished - Apr 27 1992

Fingerprint

Routing Problem
Routing algorithms
Hypercube
Routing Algorithm
Vertex of a graph
Connectivity
Fault
Generalization

Keywords

  • connectivity
  • fault diameter
  • Fault tolerance
  • network topology
  • routing algorithm

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On the routing problem in faulty supercubes. / Sen, Arunabha; Sengupta, Abhijit; Bandyopadhyay, Subir.

In: Information Processing Letters, Vol. 42, No. 1, 27.04.1992, p. 39-46.

Research output: Contribution to journalArticle

Sen, Arunabha ; Sengupta, Abhijit ; Bandyopadhyay, Subir. / On the routing problem in faulty supercubes. In: Information Processing Letters. 1992 ; Vol. 42, No. 1. pp. 39-46.
@article{7cb777f3ae8546b1ba9156dea5543e74,
title = "On the routing problem in faulty supercubes",
abstract = "The supercube network, a generalization of the hypercube, was introduced by A. Sen (Acta Inform. 26 (1989) 741-748). The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper analyzes the properties of a supercube in presence of node failures. We compute the fault diameter and develop the routing algorithm in a faulty supercube.",
keywords = "connectivity, fault diameter, Fault tolerance, network topology, routing algorithm",
author = "Arunabha Sen and Abhijit Sengupta and Subir Bandyopadhyay",
year = "1992",
month = "4",
day = "27",
doi = "10.1016/0020-0190(92)90130-N",
language = "English (US)",
volume = "42",
pages = "39--46",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - On the routing problem in faulty supercubes

AU - Sen, Arunabha

AU - Sengupta, Abhijit

AU - Bandyopadhyay, Subir

PY - 1992/4/27

Y1 - 1992/4/27

N2 - The supercube network, a generalization of the hypercube, was introduced by A. Sen (Acta Inform. 26 (1989) 741-748). The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper analyzes the properties of a supercube in presence of node failures. We compute the fault diameter and develop the routing algorithm in a faulty supercube.

AB - The supercube network, a generalization of the hypercube, was introduced by A. Sen (Acta Inform. 26 (1989) 741-748). The main advantage of this network is that it has the same connectivity and diameter as that of the hypercube without the constraint that the number of nodes be a power of 2. This paper analyzes the properties of a supercube in presence of node failures. We compute the fault diameter and develop the routing algorithm in a faulty supercube.

KW - connectivity

KW - fault diameter

KW - Fault tolerance

KW - network topology

KW - routing algorithm

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

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

U2 - 10.1016/0020-0190(92)90130-N

DO - 10.1016/0020-0190(92)90130-N

M3 - Article

AN - SCOPUS:0026844006

VL - 42

SP - 39

EP - 46

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -