By Topic

Performance Analysis of Networks with Unreliable Components

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
$31 $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)
Li, V.O.K. ; Univ. of Southern California, Los Angeles, CA, USA ; Silvester, J.A.

In evaluating the performance of a communication network with unreliable components, researchers have traditionally approached the problem by enumerating all possible states of the system. Since the number of states of a communication network with n failure-prone components is 2nthese methods are restricted to small systems. We present a new solution technique that is not doomed by the "statespace explosion" problem. Instead of enumerating all possible fail states, we consider only the most probable states. Since the network operates in these states most of the time, we can get upper and lower bounds and, hence, a good approximation of the network performance without having to analyze all possible states. We illustrate our solution technique by analyzing network reliability, the expected number of communicating pairs, and network average delay for some particular networks.

Published in:

Communications, IEEE Transactions on  (Volume:32 ,  Issue: 10 )