All-Path bridging: Path exploration protocols for data center and campus networks

Display Omitted Today, link-state routing protocols that compute multiple shortest paths predominate in data center and campus networks, where routing is performed either in layer three or in layer two using link-state routing protocols. But current proposals based on link-state routing do not adapt well to real time traffic variations and become very complex when attempting to balance the traffic load. We propose All-Path bridging, an evolution of the classical transparent bridging that forwards frames over shortest paths using the complete network topology, which overcomes the limitations of the spanning tree protocol. All-Path is a new frame routing paradigm based on the simultaneous exploration of all paths of the real network by a broadcast probe frame, instead of computing routes on the network graph. This paper presents All-Path switches and their differences with standard switches and describes ARP-Path protocol in detail, its path recovery mechanisms and compatibility with IEEE 802.1 standard bridges. ARP-Path is the first protocol variant of the All-Path protocol family. ARP-Path reuses the standard ARP Request and Reply packets to explore reactively the network and find the fastest path between two hosts. We compare its performance in terms of latency and load distribution with link-state shortest-path routing bridges, showing that ARP-Path distributes the load more evenly and provides lower latencies. Implementations on different platforms prove the robustness of the protocol. The conclusion is that All-Path bridging offer a simple, resilient and scalable alternative to path computation protocols.

[1]  Alan L. Cox,et al.  PAST: scalable ethernet for data centers , 2012, CoNEXT '12.

[2]  Nigel Bragg,et al.  802.1aq Shortest Path Bridging Design and Evolution: The Architect's Perspective , 2012 .

[3]  János Farkas,et al.  Intelligent load balancing for shortest path bridging , 2012, IEEE Communications Magazine.

[4]  Constantinos Dovrolis,et al.  Beyond the Model of Persistent TCP Flows: Open-Loop vs Closed-Loop Arrivals of Non-persistent Flows , 2008, 41st Annual Simulation Symposium (anss-41 2008).

[5]  Ivan Marsá-Maestre,et al.  Path-Moose: A Scalable All-Path Bridging Protocol , 2013, IEICE Trans. Commun..

[6]  Elisa Rojas,et al.  Implementing ARP-path low latency bridges in NetFPGA , 2011, SIGCOMM.

[7]  M. Seaman Shortest Path Bridging , 2004 .

[8]  Don Fedyk,et al.  Provider link state bridging , 2008, IEEE Communications Magazine.

[9]  Jad Naous,et al.  A Simple, Zero-configuration, Low Latency, Bridging Protocol , 2010 .

[10]  Michael Barbehenn,et al.  A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices , 1998, IEEE Trans. Computers.

[11]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

[12]  Anoop Ghanwani,et al.  ARP Broadcast Reduction for Large Data Centers , 2011 .

[13]  J. J. Garcia-Luna-Aceves,et al.  "Ethernet on AIR': Scalable Routing in very Large Ethernet-Based Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[14]  Natasa MaksiAleksandra SmiljaniUniversity Improving Utilization of Data Center Networks , 2013 .

[15]  M. Chial,et al.  in simple , 2003 .

[16]  David A. Maltz,et al.  Network traffic characteristics of data centers in the wild , 2010, IMC '10.

[18]  Elisa Rojas,et al.  Implementation of ARP-path low latency bridges in Linux and OpenFlow/NetFPGA , 2011, 2011 IEEE 12th International Conference on High Performance Switching and Routing.

[19]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[20]  János Farkas,et al.  Performance Analysis of Shortest Path Bridging Control Protocols , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[21]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[22]  Guillermo Ibáñez,et al.  ARP-Path: ARP-Based, Shortest Path Bridges , 2011, IEEE Communications Letters.

[23]  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).

[24]  Dagang Li,et al.  Optimized Hash Lookup for Bloom Filter Based Packet Routing , 2013, 2013 16th International Conference on Network-Based Information Systems.

[25]  Jennifer Rexford,et al.  Floodless in seattle: a scalable ethernet architecture for large enterprises , 2008, SIGCOMM '08.