Evaluation of Tree-Based Routing Ethernet
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 ass...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2009 |
| País: | España |
| Recursos: | IMDEA Networks Institute |
| Repositorio: | IMDEA Networks Institute Digital Repository |
| Idioma: | inglés |
| OAI Identifier: | oai:dspace.networks.imdea.org:20.500.12761/1431 |
| Acesso em linha: | http://hdl.handle.net/20.500.12761/1431 |
| Access Level: | acceso abierto |
| Palavra-chave: | Q Science::Q Science (General) Q Science::QA Mathematics::QA75 Electronic computers. Computer science T Technology::T Technology (General) T Technology::TA Engineering (General). Civil engineering (General) T Technology::TK Electrical engineering. Electronics Nuclear engineering Routing bridges Ethernet spanning tree |
| Resumo: | 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. |
|---|