桥优先级配置最大化等成本最短路径可用性

Yu-Cheng Tsao, T. Hou
{"title":"桥优先级配置最大化等成本最短路径可用性","authors":"Yu-Cheng Tsao, T. Hou","doi":"10.1109/HPSR.2015.7483078","DOIUrl":null,"url":null,"abstract":"Shortest Path Bridging (SPB) is a new layer 2 switching technology which is the latest on the IEEE 802.3 Ethernet evolution path and provides improved scalability. It is suitable for large-scale cloud data center networks that require hundreds or thousands of switches (or bridges) to connect up to tens of thousands of servers. In SPB, 16 ECT (equal cost tree) algorithms are introduced to select one of multiple equal cost shortest paths (ECSPs). However, some ECSPs may not be selected by these ECT algorithms at all. In this paper, we propose provisioning bridge priority to address this issue. The proposed distinct XOR relation (DXR) constraint on the bridge priority is shown to allow maximum number of ECSPs to be selected by the ECT algorithms.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Bridge priority provisioning for maximizing equal cost shortest path availability\",\"authors\":\"Yu-Cheng Tsao, T. Hou\",\"doi\":\"10.1109/HPSR.2015.7483078\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Shortest Path Bridging (SPB) is a new layer 2 switching technology which is the latest on the IEEE 802.3 Ethernet evolution path and provides improved scalability. It is suitable for large-scale cloud data center networks that require hundreds or thousands of switches (or bridges) to connect up to tens of thousands of servers. In SPB, 16 ECT (equal cost tree) algorithms are introduced to select one of multiple equal cost shortest paths (ECSPs). However, some ECSPs may not be selected by these ECT algorithms at all. In this paper, we propose provisioning bridge priority to address this issue. The proposed distinct XOR relation (DXR) constraint on the bridge priority is shown to allow maximum number of ECSPs to be selected by the ECT algorithms.\",\"PeriodicalId\":360703,\"journal\":{\"name\":\"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2015.7483078\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2015.7483078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

最短路径桥接(SPB)是一种新的第二层交换技术,是IEEE 802.3以太网演进路径上的最新技术,提供了改进的可扩展性。它适用于需要数百或数千台交换机(或桥接器)连接多达数万台服务器的大型云数据中心网络。在SPB中,引入了16种等代价树(ECT)算法,从多个等代价最短路径(ecsp)中选择一条。然而,一些ecsp可能根本不被这些ECT算法所选择。在本文中,我们提出了配置桥优先级来解决这个问题。提出的不同异或关系(DXR)约束的网桥优先级显示允许最大数量的ecsp选择由ECT算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Bridge priority provisioning for maximizing equal cost shortest path availability
Shortest Path Bridging (SPB) is a new layer 2 switching technology which is the latest on the IEEE 802.3 Ethernet evolution path and provides improved scalability. It is suitable for large-scale cloud data center networks that require hundreds or thousands of switches (or bridges) to connect up to tens of thousands of servers. In SPB, 16 ECT (equal cost tree) algorithms are introduced to select one of multiple equal cost shortest paths (ECSPs). However, some ECSPs may not be selected by these ECT algorithms at all. In this paper, we propose provisioning bridge priority to address this issue. The proposed distinct XOR relation (DXR) constraint on the bridge priority is shown to allow maximum number of ECSPs to be selected by the ECT algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信