Implementation of ARP-Path Low Latency Bridges in Linux and OpenFlow/NetFPGA
Autores
Ibáñez Fernández, Guillermo Agustín; De Schuymer, Bart; Naous, Jad; Rivera Pinto, Diego; Rojas Sánchez, Elisa; [et al.]Editor
12th IEEE International Conference on High Performance Switching and Routing
Fecha de publicación
2011-07-04Patrocinadores
Ministerio de Ciencia e Innovación
Comunidad de Madrid
Junta de Comunidades de Castilla-La Mancha
Cita bibliográfica
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5986000
Palabras clave
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
Proyectos
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
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 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.
Ficheros en el ítem
Ficheros | Tamaño | Formato |
|
---|---|---|---|
11 HPRS congreso cartagena.pdf | 924.9Kb |
|
Ficheros | Tamaño | Formato |
|
---|---|---|---|
11 HPRS congreso cartagena.pdf | 924.9Kb |
|
Colecciones
- AUTOMATIC - Artículos [144]
- AUTOMTSE - Artículos [38]