基于链路着色的组播和单播保护方案

Y. Bejerano, P. Koppol
{"title":"基于链路着色的组播和单播保护方案","authors":"Y. Bejerano, P. Koppol","doi":"10.1109/HPSR.2013.6602285","DOIUrl":null,"url":null,"abstract":"We propose a computationally efficient link-coloring based scheme that facilitates end-to-end protection for dynamic multicast and unicast connections. For a given source node, links are colored as red or blue such that, for any destination node, the red and blue paths are guaranteed to be node disjoint. Red and blue trees, constructed using only the red and blue links, respectively, always form redundant trees (RTs) independent of the used tree selection method. RTs connect the source of a multicast connection to all its destinations in such a way that in the event of a single link or node failure in the network, every destination is still connected to the source in at least one of the two trees. In network topologies where such RTs cannot be constructed due to lack of required path diversity, our scheme constructs two multicast trees such that the red and blue paths to any destination node only share cut links or nodes. To our knowledge, our scheme is the first that can construct such RTs. Although finding the optimal RTs is known to be NP-complete, extensive simulations show that our scheme calculates near optimal RTs and substantially outperforms other solutions.","PeriodicalId":220418,"journal":{"name":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Link-coloring based scheme for multicast and unicast protection\",\"authors\":\"Y. Bejerano, P. Koppol\",\"doi\":\"10.1109/HPSR.2013.6602285\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a computationally efficient link-coloring based scheme that facilitates end-to-end protection for dynamic multicast and unicast connections. For a given source node, links are colored as red or blue such that, for any destination node, the red and blue paths are guaranteed to be node disjoint. Red and blue trees, constructed using only the red and blue links, respectively, always form redundant trees (RTs) independent of the used tree selection method. RTs connect the source of a multicast connection to all its destinations in such a way that in the event of a single link or node failure in the network, every destination is still connected to the source in at least one of the two trees. In network topologies where such RTs cannot be constructed due to lack of required path diversity, our scheme constructs two multicast trees such that the red and blue paths to any destination node only share cut links or nodes. To our knowledge, our scheme is the first that can construct such RTs. Although finding the optimal RTs is known to be NP-complete, extensive simulations show that our scheme calculates near optimal RTs and substantially outperforms other solutions.\",\"PeriodicalId\":220418,\"journal\":{\"name\":\"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2013.6602285\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 14th International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2013.6602285","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

我们提出了一种计算效率高的基于链路着色的方案,该方案促进了动态组播和单播连接的端到端保护。对于给定的源节点,链接被涂成红色或蓝色,这样,对于任何目标节点,红色和蓝色路径都保证是节点不相交的。分别仅使用红色和蓝色链接构建的红树和蓝树总是形成独立于所使用的树选择方法的冗余树(RTs)。RTs将多播连接的源连接到它的所有目的地,这样在网络中的单个链路或节点故障的情况下,每个目的地仍然连接到至少两个树中的一个源。在网络拓扑中,由于缺乏所需的路径多样性而无法构建这样的RTs,我们的方案构建了两个多播树,使得通往任何目标节点的红色和蓝色路径只共享切割的链路或节点。据我们所知,我们的方案是第一个可以构建这种RTs的方案。虽然已知寻找最优RTs是np完全的,但广泛的模拟表明,我们的方案计算出接近最优的RTs,并且大大优于其他解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Link-coloring based scheme for multicast and unicast protection
We propose a computationally efficient link-coloring based scheme that facilitates end-to-end protection for dynamic multicast and unicast connections. For a given source node, links are colored as red or blue such that, for any destination node, the red and blue paths are guaranteed to be node disjoint. Red and blue trees, constructed using only the red and blue links, respectively, always form redundant trees (RTs) independent of the used tree selection method. RTs connect the source of a multicast connection to all its destinations in such a way that in the event of a single link or node failure in the network, every destination is still connected to the source in at least one of the two trees. In network topologies where such RTs cannot be constructed due to lack of required path diversity, our scheme constructs two multicast trees such that the red and blue paths to any destination node only share cut links or nodes. To our knowledge, our scheme is the first that can construct such RTs. Although finding the optimal RTs is known to be NP-complete, extensive simulations show that our scheme calculates near optimal RTs and substantially outperforms other solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信