Abstract: Detecting an anomalous configurator of a plurality of managed entities. A plurality of configuration trees, each representing configuration parameters at a corresponding managed entity, include annotations that identify a configurator that configured each parameter. For a particular configurator, a plurality of subtrees is generated from the plurality of configuration trees. A set of weighted edit distances are calculated from the plurality of subtrees, each representing a degree of difference between a different pair of subtrees. A distance matrix is populated with the set of weighted edit distances, and the distance matrix is used to identify anomalous subtree(s) within the plurality of subtrees for the particular configurator. In embodiments, a configuration corresponding to an anomalous subtree considered to have been anomalously applied by the particular configurator. Data that identifies at least one managed entity associated with the anomalous subtree, and the particular configurator is stored.

Abstract: The present disclosure relates to systems, methods, and computer-readable media for defining and implementing an ephemeral portion of a configuration state on a network device that does not persist upon coming up after experiencing a power loss event of the network device. For example, systems disclosed herein include receiving information indicating commands or policies of a configuration state that may be defined as ephemeral. The systems disclosed herein include generating and maintaining an ephemeral definition that includes modes, XPaths, and other identifiers of characteristics and specific command nodes within a hierarchical structure of commands that should be treated as ephemeral when rebooting the network device. The systems described herein provide an effective and convenient tool for defining an ephemeral portion of a configuration state that does not persist when the network device recovers from a power loss event.

Abstract: Configuration value persistence management (CVPM) tools and techniques provide faster persistence of networking device configuration values than classic approaches. CVPM consolidates configuration dump events based on certain dump conditions. Configuration value changes are journaled, and running configuration values are dumped to a data store only when the dump conditions are satisfied, instead of dumping all of the running configuration values whenever any of them is changed. Both the persistence of configurations and the restoration of persisted configurations are described. Configuration dump conditions may utilize device availability indicators, device load calculations, configuration change load calculations, dump age, or journal size, for example, or combinations thereof, with various thresholds. Thresholds may be hard, soft, or probabilistic.

Abstract: A data processing method includes receiving a stream of digital data with a plurality of objects and, in response to receiving an object, tokenizing the object to create a tokenized object, and storing the tokenized object in a token database. The method further includes comparing the tokenized object to a plurality of other tokenized objects stored in the token database, computing a pattern associated with the tokenized object, storing the pattern in a pattern database, and managing a size of the pattern database by identifying, a subset of patterns that are eligible for deletion from the pattern database based on an age of each pattern, ranking each pattern of the subset based on a quality and a popularity metric, identifying, based on the ranking and from the subset, a second pattern and deleting the second pattern from the pattern database to produce an updated database.

Abstract: Computer systems and methods for allocating bandwidth so that server computers can send data to a client computer without exceeding the available bandwidth between the server computers and the client computer, or the processing bandwidth or capacity of the client computer, are discussed herein.

Abstract: A method and apparatus for network resource allocation is provided. In some embodiments, the method comprises determining a subscriber limit rate at which a subscriber computer can process updates received from a plurality of publisher computers, wherein each of the updates comprises an electronic digital message received over a computer network; determining, for each publisher computer of the plurality of publisher computers, a not-to-exceed rate of updates sent to the subscriber computer and storing a plurality of the offered rates; determining by the subscriber computer, for each publisher computer of the plurality of publisher computer, a utility of updates sent by the publisher computer and storing a plurality of the utilities; assigning to each publisher computer of the plurality of publisher computers a publisher limit rate at which the respective publisher computer sends updates to the subscriber computer using the offered rate and the utility of updates of the respective publisher computer.

Abstract: Systems and methods for managing state data from monitored entities in a computing environment are described. In a push-based approach, a publisher computer obtains state data of an element from the monitored entities and sends the state data on to a subscriber computer. From the state data, the publisher computer generates one metadata record for the element that is updated as newer state data is obtained such that each element is associated with just one record. The publisher computer scores and ranks the records of the elements based on a time since previous state data was sent to the subscriber computer, a magnitude of a change, and the existence of one or more event flags. The publisher computer schedules and queues the state data according to their ranking. The highest priority record in a queue is sent only when a timing signal indicates that state data can be sent.

Abstract: The subject disclosure describes solutions for graphically displaying hierarchical relationships between a network underlay and a network overlay. In some aspects, a method of the technology includes steps for aggregating associations between each of a plurality of physical network devices and one or more virtual network entities, displaying two or more pivot options that graphically represent the physical network devices and/or the virtual network entities, and receiving a pivot selection indicating at least one physical network device or virtual network entity for which hierarchy information is requested by a user. In some aspects, the method can further include steps for graphically displaying one or more layers of a network hierarchy based on the pivot selection. Systems and machine-readable media are also provided.

Abstract: Techniques related to efficient transport of data encoded using multiple templates are disclosed. A sending computing device sends an internet message including internet message segments toward a receiving computing device. The internet message stores information about a data object that includes property types corresponding to property values. A portion of the data object includes multiple instances of a particular property type, and each instance corresponds to a property value. The internet message segments store the property values according to multiple templates, and each internet message segment corresponds to a template. Among the multiple templates is a particular template for the portion of the data object that includes the multiple instances of the particular property type. The multiple templates include fields that correspond to field identifiers.

Abstract: Techniques are provided for generating a network complexity score. In one approach, a plurality of node configurations that includes a first node configuration and a second node configuration are analyzed. A network complexity score is generated for a network based, at least in part, on one or more of (a) a degree of similarity between the first node configuration and the second node configuration or (b) a dependency between the first node configuration and the second node configuration.

Abstract: Techniques related to efficient transport of data encoded using multiple templates are disclosed. A sending computing device sends an internet message including internet message segments toward a receiving computing device. The internet message stores information about a data object that includes property types corresponding to property values. A portion of the data object includes multiple instances of a particular property type, and each instance corresponds to a property value. The internet message segments store the property values according to multiple templates, and each internet message segment corresponds to a template. Among the multiple templates is a particular template for the portion of the data object that includes the multiple instances of the particular property type. The multiple templates include fields that correspond to field identifiers.

Abstract: Computer systems and methods for allocating bandwidth so that server computers can send data to a client computer without exceeding the available bandwidth between the server computers and the client computer, or the processing bandwidth or capacity of the client computer, are discussed herein.

Abstract: A method and apparatus for network resource allocation is provided. In some embodiments, the method comprises determining a subscriber limit rate at which a subscriber computer can process updates received from a plurality of publisher computers, wherein each of the updates comprises an electronic digital message received over a computer network; determining, for each publisher computer of the plurality of publisher computers, a not-to-exceed rate of updates sent to the subscriber computer and storing a plurality of the offered rates; determining by the subscriber computer, for each publisher computer of the plurality of publisher computer, a utility of updates sent by the publisher computer and storing a plurality of the utilities; assigning to each publisher computer of the plurality of publisher computers a publisher limit rate at which the respective publisher computer sends updates to the subscriber computer using the offered rate and the utility of updates of the respective publisher computer.

Abstract: A data processing method includes receiving a stream of digital data with a plurality of objects and, in response to receiving an object, tokenizing the object to create a tokenized object, and storing the tokenized object in a token database. The method further includes comparing the tokenized object to a plurality of other tokenized objects stored in the token database, computing a pattern associated with the tokenized object, storing the pattern in a pattern database, and managing a size of the pattern database by identifying, a subset of patterns that are eligible for deletion from the pattern database based on an age of each pattern, ranking each pattern of the subset based on a quality and a popularity metric, identifying, based on the ranking and from the subset, a second pattern and deleting the second pattern from the pattern database to produce an updated database.

Abstract: Systems and methods for managing state data from monitored entities in a computing environment are described. In a push-based approach, a publisher computer obtains state data of an element from the monitored entities and sends the state data on to a subscriber computer. From the state data, the publisher computer generates one metadata record for the element that is updated as newer state data is obtained such that each element is associated with just one record. The publisher computer scores and ranks the records of the elements based on a time since previous state data was sent to the subscriber computer, a magnitude of a change, and the existence of one or more event flags. The publisher computer schedules and queues the state data according to their ranking. The highest priority record in a queue is sent only when a timing signal indicates that state data can be sent.

Abstract: Techniques are provided for generating a network complexity score. In one approach, a plurality of node configurations that includes a first node configuration and a second node configuration are analyzed. A network complexity score is generated for a network based, at least in part, on one or more of (a) a degree of similarity between the first node configuration and the second node configuration or (b) a dependency between the first node configuration and the second node configuration.

Abstract: Methods and apparatus for efficient decentralized information dissemination in a network are discussed herein. The decentralized information dissemination techniques are based on non-deterministic protocols such as gossip-based protocols. An example method for dissemination of information in a network can include: selecting a destination node from a set of neighboring nodes using a gossip-based protocol; transmitting a message to the destination node; and receiving a feedback response from the destination node. The feedback response can include a level of usefulness of the message to the destination node. In addition, each neighboring node in the set can be associated with a selection weight, and the selection weights can be related to a probability of selecting each neighboring node in the set as the destination node using the gossip-based protocol. Upon receiving the feedback response, the method can include adjusting the selection weight of the destination node based on the feedback response.

Abstract: Methods and apparatus for efficient decentralized information dissemination in a network are discussed herein. The decentralized information dissemination techniques are based on non-deterministic protocols such as gossip-based protocols. An example method for dissemination of information in a network can include: selecting a destination node from a set of neighboring nodes using a gossip-based protocol; transmitting a message to the destination node; and receiving a feedback response from the destination node. The feedback response can include a level of usefulness of the message to the destination node. In addition, each neighboring node in the set can be associated with a selection weight, and the selection weights can be related to a probability of selecting each neighboring node in the set as the destination node using the gossip-based protocol. Upon receiving the feedback response, the method can include adjusting the selection weight of the destination node based on the feedback response.