TRE+: Extended Tree-Based Routing Ethernet

ETRI Journal

关键词: hierarchical addresses;    spanning tree;    Ethernet;    Routing bridges;   

Others  :  1186008
DOI  :  10.4218/etrij.10.0209.0388

【 摘 要 】

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.

   

【 参考文献 】

• [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. Ibáñez et al. "Evaluation of Tree-Based Routing Ethernet," IEEE Commun. Lett., vol. 13, no. 6, June 2009, pp. 444-446.
• [4]G. Ibáñez 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.
• [5]Boston University Representative Topology Generator - BRITE, available at http://www.cs.bu.edu/brite/.