Implementation of ARP-path low latency bridges in Linux and OpenFlow/NetFPGA
暂无分享,去创建一个
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.
[1] Arturo Azcorra,et al. Fast Path Ethernet Switching: On-demand, efficient transparent bridges for data center and campus networks , 2010, 2010 17th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN).
[2] B. Achiriloaie,et al. VI REFERENCES , 1961 .
[3] Alan L. Cox,et al. EtherProxy: Scaling Ethernet By Suppressing Broadcast Traffic , 2009, IEEE INFOCOM 2009.