DocumentCode :
3775694
Title :
Bridge priority provisioning for maximizing equal cost shortest path availability
Author :
Yu-Cheng Tsao;Ting-Chao Hou
Author_Institution :
Department of Communications Engineering & Advanced Institute of Manufacturing with High-tech Innovations, National Chung Cheng University, Chia-Yi, Taiwan
fYear :
2015
fDate :
7/1/2015 12:00:00 AM
Firstpage :
1
Lastpage :
6
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.
Keywords :
"Bridges","Topology","Switches","Conferences","Routing","Cloud computing","Protocols"
Publisher :
ieee
Conference_Titel :
High Performance Switching and Routing (HPSR), 2015 IEEE 16th International Conference on
Electronic_ISBN :
2325-5609
Type :
conf
DOI :
10.1109/HPSR.2015.7483078
Filename :
7483078
Link To Document :
بازگشت