An approach to build stable spanning tree topology

K. Segaric, P. Knezevic, B. Blašković
{"title":"An approach to build stable spanning tree topology","authors":"K. Segaric, P. Knezevic, B. Blašković","doi":"10.1109/EURCON.2001.938148","DOIUrl":null,"url":null,"abstract":"This paper considers stability problems regarding topology produced by a spanning tree algorithm in transparent bridged networks, and presents an approach to build a stable spanning tree structure that is not dependent on a root bridge. This approach relies on tuning spanning-tree port cost in a way that the produced topology resists possible attacks or newly connected misconfigured bridges. Special care was taken to ensure stability in transition periods, where bridges negotiate about a new root. This approach is completely standards-based and requires only that is possible to tune link costs of switch/bridge ports.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2001.938148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper considers stability problems regarding topology produced by a spanning tree algorithm in transparent bridged networks, and presents an approach to build a stable spanning tree structure that is not dependent on a root bridge. This approach relies on tuning spanning-tree port cost in a way that the produced topology resists possible attacks or newly connected misconfigured bridges. Special care was taken to ensure stability in transition periods, where bridges negotiate about a new root. This approach is completely standards-based and requires only that is possible to tune link costs of switch/bridge ports.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
构建稳定生成树拓扑的一种方法
本文研究了透明桥接网络中生成树算法产生的拓扑稳定性问题,提出了一种不依赖根桥接的稳定生成树结构的构建方法。这种方法依赖于对生成树端口成本进行调优,以使生成的拓扑能够抵御可能的攻击或新连接的错误配置桥接。特别注意确保过渡时期的稳定,桥梁协商新的根。这种方法完全是基于标准的,只需要调整交换机/桥接端口的链路成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Network element manager of the SI2000 V5 product line, and the interoperability with the network, service and business level Performance analysis of burst level bandwidth allocation using multipath routing reservation Flexibility of JavaScript controled simulations Influence of parameter initialization on the performance of nonlinear blind equalizers for satellite communications A strategy for voice browsing in 3G wireless networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1