research-article

Free access

Provable data plane connectivity with local fast failover: introducing openflow graph algorithms

Authors:

Michael Borokhovich,

Stefan SchmidAuthors Info & Claims

HotSDN '14: Proceedings of the third workshop on Hot topics in software defined networking

Pages 121 - 126

https://doi.org/10.1145/2620728.2620746

Published: 22 August 2014 Publication History

Abstract

Modern software-defined networks support the implementation of in-network failover mechanisms: mechanisms to quickly re-establish connectivity in the data plane without the interaction of the software controller. Interestingly, however, not much is known today about how to make use of these mechanisms.

This paper shows a very strong result: there exist failover implementations for OpenFlow that achieve a maximal robustness, in the sense that connectivity is always ensured as long as the underlying physical network is connected. In particular, we show that the problem of computing failover tables is related to graph search, and present three different algorithms achieving different tradeoffs, in terms of the number of required failover rules, the number of tags, as well as the resulting path lengths.

Our work can also be seen as a first attempt to implement classic graph algorithms in OpenFlow.

References

[1]

M. Borokhovich and S. Schmid. How (not) to shoot in your foot with sdn local fast failover: A load-connectivity tradeoff In Proc. 17th International Conference on Principles of Distributed Systems (OPODIS), 2013.

Digital Library

[2]

J. F. et al. Ba: On the resilience of routing tables. In Proc. ACM Symposium on Principles of Distributed Computing (PODC), pages 237--238, 2012.

Digital Library

[3]

E. Gafni and D. Bertsekas. Distributed algorithms for generating loop-free routes in networks with frequently changing topology. Communications, IEEE Transactions on, 29(1):11{18, Jan 1981.

[4]

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

Digital Library

[5]

J. Liu, A. Panda, A. Singla, B. Godfrey, M. Schapira, and S. Shenker. Ensuring connectivity via data plane mechanisms. In Proce. 10th USENIX NSDI, pages 113--126, 2013.

Digital Library

[6]

J. Liu, B. Yan, S. Shenker, and M. Schapira. Data-driven network connectivity. In Proc. HotNets, pages 8:1--8:6, 2011.

Digital Library

[7]

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

Digital Library

[8]

D. Madory. Renesys blog: Large outage in pakistan. Blog, 2011.

[9]

P. Pan, G. Swallow, and A. Atlas. Fast reroute extensions to RSVP-TE for LSP tunnels. In RFC 4090, 2005.

[10]

D. Peleg. Distributed computing: a locality-sensitive approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.

Digital Library

[11]

M. Reitblatt, M. Canini, A. Guha, and N. Foster. Fattire: Declarative fault tolerance for software-defined networks. In Proc. HotSDN, pages 109--114, 2013.

Digital Library

[12]

H. Saito and M. Yoshida. An optimal recovery LSP assignment scheme for MPLS fast reroute. In Proc. NETWORKS, 2002.

[13]

Tech Report. http://www.net.t-labs.tu-berlin.de/~stefan/hotsdn14tr.pdf. Technical report, pdf, 2014

[14]

J.-P. Vasseur, M. Pickavet, and P. Demeester. Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS. Morgan Kaufmann Publishers Inc., 2004.

Digital Library

[15]

D. Wang and G. Li. Efficient distributed bandwidth management for MPLS fast reroute. IEEE/ACM Trans. Netw., 2008.

Digital Library

Cited By

Qin HChen JQiu XZhang XCui M(2024)FAPR: An Adaptive Approach to Link Failure Recovery in SDN with High Speed and Low Interruption RateApplied Sciences10.3390/app1411471914:11(4719)Online publication date: 30-May-2024
https://doi.org/10.3390/app14114719
Franco DHiguero MSanz AUnzilla JHuarte M(2024)vFFR: A Very Fast Failure Recovery Strategy Implemented in Devices With Programmable Data PlaneIEEE Open Journal of the Communications Society10.1109/OJCOMS.2024.34934175(7121-7146)Online publication date: 2024
https://doi.org/10.1109/OJCOMS.2024.3493417
Györgyi CLarsen KSchmid SSrba J(2024)SyPer: Synthesis of Perfectly Resilient Local Fast Re-Routing Rules for Highly Dependable NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621323(2398-2407)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621323
Show More Cited By

Index Terms

Provable data plane connectivity with local fast failover: introducing openflow graph algorithms
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols

Recommendations

Devolving IEEE 802.1X authentication capability to data plane in software-defined networking SDN architecture

Software-defined networking SDN is a relatively new approach in network management that proposes to separate the network control Control plane and the forwarding process Data plane to optimize the network infrastructure and improve network performance, ...
Performance evaluation of a hybrid IP/SDN network in data centre network architectures

The current Internet is facing many challenges to accommodate the growing demands of cloud computing. Software‐defined networking (SDN) is an emerging paradigm, proposed to be used in this context in order to investigate these issues. SDN virtualises ...
A packet-in message filtering mechanism for protection of control plane in openflow networks
ANCS '14: Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems

Protecting control planes in networking hardware from high rate packets is a critical issue for networks under operation. One common approach for conventional networking hardware is to offload expensive functions onto hard-wired offload engines as ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

HotSDN '14: Proceedings of the third workshop on Hot topics in software defined networking

August 2014

252 pages

ISBN:9781450329897

DOI:10.1145/2620728

Program Chairs:
Aditya Akella
University of Wisconsin-Madison, USA
,
Albert Greenberg
Microsoft, USA

Copyright © 2014 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Conference

SIGCOMM'14

Sponsor:

SIGCOMM

SIGCOMM'14: ACM SIGCOMM 2014 Conference

August 22, 2014

Illinois, Chicago, USA

Acceptance Rates

HotSDN '14 Paper Acceptance Rate 50 of 114 submissions, 44%;

Overall Acceptance Rate 88 of 198 submissions, 44%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

69
Total Citations
View Citations
1,004
Total Downloads

Downloads (Last 12 months)63
Downloads (Last 6 weeks)5

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Qin HChen JQiu XZhang XCui M(2024)FAPR: An Adaptive Approach to Link Failure Recovery in SDN with High Speed and Low Interruption RateApplied Sciences10.3390/app1411471914:11(4719)Online publication date: 30-May-2024
https://doi.org/10.3390/app14114719
Franco DHiguero MSanz AUnzilla JHuarte M(2024)vFFR: A Very Fast Failure Recovery Strategy Implemented in Devices With Programmable Data PlaneIEEE Open Journal of the Communications Society10.1109/OJCOMS.2024.34934175(7121-7146)Online publication date: 2024
https://doi.org/10.1109/OJCOMS.2024.3493417
Györgyi CLarsen KSchmid SSrba J(2024)SyPer: Synthesis of Perfectly Resilient Local Fast Re-Routing Rules for Highly Dependable NetworksIEEE INFOCOM 2024 - IEEE Conference on Computer Communications10.1109/INFOCOM52122.2024.10621323(2398-2407)Online publication date: 20-May-2024
https://doi.org/10.1109/INFOCOM52122.2024.10621323
Györgyi CLarsen KSchmid SSrba J(2024)SyRep: Efficient Synthesis and Repair of Fast Re-Route Forwarding Tables for Resilient Networks2024 54th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)10.1109/DSN58291.2024.00053(483-494)Online publication date: 24-Jun-2024
https://doi.org/10.1109/DSN58291.2024.00053
Hraska MPapan J(2023)Enhanced Derived Fast Reroute Techniques in SDN2023 33rd Conference of Open Innovations Association (FRUCT)10.23919/FRUCT58615.2023.10143071(70-76)Online publication date: 24-May-2023
https://doi.org/10.23919/FRUCT58615.2023.10143071
Verdi FLuz G(2023)InFaRR: In-Network Fast ReRoutingIEEE Transactions on Network and Service Management10.1109/TNSM.2023.328345920:3(2319-2330)Online publication date: Sep-2023
https://doi.org/10.1109/TNSM.2023.3283459
El kamel A(2023)A Fast Failure Recovery Mechanism using On-Premise/Cloud-based NAS in SDN2023 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC58397.2023.10217995(1090-1093)Online publication date: 9-Jul-2023
https://doi.org/10.1109/ISCC58397.2023.10217995
Bashir HFaisal ADogar FGavrilovska AAltınbüken DBinnig C(2022)Network resource management as a database problemProceedings of the 13th Symposium on Cloud Computing10.1145/3542929.3563508(63-71)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1145/3542929.3563508
Kaddoura MBahr NGambucci E(2022)SH-P2P: Self-Healing Peer-to-Peer Network with Optimal Multicast Routing2022 IEEE International Conference on Electro Information Technology (eIT)10.1109/eIT53891.2022.9813897(027-031)Online publication date: 19-May-2022
https://doi.org/10.1109/eIT53891.2022.9813897
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
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents