A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Evaluation of tree-based routing ethernet
2009
IEEE Communications Letters
Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)-a forwarding scheme based on a spanning tree that was extended to use some shortcut links. We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE offers improved throughput. The impact of transient loops in TRE is lower compared to the application of the classical shortest path routing
doi:10.1109/lcomm.2009.090469
fatcat:uzplyhd3drh47foyqm3dsz6kga