Name
Abstract | ||
|---|---|---|
Path diversity is an important index of the dependability and fault tolerance capability of networks. Most path diversity metrics are designed under an implicit hypothesis that all candidate paths for a divergence node are always equally chosen. This may not be true due to the effect of routing policy with consideration of cost or other factors. A new simple metric is proposed in this paper for path diversity measurement of end-to-end networks. An end-to-end network is firstly transformed into a sequence of cascading segments. With the assumption that only one of all available branches is chosen each time, a probability based metric is calculated for each segment, and the joint entropy is calculated as path diversity measurement for the overall end-to-end network. The metric is fitful for both single-hop and multi-hop topologies. A comparison between the new metric and other ones is given at the end. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/PRDC.2007.12 | PRDC |
Keywords | Field | DocType |
fault tolerant | Multipath routing,Equal-cost multi-path routing,Link-state routing protocol,Static routing,Computer science,Path vector protocol,Network topology,Joint entropy,IP forwarding,Distributed computing | Conference |
Volume | Issue | ISBN |
null | null | 0-7695-3054-0 |
Citations | PageRank | References |
4 | 0.51 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Song Huang | 1 | 5 | 3.59 |
| Yong Xu | 2 | 595 | 37.87 |
| Ling Zhang | 3 | 143 | 14.77 |