13,161 research outputs found
On strong fault tolerance (or strong Menger-connectivity) of multicomputer networks
As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network fault tolerance, the strong fault tolerance (or strong Menger-connectivity)in multicomputer networks, and study the strong fault tolerance for popular multicomputer network structures. Let G be a network in which all nodes have degree d. We say that G is strongly fault tolerant if it has the following property: Let Gf be a copy of G with at most d - 2 faulty nodes. Then for any pair of non-faulty nodes u and v in Gf , there are min{degf (u), degf (v)} node-disjoint paths in Gf from u to v, where degf (u) and degf (v) are the degrees of the nodes u and v in Gf, respectively.
First we study the strong fault tolerance for the popular network structures such as star networks and hypercube networks. We show that the star networks and the hypercube networks are strongly fault tolerant and develop efficient algorithms that construct the maximum number of node-disjoint paths of nearly optimal or optimal
length in these networks when they contain faulty nodes. Our algorithms are optimal in terms of their time complexity. In addition to studying the strong fault tolerance, we also investigate a more realistic concept to describe the ability of networks for tolerating faults. The traditional definition of fault tolerance, sustaining at most d - 1faulty nodes for a regular graph G of degree d, reflects a very rare situation. In many cases, there is a chance
that a routing path between two given nodes can be constructed though the network may have more faulty nodes than its degree. In this dissertation, we study the fault tolerance of hypercube networks under a probability model. When each node of the n-dimensional hypercube network has an independent failure probability p, we develop algorithms that, with very high probability, can construct a fault-free path
when the hypercube network can sustain up to 2np faulty nodes
The Small Stellated Dodecahedron Code and Friends
We explore a distance-3 homological CSS quantum code, namely the small
stellated dodecahedron code, for dense storage of quantum information and we
compare its performance with the distance-3 surface code. The data and ancilla
qubits of the small stellated dodecahedron code can be located on the edges
resp. vertices of a small stellated dodecahedron, making this code suitable for
3D connectivity. This code encodes 8 logical qubits into 30 physical qubits
(plus 22 ancilla qubits for parity check measurements) as compared to 1 logical
qubit into 9 physical qubits (plus 8 ancilla qubits) for the surface code. We
develop fault-tolerant parity check circuits and a decoder for this code,
allowing us to numerically assess the circuit-based pseudo-threshold.Comment: 19 pages, 14 figures, comments welcome! v2 includes updates which
conforms with the journal versio
- …