ARP-Path: ARP-based, Shortest Path Bridges

Authors
Ibáñez Fernández, Guillermo AgustínUniversity of Alcalá Author; Carral Pelayo, Juan AntonioUniversity of Alcalá Author; Arco Rodríguez, José ManuelUniversity of Alcalá Author; Rivera Pinto, DiegoUniversity of Alcalá Author; Montalvo Taravillo, AarónUniversity of Alcalá Author
Identifiers
Permanent link (URI): http://hdl.handle.net/10017/8175
Date
2011-05-05
Affiliation
Universidad de Alcalá. Departamento de Automática
Funders
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
Keywords
Ethernet
Routing bridges
Spanning Tree
Project
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
Document type
info:eu-repo/semantics/article
Version
info:eu-repo/semantics/acceptedVersion
Access rights
info:eu-repo/semantics/openAccess
Share
 
Abstract
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.
Files in this item
Collections