Hon-Chan Chen

Fault-tolerant routing on the star graph with safety vectors

The concept of a safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on a hypercube is based on the distance between a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances between two pairs of nodes are the same. Thus, on star graphs, we define the safety vector based on the routing path patterns. Based on this concept of routing path patterns, we first define an undirected safety vector, which is a 1D vector on each node. In addition, we propose some methods for solving some problems concerning the safety vectors of the star graph, such as the length of the safety vectors and the ranking of the routing path patterns.

2-Disjoint-path-coverable panconnectedness of crossed cubes

The crossed cube is a popular network topology because it possesses many attractive topological properties and its diameter is about half that of the hypercube. Typically, a network topology is modeled as a graph whose vertices and edges represent processors and communication links, respectively. We define a graph

A linear time algorithm for finding depth-first spanning trees on trapezoid graphs

G

A note on path embedding in crossed cubes with faulty vertices

G to be

The panpositionable panconnectedness of crossed cubes

2

Identifying Restricted-Faults in Multiprocessor Meshes under the PMC Diagnostic Model

2-disjoint-path-coverably