{"title":"在MPLS网络中支持组播本地故障恢复的树形划分方法","authors":"O. Banimelhem, A. Agarwal, J. Atwood","doi":"10.1109/ICW.2005.19","DOIUrl":null,"url":null,"abstract":"This paper introduces a novel approach to support local failure recovery in multicast trees. Although, the presented approach can be implemented in any large backbone network that employs multicast communication mode, we concentrate our discussion on MPLS networks. In the proposed approach, a multicast tree is divided into several domains where each domain represents a sub-tree of the original one. Backup paths are built between the root of the domain and each leaf router which is called a border router. Simulation results conducted on two network topologies show the performance of the proposed approach in terms of the total capacity required for reserving the backup paths and in terms of the maximum delay needed to notify about link/node failure. The results have shown that tree division approach compared with global recovery approach reduces the time needed to notify the router that is responsible for switching the traffic to the backup path.","PeriodicalId":255955,"journal":{"name":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","volume":"43 7","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A tree division approach to support local failure recovery for multicasting in MPLS networks\",\"authors\":\"O. Banimelhem, A. Agarwal, J. Atwood\",\"doi\":\"10.1109/ICW.2005.19\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces a novel approach to support local failure recovery in multicast trees. Although, the presented approach can be implemented in any large backbone network that employs multicast communication mode, we concentrate our discussion on MPLS networks. In the proposed approach, a multicast tree is divided into several domains where each domain represents a sub-tree of the original one. Backup paths are built between the root of the domain and each leaf router which is called a border router. Simulation results conducted on two network topologies show the performance of the proposed approach in terms of the total capacity required for reserving the backup paths and in terms of the maximum delay needed to notify about link/node failure. The results have shown that tree division approach compared with global recovery approach reduces the time needed to notify the router that is responsible for switching the traffic to the backup path.\",\"PeriodicalId\":255955,\"journal\":{\"name\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"volume\":\"43 7\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-08-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICW.2005.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 Systems Communications (ICW'05, ICHSN'05, ICMCS'05, SENET'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICW.2005.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A tree division approach to support local failure recovery for multicasting in MPLS networks
This paper introduces a novel approach to support local failure recovery in multicast trees. Although, the presented approach can be implemented in any large backbone network that employs multicast communication mode, we concentrate our discussion on MPLS networks. In the proposed approach, a multicast tree is divided into several domains where each domain represents a sub-tree of the original one. Backup paths are built between the root of the domain and each leaf router which is called a border router. Simulation results conducted on two network topologies show the performance of the proposed approach in terms of the total capacity required for reserving the backup paths and in terms of the maximum delay needed to notify about link/node failure. The results have shown that tree division approach compared with global recovery approach reduces the time needed to notify the router that is responsible for switching the traffic to the backup path.