Evaluation of Tree-Based Routing Ethernet Articles uri icon

publication date

  • June 2009

start page

  • 444

end page

  • 446

issue

  • 6

volume

  • 13

international standard serial number (ISSN)

  • 1089-7798

electronic international standard serial number (EISSN)

  • 1558-2558

abstract

  • 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 protocols to Ethernet. Finally, TRE is self-configuringand its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.