Title

A Combinatorial Analysis of Distance Reliability in Star network

Document Type

Conference Proceeding

Publication Date

3-26-2007

Publication Title

21st International Parallel and Distributed Processing Symposium, IPDPS 2007

Publisher

IEEE

First page number:

422

Last page number:

430

Abstract

This paper addresses a constrained two-terminal reliability measure referred to as distance reliability (DR) between the source node u and the destination node I with the shortest distance, in an n-dimensional star network, Sn. The shortest distance restriction guarantees the optimal communication delay between processors and high link/node utilization across the network. This paper uses a combinatorial approach by limiting the number of node, link and node/link failures. For each failure model, two different cases depending on the relative positions of u and I, are analyzed to compute DR. Furthermore, DR for the antipodal communication, where every node must communicate with its antipode, is investigated as a special case. For this case, lower bound on DR of those disjoint paths is also derived.

Keywords

Availability; Computer network reliability; Electric variables measurement; Failure analysis; Parallel architectures; Performance analysis; Robustness; Routing; Telecommunication network reliability; Tin

Disciplines

Computer Engineering | Digital Communications and Networking | Electrical and Computer Engineering | Electrical and Electronics | Materials Science and Engineering | Power and Energy | Signal Processing | Structural Materials | Systems and Communications

Language

English

Comments

Conference held: Long Beach, CA, 26-30 March 2007

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.

Identifier

DOI: http://dx.doi.org/10.1109/IPDPS.2007.370602

UNLV article access

Search your library

Share

COinS