Deployable linear bitwise protocol transfromation

Abstract

The present application is directed to a networked apparatus including a non-transitory memory having instructions stored thereon for generating network traffic based upon a linear representation of a predetermined protocol. The apparatus also includes a processor operably coupled to the non-transitory memory and the listening tool. The processor is configured to perform the instructions of spawning a finite state machine based upon the linear representation of the predefined protocol. The processor is also configured to perform the instructions of sending data of the finite state machine to an endpoint to screen the network traffic. The processor is also configured to perform the instructions of receiving the screened network traffic from the endpoint based upon the finite state machine. The present application is also directed to a method for testing network traffic.

What is claimed is: 
     
         1 . A networked apparatus comprising:
 a non-transitory memory having instructions stored thereon for generating network traffic based upon a linear representation of a predetermined protocol;   a processor operably coupled to the non-transitory memory and the listening tool, the processor configured to perform the instructions of:
 spawning a finite state machine (FSM) based upon the linear representation of the predetermined protocol; 
 sending data of the FSM to an endpoint to screen the network traffic; and 
 receiving the screened network traffic from the endpoint based upon the FSM. 
   
     
     
         2 . The apparatus of  claim 1 , wherein the processor is further configured to perform the instructions of dynamically altering the data including a state transition of the FSM, and modifying the linear representation of the predetermined protocol without rebooting the network node, 
     
     
         3 . The apparatus of  claim 2 , wherein the state transition of the FSM changes one or more of a message header, timer and payload. 
     
     
         4 . The apparatus of  claim 1 , wherein a state of the FSM is selected from the group consisting of static, ability to be further parsed or retrieved, association with an application on the FSM, and empty content. 
     
     
         5 . The apparatus according to  claim 1 , wherein the linear representation of the predetermined protocol is based upon information including one or more of direction, stack layer, header format, alignment, encoding attributes, special characters, FSM identifiers for nodes and edges, FSM message header values, FSM timer values, FSM payload values, state of the FSM, control structures, counters, time intervals, integrity, and system constraints. 
     
     
         6 . The apparatus according to  claim 1 , wherein the linear representation of the predetermined protocol is obtained via collected network traffic packet captures or a specification. 
     
     
         7 . The apparatus according to  claim 1 , wherein the linear representation of the predetermined protocol is independent of an application on the FSM. 
     
     
         8 . The apparatus according to  claim 1 , wherein the linear representation is output onto a graphical user interface or a file. 
     
     
         9 . The apparatus according to  claim 1 , wherein the endpoint is a reader on an internet browser. 
     
     
         10 . The apparatus according to  claim 9 , wherein the endpoint is operably coupled to the processor and memory. 
     
     
         11 . The apparatus according to  claim 1 , wherein the predetermined protocol is stored in a library of the memory. 
     
     
         12 . A method for testing network traffic comprising:
 providing a client and a server;   spawning a finite state machine (FSM) based upon a linear representation of a predetermined protocol of the network traffic;   sending screened network traffic based upon the linear representation to the client and the server; and   authenticating the sent traffic at the client or server.   
     
     
         13 . The method according to  claim 12 , wherein the client and server have the same network IP address. 
     
     
         14 . The method according to  claim 12 , wherein the authenticating step includes confirming the sent traffic on a data analyzer. 
     
     
         15 . The method according to  claim 12 , wherein the machine is not rebooted prior to the sending step. 
     
     
         16 . The method according to  claim 12 , further comprising:
 deleting the predetermined protocol after the authenticating step.   
     
     
         17 . The method according to  claim 12 , wherein
 the sent traffic is independent of an application on the FSM, and   the network traffic is based upon the transport layer and is above an open service interconnect model.   
     
     
         18 . The method of  claim 12 , wherein a state of the FSM is selected from the group consisting of static, ability to be further parsed or retrieved, association with an application on the FSM, and empty content. 
     
     
         19 . The method according to  claim 12 , wherein the linear representation of the predetermined protocol is based upon information including one or more of direction, stack layer, header format, alignment, encoding attributes, special characters, FSM identifiers for nodes and edges, FSM message header values, FSM timer values, FSM payload values, state of the FSM, control structures, counters, time intervals, integrity, and system constraints. 
     
     
         20 . The method according to  claim 12 , wherein the linear representation of the predetermined protocol is obtained via collected network traffic packet captures or a specification.