By Topic

LN-tree: a fault tolerant tree architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Y. Srinivasan ; Dept. of Comput. Sci. & Eng., Toledo Univ., OH, USA ; A. K. Sood

The analysis and design is presented of a highly reliable tree structure, the LN tree. The LN tree is formed by augmenting the simplex binary tree with redundant nodes and links. The reliability of the proposed structure is evaluated and compared with previously proposed augmented tree architectures. The results of the comparison show that the LN tree is more reliable than the existing fault-tolerant tree structures

Published in:

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Date of Conference:

10-12 Oct 1988