Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/TR.2011.2135710 | IEEE Transactions on Reliability |
Keywords | Field | DocType |
approximation theory,graph theory,telecommunication network reliability,telecommunication traffic,graph,partial enumeration,partial factoring method,reduction method,reliability approximation method,traffic-path-based network,Capacity,Telecommunications,graph,network reliability,traffic-path-based network model | Graph theory,Approximation algorithm,Mathematical optimization,Networking hardware,Approximation theory,Reliability (computer networking),Factoring,Mathematics,Network model,Bounding overwatch | Journal |
Volume | Issue | ISSN |
60 | 2 | 0018-9529 |
Citations | PageRank | References |
2 | 0.42 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hayashi, M. | 1 | 7 | 3.61 |
| Takeo Abe | 2 | 2 | 0.42 |