P4R-Type: A Verified API for P4 Control Plane Programs

Author:

Larsen Jens Kanstrup1ORCID,Guanciale Roberto2ORCID,Haller Philipp2ORCID,Scalas Alceste1ORCID

Affiliation:

1. DTU, Kongens Lyngby, Denmark

2. KTH Royal Institute of Technology, Stockholm, Sweden

Abstract

Software-Defined Networking (SDN) significantly simplifies programming, reconfiguring, and optimizing network devices, such as switches and routers. The de facto standard for programming SDN devices is the P4 language. However, the flexibility and power of P4, and SDN more generally, gives rise to important risks. As a number of incidents at major cloud providers have shown, errors in SDN programs can compromise the availability of networks, leaving them in a non-functional state. The focus of this paper are errors in control-plane programs that interact with P4-enabled network devices via the standardized P4Runtime API. For clients of the P4Runtime API it is easy to make mistakes that may lead to catastrophic failures, despite the use of Google’s Protocol Buffers as an interface definition language. This paper proposes P4R-Type, a novel verified P4Runtime API for Scala that performs static checks for P4 control plane operations, ruling out mismatches between P4 tables, allowed actions, and action parameters. As a formal foundation of P4R-Type, we present the F P4R calculus and its typing system, which ensure that well-typed programs never get stuck by issuing invalid P4Runtime operations. We evaluate the safety and flexibility of P4R-Type with 3 case studies. To the best of our knowledge, this is the first work that formalises P4Runtime control plane applications, and a typing discipline ensuring the correctness of P4Runtime operations.

Funder

DTU Nordic Five Tech Alliance

Horizon Europe

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference26 articles.

1. Anoud Alshnakat , Didrik Lundberg , Roberto Guanciale , Mads Dam , and Karl Palmskog . 2022 . HOL4P4: semantics for a verified data plane . In Proceedings of the 5th International Workshop on P4 in Europe. 39–45 . Anoud Alshnakat, Didrik Lundberg, Roberto Guanciale, Mads Dam, and Karl Palmskog. 2022. HOL4P4: semantics for a verified data plane. In Proceedings of the 5th International Workshop on P4 in Europe. 39–45.

2. Carolyn Jane Anderson , Nate Foster , Arjun Guha , Jean-Baptiste Jeannin , Dexter Kozen , Cole Schlesinger , and David Walker . 2014. NetKAT: Semantic foundations for networks. Acm sigplan notices, 49, 1 ( 2014 ), 113–126. Carolyn Jane Anderson, Nate Foster, Arjun Guha, Jean-Baptiste Jeannin, Dexter Kozen, Cole Schlesinger, and David Walker. 2014. NetKAT: Semantic foundations for networks. Acm sigplan notices, 49, 1 (2014), 113–126.

3. A Systematic Review of Load Balancing Techniques in Software-Defined Networking

4. Ayush Bhardwaj , Zhenyu Zhou , and Theophilus A Benson . 2021 . A Comprehensive Study of Bugs in Software Defined Networks . In 2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). 101–115 . Ayush Bhardwaj, Zhenyu Zhou, and Theophilus A Benson. 2021. A Comprehensive Study of Bugs in Software Defined Networks. In 2021 51st Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). 101–115.

5. Type-level programming with match types

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3