{"title":"构建稳定生成树拓扑的一种方法","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":"{\"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}","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}
An approach to build stable spanning tree topology
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.