Evaluation of Tree-Based Routing Ethernet

  View metrics of use
Utilizar EndNote Import
Authors
Ibáñez Fernández, Guillermo AgustínUniversity of Alcalá Author; García Martínez, Alberto; Carral Pelayo, Juan AntonioUniversity of Alcalá Author; Azcorra, Arturo; Arco Rodríguez, José ManuelUniversity of Alcalá Author
Identifiers
Permanent link (URI): http://hdl.handle.net/10017/4141
Publisher
IEEE
Date
2009-06
Academic Departments
Universidad de Alcalá. Departamento de Automática
Research group
Telematics Services Engineering (TSE)
Funders
Ministerio de Ciencia e Innovación
Bibliographic citation
http://dx.doi.org/10.1109/LCOMM.2009.090469
Keywords
Routing bridges
Ethernet
Spanning tree
Routing protocols
Telecommunication network topology
Project
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
Document type
info:eu-repo/semantics/article
Version
info:eu-repo/semantics/publishedVersion
Access rights
info:eu-repo/semantics/openAccess
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.

Show full item record

Files in this item
Collections