Some optimization possibilities in data plane programming
Altangerel Gereltsetseg, Tejfel M\'at\'e

TL;DR
This paper reviews challenges in data plane programming within SDN and proposes optimization techniques like language enrichment, compression, caching, and offloading, with practical implementation in P4 to enhance packet processing.
Contribution
It introduces novel optimization strategies for data plane programming and demonstrates their feasibility through implementation in P4 language.
Findings
Optimizations can significantly improve packet processing performance.
Practical implementations show the feasibility of proposed solutions.
Enhanced data plane programming can lead to better network efficiency.
Abstract
Software-defined networking (SDN) technology aims to create a highly flexible network by decoupling control plane and the data plane and programming them independently. There has been a lot of research on improving and optimizing the control plane, and data plane programming is a relatively new concept, so study on it is one of the hot topics for researchers. At the 2019 Dagstuhl Seminar, well-known scientists on computer networking discussed challenges and problems in the field of data plane programming that need to be addressed over the next 10 years. Based on this seminar issues and papers review, we suggested some possible solutions which are for optimizing data plane to improve packet processing performance and link utilization. The suggestions include (i) enriching data plane language with asynchronous external function, (ii) compression based on payload size, (iii) in-network…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms
