This thesis proposes two new limited global- information-based fault-tolerant routing algorithms for k-ary n-cubes, namely the unsafety vectors algorithm and the probability vectors algorithm. While the first algorithm uses a deterministic approach, which has been widely employed by other existing algorithms, the second algorithm is the first that uses probability-based fault-tolerant routing. These two algorithms have two important advantages over those already existing in the relevant literature. Both algorithms ensure fault- tolerance under relaxed assumptions, regarding the number of faulty nodes and their locations in the network. Furthermore, the new algorithms are more general in that they can easily be adapted to different topologies, including those that belong to the family of k-ary n-cubes.