(Enter summary)
Abstract: The concept of strong fault-tolerance was introduced to
characterize the property of parallel routing [15]. A network
G of degree d is said strongly fault-tolerant if with at
most d 2 faulty nodes, any two nodes u and v in G are
connected by minfdeg f (u); deg f (v)g node-disjoint paths,
where deg f (u) and deg f (v) are the numbers of non-faulty
neighbors of the nodes u and v in G, respectively. We show
that the hypercube networks are strongly fault-tolerant and
develop an algorithm that... (Update)
Context of citations to this paper: More
...hypercube networks, do not seem to have this nice decomposition structure. For example, in the construction of node disjoint paths in a hypercube network with faults, we seemed not able to construct each path using a separated subcube, which has made the construction more involved...
Cited by: More
Strong Fault-Tolerance: Parallel Routing in Star Networks with.. - Oh, Chen (2001)
(Correct)
Active bibliography (related documents): More All
0.7: Hypercube Network Fault Tolerance: A Probabilistic Approach - Chen, Kanj, Wang
(Correct)
0.4: Fault-Diameter of the Star-Connected Cycles.. - de Azevedo.. (1995)
(Correct)
0.4: Packet Routing in Fixed-Connection Networks: A Survey - Grammatikakis, Hsu.. (1998)
(Correct)
Similar documents based on text: More All
0.6: Optimal Parallel Routing in Star Networks - Chen, Chen (1997)
(Correct)
0.3: Sublinear-Time Parallel Algorithms for Matching and Related .. - Goldberg, Plotkin, M. (1993)
(Correct)
0.3: n-Cube Network: Node Disjoint Shortest Paths for Maximal.. - Gonzalez, Serena (2002)
(Correct)
BibTeX entry: (Update)
E. Oh and J. Chen, Parallel routing in hypercube networks with faulty nodes, Manuscript, (2000). http://citeseer.ist.psu.edu/oh00parallel.html More
@inproceedings{ oh01parallel,
author = "Eunseuk Oh and Jianer Chen",
title = "Parallel Routing in Hypercube Networks with Faulty Nodes",
booktitle = "{ICPADS}",
pages = "338-345",
year = "2001",
url = "citeseer.ist.psu.edu/oh00parallel.html" }
Citations (may not include all citations):
104
Topological properties of hypercubes (context) - Saad, Schultz - 1988
40
On representatives of subsets (context) - Hall - 1935
34
A comparative study of topological properties of hypercubes .. (context) - Day, Tripathi - 1994
32
A Survey of Modern Algebra (context) - Birkhoff, MacLane - 1965
19
Reliable broadcast in hypercube multicomputers (context) - Ramanathan, Shin - 1988
18
Adaptive fault-tolerant routing in hypercube multi-computers (context) - Chen, Shin - 1990
10
Asymptotically optimal broadcasting and gossiping in faulty .. (context) - Fraigniaud - 1992
5
Interleaved all-to-all reliable broadcast on meshes and hype.. (context) - Lee, Shin - 1990
5
Routing and broadcasting in faulty hypercube computers (context) - Lee, Hayes - 1988
5
A fault-tolerant routing strategy in hypercube multicomputer.. (context) - Chiu, Wu - 1996
5
Combinatorial analysis of the fault-diameter of the n-cube (context) - Latifi - 1993
4
A topological property of hypercubes: node disjoint paths (context) - Madhavapeddy, Sudborough - 1990
4
Fault diameter of interconnection networks (context) - Krishnamoorthy, Krishnamurthy - 1987
2
Nearly optimal one-to-many parallel routing in star networks (context) - Chen, Chen - 1997
2
Optimal algorithms for nodeto -node fault tolerant routing i.. (context) - Gu, Peng - 1996
1
All-to-all broadcasting in faulty hypercubes (context) - Park, Bose - 1997
1
Strong fault-tolerance: parallel routing in star networks wi..
- Oh, Chen - 2001
1
An efficient algorithm for the k-pairwise disjoint paths pro.. (context) - Gu, Peng - 2000
Documents on the same site (http://www.cs.tamu.edu/people/eunseuko/publication.html):
Strong Fault-Tolerance: Parallel Routing in Star Networks with.. - Oh, Chen (2001)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC