{"title":"端到端网络的路径分集度量","authors":"Song Huang, Yong Xu, Ling Zhang","doi":"10.1109/PRDC.2007.15","DOIUrl":null,"url":null,"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.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Path Diversity Metric for End-to-End Network\",\"authors\":\"Song Huang, Yong Xu, Ling Zhang\",\"doi\":\"10.1109/PRDC.2007.15\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":183540,\"journal\":{\"name\":\"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PRDC.2007.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2007.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.