Abstract: Systems, methods, and computer-readable media for identifying a spanning tree loop in a network environment. Spanning tree loop indicators occurring in a network environment that utilizes a spanning tree protocol are identified. The spanning tree loop indicators are correlated to identify correlated spanning tree loop indicators within the network environment. A potential spanning tree loop is recognized from a plurality of the correlated spanning tree loop indicators based on indicator types of the correlated spanning tree loop indicators. The potential spanning tree loop is remedied in the network environment in response to recognizing the potential spanning tree loop in the network environment.

Abstract: A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

Abstract: A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

Abstract: Systems, methods, and computer-readable media for identifying a spanning tree loop in a network environment. Spanning tree loop indicators occurring in a network environment that utilizes a spanning tree protocol are identified. The spanning tree loop indicators are correlated to identify correlated spanning tree loop indicators within the network environment. A potential spanning tree loop is recognized from a plurality of the correlated spanning tree loop indicators based on indicator types of the correlated spanning tree loop indicators. The potential spanning tree loop is remedied in the network environment in response to recognizing the potential spanning tree loop in the network environment.

Abstract: Present technology is directed to preferred processing and the verification of diagnostic signatures for a plurality of network defect. The disclosed optimization process is based on expressing each Diagnostic Signature as a minimal sum of product Boolean function of associated network commands, followed by ranking of each command reference in the product terms of the Boolean expression as well as each Boolean product terms of the SOP Boolean expressions, and constructing a decision tree based on the provided rankings to thereby determine a minimum set of commands along with an preferred command dispatch sequence for evaluating a Diagnostic Signature. Further aspects include the translation of both the optimization computation (interpretation of network conditions associated with a network defect) and the computed workflow (dispatch of the command) into a series of declarative rules that can be processed by a machine reasoning engine to thereby automate the optimization process.

Abstract: Systems, methods, and computer-readable media for identifying a spanning tree loop in a network environment. Spanning tree loop indicators occurring in a network environment that utilizes a spanning tree protocol are identified. The spanning tree loop indicators are correlated to identify correlated spanning tree loop indicators within the network environment. A potential spanning tree loop is recognized from a plurality of the correlated spanning tree loop indicators based on indicator types of the correlated spanning tree loop indicators. The potential spanning tree loop is remedied in the network environment in response to recognizing the potential spanning tree loop in the network environment.

Abstract: The present technology addresses a need in the art for an automated tool that allows users to create network-based custom workflows for networks and associated management applications. The users do not need to have in-depth network knowledge to work with the tool or even write any code/script. The tool provides the users with a flexible graphical user interface for automated troubleshooting, network provisioning, and closed-loop automation. Further, the tool uses a domain-independent semantic machine reasoning engine as an underlying engine and a mock data engine to test and validate network-based workflows created by the users.

Abstract: The present technology addresses a need in the art for a closed-loop automation system of a managed network that detects and fixes an issue in the managed network with minimal to no human intervention. The closed-loop automation system employs a domain-independent semantic machine reasoning engine as an underlying engine. After detecting the issue in the managed network, the system searches through a knowledge base to find a match for the detected issue. The knowledge base includes previously collected knowledge from subject matter experts and maintenance teams. The system then proposes a remedial action to a user of the managed network for approval. After approval by the user, the system implements the remedial action.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.

Abstract: The present technology addresses a need in the art for an automated tool that allows users to create network-based custom workflows for networks and associated management applications. The users do not need to have in-depth network knowledge to work with the tool or even write any code/script. The tool provides the users with a flexible graphical user interface for automated troubleshooting, network provisioning, and closed-loop automation. Further, the tool uses a domain-independent semantic machine reasoning engine as an underlying engine and a mock data engine to test and validate network-based workflows created by the users.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.

Abstract: The present technology addresses a need in the art for a closed-loop automation system of a managed network that detects and fixes an issue in the managed network with minimal to no human intervention. The closed-loop automation system employs a domain-independent semantic machine reasoning engine as an underlying engine. After detecting the issue in the managed network, the system searches through a knowledge base to find a match for the detected issue. The knowledge base includes previously collected knowledge from subject matter experts and maintenance teams. The system then proposes a remedial action to a user of the managed network for approval. After approval by the user, the system implements the remedial action.

Abstract: The present technology addresses a need in the art for an automated tool that allows users to create network-based custom workflows for networks and associated management applications. The users do not need to have in-depth network knowledge to work with the tool or even write any code/script. The tool provides the users with a flexible graphical user interface for automated troubleshooting, network provisioning, and closed-loop automation. Further, the tool uses a domain-independent semantic machine reasoning engine as an underlying engine and a mock data engine to test and validate network-based workflows created by the users.

Abstract: A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

Abstract: A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

Abstract: A computer implemented method for implementing a real time reconciling shared data structure is disclosed. The shared data structure may be stored in a memory, and a portion of the shared data structure may be coupled with a processor. The computer implemented method may be used for interacting with the shared data structure. The method may comprise the exchange of messages, requesting to change data in the shared data structure, between selected participants, wherein some of the participants must validate requested changes to the shared data. If all participants validate the requests to change data the changes to the data are made, and if less than all participants validate the requests then the changes are not made.

Abstract: In one embodiment, a device in a network obtains data indicative of one or more execution sequences of a semantic reasoner. The device trains a machine learning model to predict use of an ontology by the semantic reasoner, based on the data indicative of the one or more execution sequences of the semantic reasoner. The device predicts, using the machine learning model, use of a particular ontology by the semantic reasoner. The device prefetches the particular ontology from another device via the network, prior to the semantic reasoner completing an execution sequence that requires the particular ontology.

Abstract: Present technology is directed to preferred processing and the verification of diagnostic signatures for a plurality of network defect. The disclosed optimization process is based on expressing each Diagnostic Signature as a minimal sum of product Boolean function of associated network commands, followed by ranking of each command reference in the product terms of the Boolean expression as well as each Boolean product terms of the SOP Boolean expressions, and constructing a decision tree based on the provided rankings to thereby determine a minimum set of commands along with an preferred command dispatch sequence for evaluating a Diagnostic Signature. Further aspects include the translation of both the optimization computation (interpretation of network conditions associated with a network defect) and the computed workflow (dispatch of the command) into a series of declarative rules that can be processed by a machine reasoning engine to thereby automate the optimization process.

Abstract: Systems and methods are provided for efficiently permitting the transmission and receipt of trading messages between message sources configured to use a variety of different protocols. Messaging gateways may be configured to reformat messages for proper transmission across a transport mechanism. Messaging gateways may also insert sequence and group information into message headers to facilitate processing messages in the proper order. Messages may be processed with processing threads that are dynamically allocated by messaging gateways.

Abstract: The disclosed embodiments relate to implementation of a syntax for altering one or more rules by which a blockchain may be modified wherein the software implementing each client of a blockchain network are programmed to be responsive to requests or directives to alter one or more rules by which blocks may be added to a blockchain responsive to transactions received for storage therein, the requests/directives being processed by the client as a transaction and added to the block in accordance with the current state of the operating rules, thereby adding a new rule or modifying an existing rule for subsequent operation of the client.