Implementing ARP-Path Low Latency Bridges in NetFPGA

Authors
Rojas Sánchez, ElisaUniversity of Alcalá Author; Naous, Jad; Ibáñez Fernández, Guillermo AgustínUniversity of Alcalá Author; Rivera Pinto, DiegoUniversity of Alcalá Author; Carral Pelayo, Juan AntonioUniversity of Alcalá Author; [et al.]
Identifiers
Permanent link (URI): http://hdl.handle.net/10017/8676
Publisher
ACM SIGCOMM 2011
Date
2011-08-15
Affiliation
Universidad de Alcalá. Departamento de Automática
Funders
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
Bibliographic citation
Proceedings of the ACM SIGCOMM 2011 conference Pages 444-445
Keywords
Routing bridges
NetFPGA
Shortest Path Bridges
Spanning Tree
Ethernet
Project
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
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
Document type
info:eu-repo/semantics/article
Version
info:eu-repo/semantics/acceptedVersion
Access rights
info:eu-repo/semantics/openAccess
Share
 
Abstract
The demo is focused on the implementation of ARP-Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges. ARP-Path Bridges rely on the race between broadcast ARP Request packets, to discover the minimum latency path to the destination host. Several implementations (in Omnet++, Linux, OpenFlow, NetFPGA) have shown that ARP-Path exhibits loop-freedom, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. This demo compares our hardware implementation on NetFPGA to bridges running STP, showing that ARP-Path finds lower latency paths than STP.
Files in this item
Collections