Implementation of ARP-Path Low Latency Bridges in Linux and OpenFlow/NetFPGA

Authors
Ibáñez Fernández, Guillermo AgustínUniversity of Alcalá Author; De Schuymer, Bart; Naous, Jad; Rivera, Diego; Rojas Sánchez, ElisaUniversity of Alcalá Author; [et al.]
Identifiers
Permanent link (URI): http://hdl.handle.net/10017/8677
Publisher
12th IEEE International Conference on High Performance Switching and Routing
Date
2011-07-04
Affiliation
Universidad de Alcalá. Departamento de Automática
Funders
Ministerio de Ciencia e Innovación
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
Bibliographic citation
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5986000
Keywords
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
Project
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
info:eu-repo/grantAgreement/Comunidad de Madrid//S2009%2FTIC1468/ES//MEDIANET-CM
PII1I09-0204-4319 (Comunidad Castilla-La Mancha)
Document type
info:eu-repo/semantics/article
Version
info:eu-repo/semantics/acceptedVersion
Access rights
info:eu-repo/semantics/openAccess
Share
 
Abstract
This paper describes the implementation of ARP- Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA platforms. These ARP-based Ethernet Switches rely on the race between the replicas of a standard ARP Request packet flooded over all links, to discover the minimum latency path to the destination host, complemented in the opposite direction by the ARP Reply packet directed to the source host. Implementations show that the protocol is loop free, 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. Implementations in Linux and OpenFlow on NetFPGA show inherent robustness and fast reconfiguration. Previous simulations showed a superior performance (throughput and delay) than the Spanning Tree Protocol and similar to shortest path routing, with lower complexity.
Files in this item
Collections