DocumentCode :
3092413
Title :
A Path Diversity Metric for End-to-End Network
Author :
Huang, Song ; Xu, Yong ; Zhang, Ling
Author_Institution :
South China Univ. of Technol., Guangdong
fYear :
2007
fDate :
17-19 Dec. 2007
Firstpage :
115
Lastpage :
122
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.
Keywords :
IP networks; telecommunication network routing; cascading segments sequence; end-to-end network; fault tolerance capability; path diversity metric; routing policy; Computer networks; Costs; Entropy; Fault tolerance; IP networks; Laboratories; Network topology; Probability; Routing protocols; Time measurement;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Dependable Computing, 2007. PRDC 2007. 13th Pacific Rim International Symposium on
Conference_Location :
Melbourne, Qld.
Print_ISBN :
0-7695-3054-0
Type :
conf
DOI :
10.1109/PRDC.2007.15
Filename :
4459648
Link To Document :
بازگشت