G. Das, D. Papadimitriou, B. Puype, D. Colle, M. Pickavet, P. Demeester
{"title":"SRLG identification from time series analysis of link state data","authors":"G. Das, D. Papadimitriou, B. Puype, D. Colle, M. Pickavet, P. Demeester","doi":"10.1109/COMSNETS.2011.5716485","DOIUrl":null,"url":null,"abstract":"Failing to account for the set of links affected by a simultaneous dependent failure during the re-computation of the routing table entries leads to traffic losses until all failed links have been accounted in the re-computation of these entries. Instead, if the router learns about the existence of Shared Risk Link Groups (SRLGs) from the arriving pattern link state routing information, then decisions regarding SRLG failure can be taken promptly to avoid successive re-computations of alternate shortest paths across the updated topology. In this paper, we propose a mechanism to improve the router recovery time upon occurrence of topological link failures by detecting and identifying the existence of SRLGs from link state routing information exchanged in the routing domain. The proposed model first groups into events individual Link State Advertisements (LSAs) issued by different network nodes (routers) upon link state change; then, it combines this information to find temporal dependence among members of event groups. It further introduces a physical model interpretation derived from the application of the Weibull distribution, to determine the error on the joint probabilities of events resulting from the finite observation sample. This association allows binding the dependence of the identified groups comprising one or more events (associated to SRLG) on the corresponding estimated failure rate. Our simulation results show that the proposed technique to locally detect and identify SRLGs performs sufficiently well to trigger with enough confidence simultaneous routing table updates from the arrival of a reduced set of LSAs (ideally one).","PeriodicalId":302678,"journal":{"name":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2011.5716485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Failing to account for the set of links affected by a simultaneous dependent failure during the re-computation of the routing table entries leads to traffic losses until all failed links have been accounted in the re-computation of these entries. Instead, if the router learns about the existence of Shared Risk Link Groups (SRLGs) from the arriving pattern link state routing information, then decisions regarding SRLG failure can be taken promptly to avoid successive re-computations of alternate shortest paths across the updated topology. In this paper, we propose a mechanism to improve the router recovery time upon occurrence of topological link failures by detecting and identifying the existence of SRLGs from link state routing information exchanged in the routing domain. The proposed model first groups into events individual Link State Advertisements (LSAs) issued by different network nodes (routers) upon link state change; then, it combines this information to find temporal dependence among members of event groups. It further introduces a physical model interpretation derived from the application of the Weibull distribution, to determine the error on the joint probabilities of events resulting from the finite observation sample. This association allows binding the dependence of the identified groups comprising one or more events (associated to SRLG) on the corresponding estimated failure rate. Our simulation results show that the proposed technique to locally detect and identify SRLGs performs sufficiently well to trigger with enough confidence simultaneous routing table updates from the arrival of a reduced set of LSAs (ideally one).
在重新计算路由表项时,如果不考虑受同时依赖故障影响的链路集,则会导致流量损失,直到所有故障链路在重新计算这些表项时都被考虑在内。相反,如果路由器从到达的模式链路状态路由信息中了解到共享风险链路组(SRLG)的存在,那么可以迅速做出关于SRLG故障的决策,以避免在更新的拓扑中连续重新计算备用最短路径。在本文中,我们提出了一种机制,通过从路由域中交换的链路状态路由信息中检测和识别SRLGs的存在,来提高拓扑链路故障发生时路由器的恢复时间。该模型首先将不同网络节点(路由器)在链路状态变化时发布的单个lsa (Link State advertisement, lsa)分组为事件;然后,它结合这些信息来查找事件组成员之间的时间依赖性。它进一步介绍了从威布尔分布的应用中导出的物理模型解释,以确定有限观测样本产生的事件联合概率的误差。这种关联允许将包含一个或多个事件(与SRLG关联)的已识别组的依赖关系绑定到相应的估计故障率上。我们的仿真结果表明,所提出的局部检测和识别SRLGs的技术性能足够好,能够以足够的置信度触发从一组减少的lsa(理想情况下是一个)到达的同时更新路由表。