 primitives, and alternative features which provide strength to the Open Flow protocol. The potential combinatorial complexity of OpenFlow version 1.1 'see Figure 4' and further versions don't work properly with ASIC-based forwarders due to that question arises on the capability of concept picked for OpenFlow, as has its appropriateness for ALL applications. From version 1.3 of OpenFlow, it started supporting few ancient table capability descriptions by adding the concept match type for every match fields e.g., exact match, LPM, and wildcard. Drawbacks which were cited for the existing theory (OpenFlow) are: Combinatorial state explosion Control events which were operated by Data-plane Fragile Indirection Infrastructure Loss of Information Leakage of Information Deficient concept of Control plane to Data plane Weak extensibility Numerous control engines Time-sensitive periodic messaging Figure 4. OpenFlow pipeline model in v1.1 and above (n = no. of tables, a = no. of actions and l = match field width size) Packet iPort MetaD (+0) Action Set (+0) Packet Packet Match Packet Context Match Contex Up to 255 Apply iterations Action Set (adding Data Flow actions & Metadata) Table N Table 0 Downloaded: 4/15/2022 9:44:49 AM Nova Southeastern University IP Address: 137.52.76.29 Introduction to OpenFlow FAWG is a discrete workgroup, which is trying a first-generation, negotiated switch model through Table Type Patterns (TTPs). FAWG has created a method of constructing, uniquely identifying, and sharing TTPs. To determine agreed TTPs between controller and the network elements has developed a negotiated messaging and algorithm which is built on a Yang model in version 1.4 of of-config. A TTP is a predetermined switch behaviour model, represented by match/mask, action table profiles and table linkage through a pipeline which represents the personality. According to the task of elements in the service flow, these table profiles may vary e.g., for the Hierarchal Virtual Private LAN Services (HVPLS) forwarder position of elemen