A Survey on P4 Challenges in Software Defined Networks: P4 Programming
نویسندگان
چکیده
Software Defined Networking (SDN) has been a prominent technology in the last decade that increases networking programmability. The SDN philosophy decouples application, control, and data plane to increase network is an essential but unsolved component receives less attention than control application planes. Traditionally, uses fixed functions forward packets using limited number of protocols. P4 (Programming Protocol-independent Packet Processors) language makes it possible program plane, which push next level. In research community industry, programming garnered significant attention. Surprisingly, there no comprehensive reviews programmable data-plane switches, have many advantages today’s networks. authors reviewed evolution networks from legacy planes, explained fundamentals summarized generation traditional this paper, described P4-centric standpoint discusses over 75 related papers. Several taxonomies for field are provided, outline potential areas, provide greater details regarding patterns led development technology.
منابع مشابه
On P4-tidy graphs
We study the P4-tidy graphs, a new class defined by Rusu [30] in order to illustrate the notion of P4-domination in perfect graphs. This class strictly contains the P4-extendible graphs and the P4-lite graphs defined by Jamison & Olariu in [19] and [23] and we show that the P4-tidy graphs and P4-lite graphs are closely related. Note that the class of P4-lite graphs is a class of brittle graphs ...
متن کاملGrundy number on P4-classes
In this article, we define a new class of graphs, the fat-extended P4-laden graphs, and we show a polynomial time algorithm to determine the Grundy number of the graphs in this class. This result implies that the Grundy number can be found in polynomial time for any graph of the following classes: P4-reducible, extended P4-reducible, P4-sparse, extended P4-sparse, P4-extendible, P4-lite, P4-tid...
متن کاملLaplacian integrality in P4-sparse and P4-extendible graphs
Let G be a simple graph and L = L(G) the Laplacian matrix of G. G is called L-integral if all its Laplacian eigenvalues are integer numbers. It is known that every cograph, a graph free of P4, is L-integral. The class of P4-sparse graphs and the class of P4-extendible graphs contain the cographs. It seems natural to investigate if the graphs in these classes are still L-integral. In this paper ...
متن کاملExtremal P4-stable graphs
Call a graph G k-stable (with respect to some graph H) if, deleting any k edges of G, the remaining graph still contains H as a subgraph. For a fixed H, the minimum number of edges in a k-stable graph is denoted by S(k). We prove general bounds on S(k) and compute the exact value of the function S(k) for H = P4. The main result can be applied to extremal k-edge-hamiltonian hypergraphs.
متن کاملMagnetic HUB - P4 Reflection
Project Description The project is located in the twin cities El Paso and Cd Juarez within the border area of United Stated and Mexico. During the field trip, we were about to find out the existing problems on site and try to put forward feasible architectural solutions. After the research and on site visit, it is easily found that Cd Juarez is suffering from the imbalance economic development ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3275756