research-article

Scalable Multi-Failure Fast Failover via Forwarding Table Compression

Authors:

Brent Stephens,

Scott RixnerAuthors Info & Claims

SOSR '16: Proceedings of the Symposium on SDN Research

Article No.: 9, Pages 1 - 12

https://doi.org/10.1145/2890955.2890957

Published: 14 March 2016 Publication History

Abstract

In datacenter networks, link and switch failures are a common occurrence. Although most of these failures do not disconnect the underlying topology, they do cause routing failures, disrupting communications between some hosts. Unfortunately, current 1:1 redundancy groups are only partly effective at reducing the impact of these routing failures. In principle, local fast failover schemes, such as OpenFlow fast failover groups, could reduce the impact by preinstalling backup routes that protect against multiple simultaneous failures. However, providing a sufficient number of backup routes within the available space provided by the forwarding tables of datacenter switches is challenging. To solve this problem, we contribute a new forwarding table compression algorithm. Further, we introduce the concept of compression-aware routing to improve the achieved compression ratio. Lastly, we have created Plinko, a new forwarding model that is designed to have more easily compressible forwarding tables. All optimizations combined, we often saw compression ratios ranging from 2.10x to 19.29x.

References

[1]

M. Alizadeh, A. Greenberg, D. A. Maltz, J. Padhye, P. Patel, B. Prabhakar, S. Sengupta, and M. Sridharan. Data center TCP (DCTCP). In SIGCOMM, 2010.

Digital Library

[2]

M. Borokhovich, L. Schiff, and S. Schmid. Provable data plane connectivity with local fast failover: Introducing OpenFlow graph algorithms. In HotSDN, 2014.

Digital Library

[3]

P. Bosshart, D. Daly, G. Gibb, M. Izzard, N. McKeown, J. Rexford, C. Schlesinger, D. Talayco, A. Vahdat, G. Varghese, and D. Walker. P4: Programming protocol-independent packet processors. SIGCOMM Comput. Commun. Rev., 2014.

Digital Library

[4]

P. Bosshart, G. Gibb, H.-S. Kim, G. Varghese, N. McKeown, M. Izzard, F. A. Mujica, and M. Horowitz. Forwarding metamorphosis: fast programmable match-action processing in hardware for SDN. In SIGCOMM, 2013.

Digital Library

[5]

S. Casner. A fine-grained view of high-performance networking. In Presented at NANOG22, 2001.

[6]

A. R. Curtis, J. C. Mogul, J. Tourrilhes, and P. Yalagandula. DevoFlow: Scaling flow management for high-performance networks. In SIGCOMM, 2011.

Digital Library

[7]

T. Elhourani, A. Gopalan, and S. Ramasubramanian. IP fast rerouting for multi-link failures. In INFOCOM, 2014.

[8]

K. Elmeleegy, A. L. Cox, and T. S. E. Ng. Etherfuse: An ethernet watchdog. In SIGCOMM, 2007.

Digital Library

[9]

J. Feigenbaum, P. B. Godfrey, A. Panda, M. Schapira, S. Shenker, and A. Singla. On the resilience of routing tables In Brief announcement, 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), July 2012.

Digital Library

[10]

P. Francois and O. Bonaventure. An evaluation of IP-based fast reroute techniques. In CoNext, 2005.

Digital Library

[11]

P. Gill, N. Jain, and N. Nagappan. Understanding network failures in data centers: measurement, analysis, and implications. In SIGCOMM, 2011.

Digital Library

[12]

K. He, E. Rozner, K. Agarwal, W. Felter, J. Carter, and A. Akella. Presto: Edge-based load balancing for fast datacenter networks. In SIGCOMM. ACM, 2015.

Digital Library

[13]

S. Hu, K. Chen, H. Wu, W. Bai, C. Lan, H. Wang, H. Zhao, and C. Guo. Explicit path control in commodity data centers: Design and applications. In NSDI. USENIX Association, 2015.

Digital Library

[14]

IBM BNT RackSwitch G8264. http://www.redbooks.ibm.com/abstracts/tips0815.html.

[15]

Intel Ethernet Switch FM6000 Series - Software Defined Networking. http://www.intel.com/content/dam/www/public/us/en/documents/white-papers/ethernet-switch-fm6000-sdn-paper.pdf.

[16]

D. Katz and D. Ward. RFC 5880 Bidirectional Forwarding Detection (BFD), June 2010.

[17]

N. Kushman, S. Kandula, D. Katabi, and B. M. Maggs. R-BGP: staying connected in a connected world. In NSDI, 2007.

Digital Library

[18]

K. Lakshminarayanan, M. Caesar, M. Rangan, T. Anderson, S. Shenker, and I. Stoica. Achieving convergence-free routing using failure-carrying packets. In SIGCOMM, 2007.

Digital Library

[19]

J. Liu, A. Panda, A. Singla, P. B. Godfrey, M. Schapira, and S. Shenker. Ensuring connectivity via data plane mechanisms. In NSDI, April 2013.

Digital Library

[20]

V. Liu, D. Halperin, A. Krishnamurthy, and T. Anderson. F10: A fault-tolerant engineered network. In NSDI, 2013.

Digital Library

[21]

S. S. Lor, R. Landa, and M. Rio. Packet re-cycling: eliminating packet losses due to network failures. In HotNets, 2010.

Digital Library

[22]

C. R. Meiners, A. X. Liu, and E. Torng. Bit weaving: a non-prefix approach to compressing packet classifiers in TCAMs. IEEE/ACM Trans. Netw., 20(2), Apr. 2012.

Digital Library

[23]

J. Mudigonda, P. Yalagandula, J. C. Mogul, B. Stiekes, and Y. Pouffary. NetLord: a scalable multi-tenant network architecture for virtualized datacenters. In SIGCOMM, 2011.

Digital Library

[24]

S. Ohring, M. Ibel, S. Das, and M. Kumar. On generalized fat trees. Parallel Processing Symposium, International, 0:37, 1995.

Digital Library

[25]

OpenFlow switch specification, version 1.1.0. http://www.openflow.org/documents/openflow-spec-v1.1.0.pdf.

[26]

P. Pan, G. Swallow, and A. Atlas. RFC 4090 Fast Reroute Extensions to RSVP-TE for LSP Tunnels, May 2005.

[27]

M. Reitblatt, M. Canini, A. Guha, and N. Foster. FatTire: Declarative fault tolerance for software defined networks. In HotSDN, 2013.

Digital Library

[28]

M. Reitblatt, N. Foster, J. Rexford, C. Schlesinger, and D. Walker. Abstractions for network update. SIGCOMM, 2012.

Digital Library

[29]

L. Schiff, M. Borokhovich, and S. Schmid. Reclaiming the brain: Useful OpenFlow functions in the data plane. In HotNets, 2014.

Digital Library

[30]

J. Shafer, B. Stephens, M. Foss, S. Rixner, and A. L. Cox. Axon: A flexible substrate for source-routed Ethernet. In ANCS, 2010.

Digital Library

[31]

A. Singla, C.-Y. Hong, L. Popa, and P. B. Godfrey. Jellyfish: Networking data centers randomly. In NSDI, April 2012.

Digital Library

[32]

B. Stephens and A. L. Cox. Deadlock-free local fast failover for arbitrary data center networks. In INFOCOM, 2016.

Digital Library

[33]

B. Stephens, A. L. Cox, W. Felter, C. Dixon, and J. Carter. PAST: Scalable ethernet for data centers. In CoNext, 2012.

Digital Library

[34]

B. Stephens, A. L. Cox, and S. Rixner. Plinko: building provably resilient forwarding tables. In HotNets, 2013.

Digital Library

[35]

B. Stephens, A. L. Cox, and S. Rixner. Plinko: Building provably resilient forwarding tables. Technical Report TR13-06, Department of Computer Science, Rice University, October 2013.

Digital Library

[36]

B. Yang, J. Liu, S. Shenker, J. Li, and K. Zheng. Keep forwarding: Towards k-link failure resilient routing. In INFOCOM, 2014.

[37]

B. Yener, Y. Ofek, and M. Yung. Convergence routing on disjoint spanning trees. Computer Networks, 31(5):429--443, 1999.

Cited By

Lenzen CMedina MSaberi MSchmid S(2024)Robust Routing Made Easy: Reinforcing Networks Against Non-Benign FaultsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328318432:1(283-297)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3283184
Zhou BWu CYang QZhu ZNie YYu W(2023)Traffic-Aware Fast Reroute Mechanism Exploiting Disjoint Subpaths for Named Data NetworksICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279628(4013-4019)Online publication date: 28-May-2023
https://doi.org/10.1109/ICC45041.2023.10279628
Zhou BZhu ZNie YChen XYan BYang QWu C(2023)Fast Proactive Re-Route with Detours on Joint Paths in Named-Data Networks for Communications of Smart Electric Power Transmission Grids2023 15th International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS56262.2023.10041321(640-648)Online publication date: 3-Jan-2023
https://doi.org/10.1109/COMSNETS56262.2023.10041321
Show More Cited By

Scalable Multi-Failure Fast Failover via Forwarding Table Compression
1. Computer systems organization
2. Networks

Recommendations

Local Fast Failover Routing With Low Stretch

Network failures are frequent and disruptive, and can significantly reduce the throughput even in highly connected and regular networks such as datacenters. While many modern networks support some kind of local fast failover to quickly reroute flows ...
IP fast reroute for double-link failure recovery
GLOBECOM'09: Proceedings of the 28th IEEE conference on Global telecommunications

Failure recovery using IP fast reroute (IPFRR) has gained much attention recently. The basic idea is to find backup paths and configure the routing tables in advance. After a failure is detected, the pre-determined backup paths are used immediately to ...
IP fast reroute with failure inferencing
INM '07: Proceedings of the 2007 SIGCOMM workshop on Internet network management

Five nines availability is being expected from IP networks due to the growing popularity of IP telephony and the increasing usage of the Internet for mission-critical applications. This necessitates enhancing the resiliency of IP networks against ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SOSR '16: Proceedings of the Symposium on SDN Research

March 2016

178 pages

ISBN:9781450342117

DOI:10.1145/2890955

Program Chairs:
Brighten Godfrey
UIUC
,
Martin Casado
VMware

Copyright © 2016 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGCOMM: ACM Special Interest Group on Data Communication
ONS: Open Networking Summit

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 March 2016

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

SOSR '16

Sponsor:

SIGCOMM
ONS

SOSR '16: Symposium on SDN Research

March 14 - 15, 2016

CA, Santa Clara, USA

Acceptance Rates

Overall Acceptance Rate 7 of 43 submissions, 16%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
266
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lenzen CMedina MSaberi MSchmid S(2024)Robust Routing Made Easy: Reinforcing Networks Against Non-Benign FaultsIEEE/ACM Transactions on Networking10.1109/TNET.2023.328318432:1(283-297)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3283184
Zhou BWu CYang QZhu ZNie YYu W(2023)Traffic-Aware Fast Reroute Mechanism Exploiting Disjoint Subpaths for Named Data NetworksICC 2023 - IEEE International Conference on Communications10.1109/ICC45041.2023.10279628(4013-4019)Online publication date: 28-May-2023
https://doi.org/10.1109/ICC45041.2023.10279628
Zhou BZhu ZNie YChen XYan BYang QWu C(2023)Fast Proactive Re-Route with Detours on Joint Paths in Named-Data Networks for Communications of Smart Electric Power Transmission Grids2023 15th International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS56262.2023.10041321(640-648)Online publication date: 3-Jan-2023
https://doi.org/10.1109/COMSNETS56262.2023.10041321
Miguel-Alonso J(2023)A Research Review of OpenFlow for Datacenter NetworkingIEEE Access10.1109/ACCESS.2022.323346611(770-786)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2022.3233466
Schmid SSchou MSrba JVanerio JBianchi GMei A(2022)R-MPLSProceedings of the 18th International Conference on emerging Networking EXperiments and Technologies10.1145/3555050.3569140(276-292)Online publication date: 30-Nov-2022
https://dl.acm.org/doi/10.1145/3555050.3569140
Bankhamer GElsasser RSchmid S(2022)Local Fast Rerouting With Low Congestion: A Randomized ApproachIEEE/ACM Transactions on Networking10.1109/TNET.2022.317473130:6(2403-2418)Online publication date: Dec-2022
https://doi.org/10.1109/TNET.2022.3174731
Tan HKuo T(2022)Optimistic Fast ReroutingICC 2022 - IEEE International Conference on Communications10.1109/ICC45855.2022.9838260(1692-1697)Online publication date: 16-May-2022
https://doi.org/10.1109/ICC45855.2022.9838260
Foerster KHirvonen JPignolet YSchmid STredan G(2022)On the Price of Locality in Static Fast Rerouting2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN53405.2022.00032(215-226)Online publication date: Jun-2022
https://doi.org/10.1109/DSN53405.2022.00032
Johansen NKar LMadsen ANielsen KSchmid SSrba JTollund R(2022)FBR: Dynamic Memory-Aware Fast Rerouting2022 IEEE 11th International Conference on Cloud Networking (CloudNet)10.1109/CloudNet55617.2022.9978819(55-60)Online publication date: 7-Nov-2022
https://doi.org/10.1109/CloudNet55617.2022.9978819
Isyaku BBakar KGhaleb FAl-Nahari A(2022)Dynamic Routing and Failure Recovery Approaches for Efficient Resource Utilization in OpenFlow-SDN: A SurveyIEEE Access10.1109/ACCESS.2022.322284910(121791-121815)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3222849
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents