Skip to content
ISBN: 3838352637
ISBN13: 9783838352633

New Fault-Tolerant Routing Algorithms for k-ary n-cube Networks

ISBN: 3838352637
ISBN13: 9783838352633
Formats

Conditions

Formats

Conditions

See all 1 editions

Book Overview

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. This description may be from another edition of this product.
Format:
Paperback
Language:
English
ISBN:
3838352637
ISBN13:
9783838352633
Release Date:
March 2011
Publisher:
Lap Lambert Academic Publishing GmbH & Company KG
Length:
156 Pages
Weight:
0.53 lbs.
Dimensions:
0.4″ × 6.0″ × 9.0″
ComputersComputers & Technology

Customer Reviews

0 customer ratings | 0 reviews
Write a Review

There are currently no reviews. Be the first to review this work.