Stochastic Link-Fault-Tolerant Routing in Hypercubes
نویسندگان
چکیده
منابع مشابه
Probability-based Fault-tolerant Routing in Hypercubes
This paper describes a new fault-tolerant routing algorithm for the hypercube, using the concept of probability vectors. To compute these vectors, a node first determines its faulty set, which represents the set of all its neighbouring nodes that are faulty or unreachable due to faulty nodes or links. Each node then calculates a probability vector, where the kth element represents the probabili...
متن کاملA fault tolerant routing scheme for hypercubes
An efficient distributed fault-tolerant routing algorithm for the hypercube is proposed based on the existence of a complete set of node-disjoint paths between any two nodes. Node failure and repairs may occur dynamically provided that the total number of faulty nodes at any time is less than the node-connectivity n of the n-cube. Each node maintains for each possible destination which of the a...
متن کاملAdaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
We present an adaptive deadlock-free routing algorithm which decomposes a given network into two virtual interconnection networks, V IN 1 and V IN 2. V IN 1 supports deterministic deadlock-free routing, and V IN 2 supports fully-adaptive routing. Whenever a channel in V IN 1 or V IN 2 is available, it can be used to route a message. Each node is identiied to be in one of three states: safe, uns...
متن کاملOptimal Fault-Tolerant Routing in Hypercubes Using Extended Safety Vectors
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer of dimension n is associated with an extended safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. In the extended safety vector model, each node knows ...
متن کاملFault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes
Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advances in Computer Networks
سال: 2016
ISSN: 1793-8244
DOI: 10.18178/jacn.2016.4.2.211