An improved shortest path bridging protocol for Ethernet backbone network

Ethernet is a de factor standard in LAN and now has spread its territory into backbone networks. To get better performance in there, many spanning tree based routing standards or protocols have been proposed, such as multiple spanning tree protocol(MSTP) and the shortest path bridging(SPB). This paper focuses on the SPB routing, and introduces EDSPB that applies the Euclidean distance into SPB. Euclidean distance is defined as the length between two nodes in our network polar coordinate, and is used as the additional metric in determining a symmetric and shortest forwarding path. Our analytic model verifies that the EDSPB contributes 7 to 26% increase to the throughput in a small backbone network.