Abstract:
The present technology is directed to providing a 3-D visualization of a Wi-Fi signal propagation pattern based on telemetry data. The present technology can receive telemetry data for a Wi-Fi access point located at a location of a building plan in a Wi-Fi visualization system, store the telemetry data with a timestamp, determine a change in a Wi-Fi coverage for the Wi-Fi access point based on the telemetry data, and present a visualization illustrating the change in the Wi-Fi coverage for the Wi-Fi access point. The present technology can further present an animation of the change in the Wi-Fi coverage for the Wi-Fi access point based on the stored telemetry data.
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 generating and presenting workflow graphs can include the following operations. A workflow graph including vertices is provided. An event is received to reorganize the vertices of the workflow graph. Each of the vertices is classified with a significance level, the significance level is based on at least one of a business rule and a vertex position of a vertex of the vertices. Vertices of the vertices having a low significance level are grouped together. The vertices in the group having the low significance level are combined into a new vertex, and the new vertex is expandable and collapsible to view the vertices in the group having the low significance level.
Abstract:
In one embodiment, an exploratory linktrace is initiated from an initiating network device with an exploratory linktrace message (ELM) having a target address. Each network device receiving the ELM may then propagate the ELM on a plurality of its ports to a plurality of downstream network devices based on the target address. In addition, each receiving network device returns an exploratory linktrace reply (ELR) for each of the plurality of ports, where each ELR is returned according to one or more mechanisms to mitigate stormed replies to the initiating network device.
Abstract:
A plurality of paths through a network are determined for transmitting a packet from a source device to a destination device. The paths are modelled as nodes in a Random Neural Network, each node corresponding to a path and a reward is calculated for each of the nodes. An excitatory weight and an inhibitory weight are determined for each of the nodes in the Random Neural Network. The excitatory weight is set directly proportional to the reward corresponding to the node for which the excitatory weight is being determined, and the inhibitory weight is set inversely proportional to the reward corresponding to the node for which the inhibitory weight is being determined. A potential is determined for each of the nodes based upon the excitatory and inhibitory weights. A path corresponding to the node with the highest potential is selected, and the packet is transmitted over the selected path.
Abstract:
A plurality of paths through a network are determined for transmitting a packet from a source device to a destination device. The paths are modelled as nodes in a Random Neural Network, each node corresponding to a path and a reward is calculated for each of the nodes. An excitatory weight and an inhibitory weight are determined for each of the nodes in the Random Neural Network. The excitatory weight is set directly proportional to the reward corresponding to the node for which the excitatory weight is being determined, and the inhibitory weight is set inversely proportional to the reward corresponding to the node for which the inhibitory weight is being determined. A potential is determined for each of the nodes based upon the excitatory and inhibitory weights. A path corresponding to the node with the highest potential is selected, and the packet is transmitted over the selected path.
Abstract:
In one embodiment, an exploratory linktrace is initiated from an initiating network device with an exploratory linktrace message (ELM) having a target address. Each network device receiving the ELM may then propagate the ELM on a plurality of its ports to a plurality of downstream network devices based on the target address. In addition, each receiving network device returns an exploratory linktrace reply (ELR) for each of the plurality of ports, where each ELR is returned according to one or more mechanisms to mitigate stormed replies to the initiating network device.
Abstract:
A method provided in one example embodiment includes detecting a first current bandwidth of a first link in a network ring, where the first current bandwidth indicates a signal degradation on the first link. The method also includes determining whether the first current bandwidth has degraded more than a second current bandwidth of a second link in the network ring, where the second current bandwidth indicates a signal degradation on the second link. The method further includes routing one or more network flows away from the first link if the first current bandwidth has degraded more than the second current bandwidth.
Abstract:
An example method for facilitating conflict avoidant traffic routing in a network environment is provided and includes detecting, at a network element, an intent conflict at a peer network element in a network, and changing a forwarding decision at the network element to steer traffic around the conflicted peer network element. The intent conflict refers to an incompatibility between an asserted intent associated with the traffic and an implemented intent associated with the traffic. In specific embodiments, the detecting includes mounting rules from the peer network element into the network element, and analyzing the mounted rules to determine intent conflict. In some embodiments, a central controller in the network deploys one or more intentlets on a plurality of network elements in the network according to corresponding intent deployment parameters.
Abstract:
In one embodiment, a broker device receives device-identifying data to identify a device in a computer network. An ontology associated with the device-identifying data is then identified by the broker device and in response to identifying the ontology, interpretation instructions related to the identified ontology are determined. The broker device receives data from the identified device and interprets the received data based on the interpretation instructions.