ARP-Path: ARP-based, Shortest Path Bridges
Autores
Ibáñez Fernández, Guillermo Agustín; Carral Pelayo, Juan Antonio; Arco Rodríguez, José Manuel; Rivera Pinto, Diego; Montalvo Taravillo, AarónFecha de publicación
2011-05-05Patrocinadores
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
Palabras clave
Ethernet
Routing bridges
Spanning Tree
Proyectos
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
Tipo de documento
info:eu-repo/semantics/article
Versión
info:eu-repo/semantics/acceptedVersion
Derechos de acceso
info:eu-repo/semantics/openAccess
Resumen
This letter is a summary proposal for an evolution of
the Ethernet transparent bridge paradigm that provides simple,
shortest path bridging in campus networks. ARP-Path Ethernet
Switches set up an on-demand path between two hosts just
reusing and flooding the standard ARP request frame through all
links and confirming the path reaching to the destination host
with the ARP reply frame. ARP-Path uses the standard Ethernet
frame format, is fully transparent to hosts and does not require
spanning tree or link state protocol. Simulation results show
superior performance to spanning tree and similar to shortest
path routing, with lower complexity. Our implementations
confirm backward compatibility, robustness and performance.
Ficheros en el ítem
Ficheros | Tamaño | Formato |
|
---|---|---|---|
Transparent ARP-based Shortest ... | 281.1Kb |
|
Ficheros | Tamaño | Formato |
|
---|---|---|---|
Transparent ARP-based Shortest ... | 281.1Kb |
|
Colecciones
- AUTOMATIC - Artículos [144]
- AUTOMTSE - Artículos [38]