Cart (Loading....) | Create Account
Close category search window
 

K-pairwise cluster fault tolerant routing in hypercubes

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

2 Author(s)
Qian-Ping Gu ; Dept. of Comput. Sci., Aizu Univ., Fukushima, Japan ; Peng, S.

In this paper, we introduce a general fault tolerant routing problem, cluster fault tolerant routing, which is a natural extension of the well studied node fault tolerant routing problem. A cluster is a connected subgraph of a graph G, and a cluster is faulty if all nodes in it are faulty. In cluster fault tolerant routing (abbreviated as CFT routing), we are interested in the number of faulty clusters and the size of the clusters that an interconnection network can tolerate for certain routing problems. As a case study, we investigate the following k-pairwise CFT routing in n-dimensional hypercubes Hn: Given a set of faulty clusters and k distinct nonfaulty node pairs (s1 , t1), ..., (sk, tk) in Hn , find k fault-free node-disjoint paths si→ti , 1⩽i⩽k. We show that Hn can tolerate n-2 faulty clusters of diameter one, plus one faulty node for the k-pairwise CFT routing with k=1. For n⩽4 and 2⩽k⩽[n/2], we prove that H n can tolerate n-2k+1 faulty clusters of diameter one for the k-pairwise CFT routing. We also give an O(kn log n) time algorithm which finds the k paths for the mentioned problem. Our algorithm implies an O(n2 log n) time algorithm for the k-pairwise node-disjoint paths problem in Hn, which improves the previous result of O(n3 log n)

Published in:

Computers, IEEE Transactions on  (Volume:46 ,  Issue: 9 )

Date of Publication:

Sep 1997

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.