ETRI Journal

Electronics and Telecommunications Research Institute (한국전자통신연구원)
권호 표지
DOI QR코드

DOI QR Code

TRE+: Extended Tree-Based Routing Ethernet

  • Carral, Juan A. (Department of Computer Engineering, University of Alcala) ;
  • Ibanez, Guillermo (Department of Computer Engineering, University of Alcala) ;
  • Garcia-Martinez, Alberto (Department of Telematic Engineering, University Carlos III of Madrid) ;
  • Lopez-Carmona, Miguel A. (Department of Computer Engineering, University of Alcala) ;
  • Marsa-Maestre, Ivan (Department of Computer Engineering, University of Alcala)
  • Received : 2009.09.15
  • Accepted : 2009.11.12
  • Published : 2010.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

Tree-based routing Ethernet (TRE) is a recent Ethernet architecture that enables shortcut links to improve performance compared to spanning tree protocols. However, TRE can only use shortcuts that arrive directly at bridges located in the branch of the destination. TRE+ extends the topology knowledge of a bridge to 2 hops away, thus unveiling new shortcuts to the destination branch. Simulations show a major performance improvement of TRE+ compared to TRE, with results close to shortest paths in some topologies.

Keywords

References

  1. R. Perlman, "Rbridges: Transparent Routing," Proc. IEEE Infocom, Mar. 2004.
  2. H. Chi and C. Tang: "A Deadlock-Free Routing Scheme for Interconnection Networks with Irregular Topologies," Proc. ICPADS, 1997, pp. 88-95.
  3. G. Ibanez et al. "Evaluation of Tree-Based Routing Ethernet," IEEE Commun. Lett., vol. 13, no. 6, June 2009, pp. 444-446. https://doi.org/10.1109/LCOMM.2009.090469
  4. G. Ibanez et al., HURP/HURBA: Hierarchical Up/Down Routing Architecture for Ethernet Backbones and Campus Networks, Computer Networks, Computer Networks, vol. 54, no. 1, Jan. 2010, pp. 41-56. https://doi.org/10.1016/j.comnet.2009.08.007
  5. Boston University Representative Topology Generator - BRITE, available at http://www.cs.bu.edu/brite/.