48,985 research outputs found
Edge-Fault Tolerance of Hypercube-like Networks
This paper considers a kind of generalized measure of fault
tolerance in a hypercube-like graph which contain several well-known
interconnection networks such as hypercubes, varietal hypercubes, twisted
cubes, crossed cubes and M\"obius cubes, and proves for any with by the induction on
and a new technique. This result shows that at least edges of
have to be removed to get a disconnected graph that contains no vertices of
degree less than . Compared with previous results, this result enhances
fault-tolerant ability of the above-mentioned networks theoretically
High threshold distributed quantum computing with three-qubit nodes
In the distributed quantum computing paradigm, well-controlled few-qubit
`nodes' are networked together by connections which are relatively noisy and
failure prone. A practical scheme must offer high tolerance to errors while
requiring only simple (i.e. few-qubit) nodes. Here we show that relatively
modest, three-qubit nodes can support advanced purification techniques and so
offer robust scalability: the infidelity in the entanglement channel may be
permitted to approach 10% if the infidelity in local operations is of order
0.1%. Our tolerance of network noise is therefore a order of magnitude beyond
prior schemes, and our architecture remains robust even in the presence of
considerable decoherence rates (memory errors). We compare the performance with
that of schemes involving nodes of lower and higher complexity. Ion traps, and
NV- centres in diamond, are two highly relevant emerging technologies.Comment: 5 figures, 12 pages in single column format. Revision has more
detailed comparison with prior scheme
Unidirectional Quorum-based Cycle Planning for Efficient Resource Utilization and Fault-Tolerance
In this paper, we propose a greedy cycle direction heuristic to improve the
generalized redundancy quorum cycle technique. When applied using
only single cycles rather than the standard paired cycles, the generalized
redundancy technique has been shown to almost halve the necessary
light-trail resources in the network. Our greedy heuristic improves this
cycle-based routing technique's fault-tolerance and dependability.
For efficiency and distributed control, it is common in distributed systems
and algorithms to group nodes into intersecting sets referred to as quorum
sets. Optimal communication quorum sets forming optical cycles based on
light-trails have been shown to flexibly and efficiently route both
point-to-point and multipoint-to-multipoint traffic requests. Commonly cycle
routing techniques will use pairs of cycles to achieve both routing and
fault-tolerance, which uses substantial resources and creates the potential for
underutilization. Instead, we use a single cycle and intentionally utilize
redundancy within the quorum cycles such that every point-to-point
communication pairs occur in at least cycles. Without the paired
cycles the direction of the quorum cycles becomes critical to the fault
tolerance performance. For this we developed a greedy cycle direction heuristic
and our single fault network simulations show a reduction of missing pairs by
greater than 30%, which translates to significant improvements in fault
coverage.Comment: Computer Communication and Networks (ICCCN), 2016 25th International
Conference on. arXiv admin note: substantial text overlap with
arXiv:1608.05172, arXiv:1608.05168, arXiv:1608.0517
- …