Open AccessTRE+: Extended Tree‐Based Routing Ethernet
Author(s) -
Carral Juan A.,
Ibáñez Guillermo,
GarcíaMartínez Alberto,
LopezCarmona Miguel A.,
MarsaMaestre Ivan
Publication year - 2010
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.10.0209.0388
Subject(s) - ethernet , computer network , network topology , computer science , tree (set theory) , routing (electronic design automation) , ethernet over sdh , connection oriented ethernet , ethernet flow control , distributed computing , topology (electrical circuits) , carrier ethernet , spanning tree , metro ethernet , engineering , mathematics , electrical engineering , combinatorics , mathematical analysis
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.