Fault-tolerant node disjoint routing inn-dimensional hypercube interconnection network.
Item
-
Title
-
Fault-tolerant node disjoint routing inn-dimensional hypercube interconnection network.
-
Identifier
-
AAI9315520
-
identifier
-
9315520
-
Creator
-
Yoon, Kisong.
-
Contributor
-
Adviser: Michael Anshel
-
Date
-
1993
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Computer Science
-
Abstract
-
One property of n-dimensional hypercube interconnection network is that there exist n node disjoint paths between any two arbitrary nodes of Hamming distance k in n-dimensional hypercube, where k paths are of length k and n {dollar}-{dollar} k paths are of length k + 2. A hypercube with faulty elements is called an injured hypercube. There are algorithms which generate those n node disjoint paths. But it is not guaranteed that this algorithms can be used for an injured hypercube. In a hypercube, there are redundant elements which are not used for n node disjoint paths. This redundancy is used for fault tolerant node disjoint routing. In this dissertation, we are looking for conditions of faulty elements guaranteeing the existence of n node disjoint paths using k x k matrix and (n {dollar}-{dollar} k) x (k + 2) matrix for the set of paths of length k and k + 2 respectively, where the entries of the matrices are the bit positions of the address of the nodes in a hypercube.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
