Publication: Implementation of ARP-Path Low Latency Bridges in Linux and OpenFlow/NetFPGA
Loading...
Identifiers
Publication date
2011-07
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
IEEE - The Institute Of Electrical And Electronics Engineers, Inc
Impact
Export
Abstract
This paper describes the implementation of ARPPath (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
Description
2011 IEEE 12th International Conference on High Performance Switching and Routing took place July 4-6, 2011 in Cartagena, Spain. This event web site is:
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5976787
Keywords
Ethernet, Routing bridges, Shortest Path Bridges, Spanning Tree
Bibliographic citation
12th International Conference on High Performance Switching and Routing (2011) pp. 30-35