Abstract: The present invention is directed towards systems and methods for efficient Xpath matching of a document comprising Extensible Markup Language (XML) or JavaScript Object Notation (JSON). A Xpath engine identifies an Xpath expression for processing values in the document, which is represented by a stack of nodes. The device may traverse the stack from top to bottom to match each step of the Xpath expression to a type and name of one or more nodes in the stack. The device may store a flag in each node that matches a step of the Xpath expression. Responsive to encountering a leaf node, the device may trace bottom to top from the leaf node to one or more flagged nodes in the stack and compare each flagged node against a corresponding step of the path expression. Responsive to the tracing of the flagged nodes, the device determines if the path expression is matched.

Abstract: The present disclosure is related to a method for transmitting information on priority basis to one or more nodes in distributed network. The routing server at source node generates one or more set of nodes from plurality of nodes based on reputation value. The routing server identifies first set of nodes with highest reputation value, determines predicted action to be perforrmed by each node. The routing server transmits information to each node in first set. Each node performs an action. The routing server computes the difference between the predicted action and action performed by each node in the first set and updates the reputation value of each node in the first set. Thereafter, routing server transmits the information the second set, third set and so on.

Abstract: The present disclosure is related to a method for identifying optimal influential paths in a distributed network for transmitting information/request to one or more target nodes. The routing server at the source node identifies one or more target nodes in the network based on information. Thereafter, routing server identifies one or more optimal nodes based on influence value associated with each node in network and determines predicted action that will be performed by the optimal node and transmits the information to each optimal node. Each optimal node performs an action upon receiving the information from the source node. The routing server receives the data related to the operation performed and updates influence value associated with respective nodes. The routing server identifies one or more optimal paths based on one of the influence value being updated and the action performed by each optimal node.

Abstract: Systems and methods are described for efficiently processing, searching and/or rewriting variable width encoded data, such as UTF-8 encoded data, will be described. Embodiments of the systems and methods modify and adapt search algorithms, such as the Horspool and Wu-Manber algorithms, to efficiently process and manage searching of variable width encoded text in large blocks of text, such as text that may be carried via a stream of packets thru a network device, such as an intermediary device.

Abstract: Systems and methods are described for efficiently processing, searching and/or rewriting variable width encoded data, such as UTF-8 encoded data, will be described. Embodiments of the systems and methods modify and adapt search algorithms, such as the Horspool and Wu-Manber algorithms, to efficiently process and manage searching of variable width encoded text in large blocks of text, such as text that may be carried via a stream of packets thru a network device, such as an intermediary device.

Abstract: The present invention is directed towards systems and methods for efficient Xpath matching of a document comprising Extensible Markup Language (XML) or JavaScript Object Notation (JSON). A Xpath engine identifies an Xpath expression for processing values in the document, which is represented by a stack of nodes. The device may traverse the stack from top to bottom to match each step of the Xpath expression to a type and name of one or more nodes in the stack. The device may store a flag in each node that matches a step of the Xpath expression. Responsive to encountering a leaf node, the device may trace bottom to top from the leaf node to one or more flagged nodes in the stack and compare each flagged node against a corresponding step of the path expression. Responsive to the tracing of the flagged nodes, the device determines if the path expression is matched.