Cisco Technology, Inc.

Alberto Gonzalez Prieto

Alexander Clemm

Eric Albin Voit

L Alexander Clemm

Roberto Attias

Alexander L Clemm

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.

Computer system programmed to identify common subsequences in logs

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. In an embodiment, a method comprises determining a first share of bandwidth that is to be available for a first computing device to send data to the client computer during a first future period of time; determining a first rate at which the first computing device is to send data to the client computer during the first future period of time; determining that the first rate is less than the first share of bandwidth that is to be available for the first computing device to send data to the client computer during the first future period of time by a first delta; receiving, from a second computing device among the plurality of network computing devices, a first request for additional rate allocation; sending, to the second computing device, a first rate allocation that is equal to or less than the first delta; sending data to the client computer during the first future period of time at a first actual rate that is less than or equal to the first rate minus the first rate allocation.

Allocating bandwidth between network computing devices for pushing data to a client computing device

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.

Adaptive subscriber-driven resource allocation for push-based monitoring

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.

Adaptive push-based monitoring of networked entities

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. Based on a property-type-to-field-identifier mapping, a corresponding property type can be determined for each property value that is stored in the internet message segments.

Efficient transport of data encoded using multiple templates

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.

Analyzing network configuration complexity

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.

Growing community of inventors

Mountain View, CA, United States of America

Alberto Gonzalez Prieto