Performance study of self-repairing unicast hierarchical protection trees in mesh networks

S. Shah-Heydari, O. Yang
{"title":"Performance study of self-repairing unicast hierarchical protection trees in mesh networks","authors":"S. Shah-Heydari, O. Yang","doi":"10.1109/BROADNETS.2007.4550490","DOIUrl":null,"url":null,"abstract":"Protection trees have been used in the past for protecting multicast and unicast traffic in networks in various scenarios. In this paper we focus on shared protection trees for link protection in unicast mesh networks. We present a heuristic algorithm that reduces the redundant capacity required for protection on shared trees, and improves the restorability of the network. We use simulation of random mesh graphs to compute the performance improvement for various network sizes.","PeriodicalId":352372,"journal":{"name":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","volume":"230 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2007.4550490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Protection trees have been used in the past for protecting multicast and unicast traffic in networks in various scenarios. In this paper we focus on shared protection trees for link protection in unicast mesh networks. We present a heuristic algorithm that reduces the redundant capacity required for protection on shared trees, and improves the restorability of the network. We use simulation of random mesh graphs to compute the performance improvement for various network sizes.
网状网络中自修复单播分层保护树的性能研究
过去,保护树已经被用于保护网络中不同场景下的组播和单播流量。本文主要研究了单播网状网络中链路保护的共享保护树。提出了一种启发式算法,减少了共享树保护所需的冗余容量,提高了网络的可恢复性。我们使用随机网格图的模拟来计算不同网络大小的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书