By Topic

An improved shortest path bridging protocol for Ethernet backbone network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhen Luo ; Sch. of Comput., Soongsil Univ., Seoul, South Korea ; Changjin Suh

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.

Published in:

Information Networking (ICOIN), 2011 International Conference on

Date of Conference:

26-28 Jan. 2011