Results 251 to 260 of about 25,313 (297)

daPIPE a Data Plane Incremental Programming Environment

2019 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2019
DaPIPE is a programming environment that supports a developer in writing P4 code to be integrated into the pre-existing data plane program of a network device, without affecting the pre-installed network operating system. This paper discusses the challenges related to such a task and how daPIPE addresses them.
M Baldi
exaly   +2 more sources

Foundationally Verified Data Plane Programming

, 2023
P4 is a major standardized programming language for programming and specifying the network data plane. P4 is widely used in a variety of network functionalities, including monitoring, traffic management, forwarding, and security. Recently, stateful applications have been emerging in this area, as supported by programmable hardware.
Wang, Qinshi
openaire   +2 more sources

Consistent Composition and Modular Data Plane Programming

IEEE Communications Magazine, 2021
Emerging programmable data planes enable us to modify switch behavior using software abstractions. However, developing the data plane software is challenging and typically made in a monolithic manner. We argue that the data plane should be developed modularly and employ additional abstractions to compose data plane programs and steer packets between ...
Ricardo Parizotto, Lucas Castanheira, Fernanda Bonetti, Anderson Santos da Silva, Alberto Schaeffer-Filho   +4 more
openaire   +1 more source

Optimizing Data Plane Programs for the Network

Proceedings of the ACM SIGCOMM 2019 Workshop on Networking and Programming Languages, 2019
With the move of Software-defined networking from fixed to programmable data planes, network functions are written with P4 or eBPF for targets such as programmable switches, CPU based flow processors [5] and commodity CPUs [7]. These data plane programs are, however, limited in per-packet time budget [3] (e.g., 67.2 ns at 10GbE) and program size ...
Johannes Krude, Matthias Eichholz 0001, Maximilian Winck, Klaus Wehrle, Mira Mezini   +4 more
openaire   +1 more source

NDN.p4: Programming information-centric data-planes

2016 IEEE NetSoft Conference and Workshops (NetSoft), 2016
Although content-awareness at the network level is becoming more and more needed, Information-Centric Networking (ICN)-based solutions struggle to emerge. Research on ICN has already produced insightful outputs, nevertheless architecture-tied designs of ICN devices cannot be easily deployed and tested in operational networks; further those designs are ...
Signorello, Salvatore, State, Radu, Francois, Jerome, Festor, Olivier   +3 more
openaire   +3 more sources

A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis

Journal of Computational and Applied Mathematics, 2002
We will propose a new cutting plane algorithm for solving a class of semi-definite programming problems (SDP) with a small number of variables and a large number of constraints. Problems of this type appear when we try to classify a large number of multi-
Hiroshi Konno, Jun-Ya Gotoh, Takeaki Uno   +2 more
exaly   +2 more sources

Tracking P4 Program Execution in the Data Plane

Proceedings of the Symposium on SDN Research, 2020
While programmable switches provide operators with much-needed control over the network, they also increase the potential sources of packet-processing errors. Bugs can happen anywhere: in the P4 program, the controller installing rules into tables, or the compiler that maps the P4 program into the resource-constrained switch pipelines.
Suriya Kodeswaran, Mina Tahmasbi Arashloo, Praveen Tammana, Jennifer Rexford   +3 more
openaire   +1 more source

A Simple Approach to Verify and Debug Data Plane Programs

Anais do XIII Workshop de Pesquisa Experimental da Internet do Futuro (WPEIF 2022), 2022
The advances in data plane programmability through domain-specific languages such as P4 require the adoption of verification methods to ensure that a given code behaves appropriately. The standard approach in the literature is to use formal methods to verify a provided software. However, traditional techniques are often time-consuming and expensive. In
Eduardo Castilho Rosa, Italo Tiago da Cunha, Flávio de Oliveira Silva   +2 more
openaire   +1 more source

Building and Testing Modular Programs for Programmable Data Planes

IEEE Journal on Selected Areas in Communications, 2020
Programmable data planes, PDPs, enable an unprecedented level of flexibility and have emerged as a promising alternative to existing data planes. Despite the rapid development and prototyping cycles that PDPs promote, the existing PDP ecosystem lacks appropriate abstractions and algorithms to support these rapid testing and deployment life-cycles.
Peng Zheng, Theophilus A. Benson, Chengchen Hu   +2 more
openaire   +1 more source

Sandboxing Data Plane Programs for Fun and Profit

Proceedings of the SIGCOMM Posters and Demos, 2017
This paper describes the design and implementation of a general-purpose compile-time sandbox for P4 data plane programs. Our mechanism allows a supervisor to interpose on another program's interaction with the forwarding device. The sandboxing technique we use provides also a powerful new program structuring model, allowing a data plane developer to ...
Miguel C. Neves, Kirill Levchenko, Marinho P. Barcellos   +2 more
openaire   +1 more source