By Topic

Fault-tolerant ring embedding in a star graph with both link and node failures

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yu-Chee Tseng ; Dept. of Comput. Sci. & Inf. Eng., Nat. Central Univ., Chung-Li, Taiwan ; Shu-Hui Chang ; Jang-Ping Sheu

The star graph interconnection network has been recognized as an attractive alternative to the hypercube network. Previously, the star graph has been shown to contain a Hamiltonian cycle. In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe⩽n-3 faulty links, a Hamiltonian cycle still can be found in an n-star, and that with fv⩽n-3 faulty nodes, a ring containing at most 4fv nodes less than that in a Hamiltonian cycle can be found (i.e. the ring contains at least n!-4fv nodes). In general, in an n-star with fe faulty links and fv faulty nodes, where fe+fv⩽n-3, our embedding is able to establish a ring containing at least n!-4fv nodes

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:8 ,  Issue: 12 )