research-article

P4-Protect: 1+1 Path Protection for P4

Authors:

Steffen Lindner,

Daniel Merling,

Marco Häberle,

Michael MenthAuthors Info & Claims

EuroP4'20: Proceedings of the 3rd P4 Workshop in Europe

Pages 21 - 27

https://doi.org/10.1145/3426744.3431327

Published: 01 December 2020 Publication History

Abstract

1+1 protection is a method to secure traffic between two nodes against failures in between. The sending node duplicates the traffic and forwards it over two disjoint paths. The receiving node assures that only a single copy of the traffic is further forwarded to its destination. In contrast to other protection schemes, this method prevents almost any packet loss in case of failures. 1+1 protection is usually applied on the optical layer, on Ethernet, or on MPLS.

In this work we propose the application of 1+1 for P4-based IP networks. We define an 1+1 protection header for that purpose. We describe the behavior of sending and receiving nodes and provide a P4-based implementation for the Behavioral Model version 2 (bmv2) software switch and the hardware switch Tofino Edgecore Wedge 100BF-32X. We illustrate how to secure traffic, e.g. individual TCP flows, on the Internet with this approach. Finally, we present performance results showing that the P4-based implementation efficiently works on the Tofino Edgecore Wedge 100BF-32X.

Supplementary Material

MOV File (3426744.3431327.mov)

Presentation Video

Download
37.08 MB

References

[1]

A. Atlas et al. 2008. RFC5286: Basic Specification for IP Fast Reroute: Loop-Free Alternates.

[2]

Ender Ayanoglu et al. 1993. Diversity coding for transparent self-healing and fault-tolerant communication networks. IEEE ToC 41(11) (1993).

[3]

P. Bosshart et al. 2014. P4: Programming Protocol-Independent Packet Processors. ACM CCR 44(3) (2014).

Digital Library

[4]

Wolfgang Braun et al. 2017. Performance Comparison of Resilience Mechanisms for Stateless Multicast Using BIER. In IFIP/IEEE.

[5]

Norman Finn, Pascal Thubert, Balazs Varga, and János Farkas. 2019. Deterministic Networking Architecture. RFC 8655. https://doi.org/10.17487/RFC8655

[6]

Linux Foundation. 2019. Linux Traffic Control.

[7]

A. Fumagalli et al. 2000. IP restoration vs. WDM protection: is there an optimal choice? IEEE Network Magazine 14(6) (2000).

Digital Library

[8]

IEEE Computer Society. 2017. Frame Replication and Elimination for Reliability. Technical Report.

[9]

ITU. 2006. ITU-T Recommendation G.803/Y.1342 (2006), Ethernet Protection Switching.

[10]

ITU. 2010. ITU-T Recommendation G.7712/Y.1703 (2010), Internet protocol aspects - Operation, administration and maintenance.

[11]

A. Karan et al. 2015. RFC7431: Multicast-Only Fast Reroute.

[12]

James McCauley, Mingjie Zhao, Ethan J. Jackson, Barath Raghavan, Sylvia Ratnasamy, and Scott Shenker. 2016. The Deforestation of L2. In Proceedings of the 2016 ACM SIGCOMM Conference.

Digital Library

[13]

Sèamas McGettrick et al. 2013. Ultra-fast 1+1 protection in 10 Gb/s symmetric Long Reach PON. In IEEE ECOC).

[14]

Daniel Merling et al. 2018. Efficient Data Plane Protection for SDN. IEEE (Net-Soft).

[15]

Christopher Metz. 2000. IP protection and restoration. IEEE Internet Computing 4(2) (2000).

Digital Library

[16]

Mirzad Mohandespour et al. 2015. Multicast 1 + 1 protection: The case for simple network coding. In IEEE ICNC.

[17]

Grazziela Niculescu et al. 2010. The Packet Delay in a MPLS Network Using "1 + 1 Protection. In IEEE Advanced International Conference on Telecommunications.

Digital Library

[18]

Michal Przybylski, Bartosz Belter, and Artur Binczewski. 2005. Shall we worry about Packet Reordering? Computational Methods in Science and Technology 11.

[19]

Jean Philippe Vasseur et al. 2004. Network Recovery. Morgan Kaufmann.

[20]

Dongyun Zhou et al. 2000. Survivability in Optical Networks. IEEE Network Magazine 14(6) (2000).

Digital Library

[21]

Harald Øverby et. al. 2012. Cost comparison of 1 + 1 path protection schemes: A case for coding. In IEEE ICC.

Cited By

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
Li ZTian LXia JHu Y(2023)A Multipath Routing Mechanism by Packet Replication and Elimination for Reliable Communications2023 IEEE 23rd International Conference on Communication Technology (ICCT)10.1109/ICCT59356.2023.10419830(1364-1369)Online publication date: 20-Oct-2023
https://doi.org/10.1109/ICCT59356.2023.10419830
Hauser FHäberle MMerling DLindner SGurevich VZeiger FFrank RMenth M(2023)A survey on data plane programming with P4: Fundamentals, advances, and applied researchJournal of Network and Computer Applications10.1016/j.jnca.2022.103561212(103561)Online publication date: Mar-2023
https://doi.org/10.1016/j.jnca.2022.103561
Show More Cited By

Recommendations

Parking packet payload with P4
CoNEXT '20: Proceedings of the 16th International Conference on emerging Networking EXperiments and Technologies

Network Function (NF) deployments suffer from poor link goodput, because popular NFs such as firewalls process only packet headers while receiving and transmitting complete packets. As a result, unnecessary packet payloads needlessly consume link ...
P4: programming protocol-independent packet processors

P4 is a high-level language for programming protocol-independent packet processors. P4 works in conjunction with SDN control protocols like OpenFlow. In its current form, OpenFlow explicitly specifies protocol headers on which it operates. This set has ...
P4 programmable patch panel (P7): an instant 100g emulated network on your tofino-based pizza box
SIGCOMM '22: Proceedings of the SIGCOMM '22 Poster and Demo Sessions

Alternatives to run high-fidelity network experiments are traditionally based on virtual and emulation-based environments (e.g., Mininet). While extremely useful for teaching and in support of research practices, existing experimental platforms are ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

EuroP4'20: Proceedings of the 3rd P4 Workshop in Europe

December 2020

71 pages

ISBN:9781450381819

DOI:10.1145/3426744

Copyright © 2020 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 ACM 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: 01 December 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

Deutsche Forschungsgemeinschaft (DFG)

Conference

CoNEXT '20

Sponsor:

SIGCOMM

CoNEXT '20: The 16th International Conference on emerging Networking EXperiments and Technologies

December 1, 2020

Barcelona, Spain

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
263
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)2

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

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
Li ZTian LXia JHu Y(2023)A Multipath Routing Mechanism by Packet Replication and Elimination for Reliable Communications2023 IEEE 23rd International Conference on Communication Technology (ICCT)10.1109/ICCT59356.2023.10419830(1364-1369)Online publication date: 20-Oct-2023
https://doi.org/10.1109/ICCT59356.2023.10419830
Hauser FHäberle MMerling DLindner SGurevich VZeiger FFrank RMenth M(2023)A survey on data plane programming with P4: Fundamentals, advances, and applied researchJournal of Network and Computer Applications10.1016/j.jnca.2022.103561212(103561)Online publication date: Mar-2023
https://doi.org/10.1016/j.jnca.2022.103561
Mazloum AKfoury EGomez JCrichigno J(2023)A Survey on Rerouting Techniques with P4 Programmable Data Plane SwitchesComputer Networks10.1016/j.comnet.2023.109795230(109795)Online publication date: Jul-2023
https://doi.org/10.1016/j.comnet.2023.109795
Castorio GCentofanti CMarotta AGraziosi F(2022)On P4-based Reliability: Path Protection for Programmable Data Planes2022 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)10.1109/ANTS56424.2022.10227774(393-397)Online publication date: 18-Dec-2022
https://doi.org/10.1109/ANTS56424.2022.10227774
Merling DLindner SMenth M(2021)Robust LFA Protection for Software-Defined Networks (RoLPS)IEEE Transactions on Network and Service Management10.1109/TNSM.2021.309084318:3(2570-2586)Online publication date: Sep-2021
https://doi.org/10.1109/TNSM.2021.3090843

View Options

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.

Figures

Tables

Media

View Table of Conten