A combinatorial analysis of distance reliability in star network

Document Type

Conference Proceeding


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.


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


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


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


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