By Topic

Efficient Reliability Approximation Method for Traffic-Path-Based Network

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)
Hayashi, M. ; NTT Service Integration Labs., Tokyo, Japan ; Abe, T.

We propose a new efficient approximation algorithm for evaluating the reliability of a traffic-path-based network model. This algorithm effectively combines the methods of `reduction,' `partial factoring,' and `partial enumeration' to evaluate reliability, where reduction and partial factoring are first applied to the traffic-path-based network model. This proposed algorithm reduces the complications in achieving high-speed computing approximation reliability, while guaranteeing the exact value of reliability between upper and lower bounding values. We emphasize that these two values are very close to each other, under the reasonable assumption that network equipment and cables are highly reliable in practice. We present numerical examples showing that the computing time is short, that this algorithm is more practical, and its approximation errors are smaller than those of the existing approximation method.

Published in:

Reliability, IEEE Transactions on  (Volume:60 ,  Issue: 2 )