The Effect of node Failures in Substar Reliability of a Star network- a Combinatorial Approach

Document Type

Conference Proceeding

Publication Date

5-21-2007

Publication Title

21st International Conference on Advanced Information Networking and Applications, AINA 2007

Publisher

IEEE

First page number:

166

Last page number:

170

Abstract

The star graph is a hierarchical graph, and rich in containing substars (or graphs with smaller size but with the same topological properties as the original). Given a set of faulty nodes, we determine the ability to recover substars of a given dimension from the original network. A study of the number of faulty nodes that are required to damage every subnetwork of a given size is also presented.

Disciplines

Electrical and Computer Engineering | Engineering | Signal Processing | Systems and Communications

Language

English

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Search your library

Share

COinS