Evaluation of tree-based routing ethernet

  • Authors:
  • G. Ibáñez;A. García-Martínez;J. A. Carral;J. M. Arco;A. Azcorra

  • Affiliations:
  • Universidad de Alcalá, Madrid, Spain;Universidad Carlos III de Madrid;Universidad de Alcalá, Madrid, Spain;Universidad de Alcalá, Madrid, Spain;Universidad Carlos III de Madrid and IMDEA Networks

  • Venue:
  • IEEE Communications Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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-configuring and its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.