Cisco Technology, Inc.

Infineta Systems, Inc.

Oracle America, Inc.

Riverbed Technology, Inc.

Nimbus Data Systems, Inc.

Karempudi V Ramarao

Sandeep Kumar

Yi Jin

Ricky Keangpo Ho

Tefcros Anthias

Sunil Potti

Stephen Cho

Alex Yiu-Man Chan

Krishna Sankar

Yuquan Jiang

Pranta Das

Samba Reyes Njie

Ramakrishna Reddy Kandula

Stanley K Poon

Chandra Sekhar Pisupati

Preethika Sathyamangalam Kalyanasundaram

Tefcros Anthias, Jr

Alex Yin-Man Chan

Raj Kanaya

A marketing campaign management system that includes a campaign platform that categorizes intended recipient profiles corresponding to intended recipients of marketing campaign messages based on their levels of fatigue. Recipient profiles categorized as 'saturated' are then sub-segmented to determine their relative levels of fatigue or saturation. The intended recipient profiles that are most fatigued are removed from a recipients list such that they will not be sent any campaigns until after a rest state has been completed. A transitional safe state ensures that the intended recipient profiles inserted back into the list are not immediately removed once again.

Network management based on marketing message fatigue

A method is disclosed for high-speed processing of structured application messages in a network device. According to one aspect, a network device receives a structured application layer message and identifies, in message classification requirements at the network device, a reference to a classification portion of the structured application layer message and an operation portion of the structured application layer message. The system extracts, based on one or more expressions, a portion of the message for classifying the structured application layer message and classifies the message using the extracted portion and according to the message classification requirements. At least in part by accessing information indicated by one or more location identifiers, at least one operation is performed on the classified structured application layer message.

Method and apparatus for high-speed processing of structured application messages in a network device

Data units within a de-duplication device are stored in single instances within a database of data units and then referenced as many times as necessary within a referencing dictionary, potentially achieving substantial compaction of the referencing dictionary and thus the storage requirement of the de-duplication device as a whole.

Space-efficient, revision-tolerant data de-duplication

A write-data hash value corresponding to a block of write data is generated within a deduplicating data storage system. A block of lookup table entries is retrieved from a location in a lookup table stored within a block-based storage medium, the lookup table location being indicated by a first portion of the write-data hash value and each lookup table entry including a pointer to a respective stored data volume, a portion of a hash value that corresponds to the stored data volume, and a reference count indicating a quantity of references to the stored data volume. A second portion of the write-data hash value is compared to the portions of the hash values within the block of lookup table entries, and the reference count is incremented within one of the lookup table entries for which the portion of the hash value is determined to match the second portion of the write-data hash value.

Low-overhead deduplication within a block-based data storage

A method is disclosed for high-speed processing of structured application messages in a network device. According to one aspect, a network device receives a set of message classification rules that have been prepared beforehand by a system administrator or customer. The system analyzes the message classification rules to determine what part(s) of the message are necessary to classify a message according to the message classification rules. This allows the system to consider only the relevant parts of the message and ignore the rest of the message. The system extracts the portion of the message necessary for classifying the message and classifies the message using the values of the extracted information and the message classification rules. A unique sequence of operations is implied by the message classification and those operations must then be applied to the message.

Redundant data is removed from a volume of data by partitioning the volume of data into fixed-length input segments and determining, for each of the input segments, whether a selected portion of the input segment matches a portion of a segment within a de-duplication dictionary. If the portion of the input segment matches a portion of the segment within the dictionary, the segment within the de-duplication dictionary is compared with the input segment and a token representative of the segment within the dictionary is substituted for at least part of the input segment determined to match the segment within the dictionary.

Revision-tolerant data de-duplication

In an embodiment, a data processing system comprises application workflow optimizing logic and which when executed is operable to receive first workflow data that defines a sequence of processing operations to perform on an application-layer message; rewrite the first workflow data by separation of dependent update operations to result in creating rewritten workflow data; and store the rewritten workflow data in a data repository. Application gateway logic may be operable to receive one or more packets; construct a received message from one or more payloads of the packets; classify the received message to identify a particular workflow associated with the message; apply the particular workflow, using the rewritten workflow data, to the received message to result in identifying a destination application server and creating an outgoing message; send the outgoing message to the destination application server.

Application gateway device

Redundant data is removed from a volume of data by partitioning the volume of data into fixed-length input segments and, for each of the input segments, traversing nodes of a search tree in accordance with the value of a fixed-size portion of the input segment to determine if the search tree contains a pointer to a matching fixed-sized portion of a segment within a dictionary. If the search tree contains the pointer, the input segment is compared with the segment within the dictionary pointed to by the pointer, and a token representative of the segment within the dictionary is substituted for at least part of the input segment determined to match the segment within the dictionary.

Dictionary architecture and methodology for revision-tolerant data de-duplication

A network infrastructure element such as a router or switch performs transparent and optimized validation of XML schemas of XML payloads received in the network element. The network element comprises logic for receiving and storing one or more validation scope rules that define a portion of an extensible markup language (XML) schema for validation; receiving and storing the XML schema; receiving over the network an application-layer message comprising one or more of the packets; identifying a particular XML element in an XML payload of the application-layer message, wherein the particular XML element is within the portion of the XML schema defined in the one or more validation scope rules; determining whether the particular XML element conforms to the XML schema; and performing a responsive action based on whether the particular XML element conforms to the XML schema.

XML message validation in a network infrastructure element

In an embodiment, an XPath automaton with state look-ahead capability can efficiently determine whether XML documents, received in a stream in serialized form in a network element, match any of a set of XPath expressions. A token processor receives a structured electronic document in serialized format and identifies entities. A name recognition engine recognizes names of elements of the document and recognizes names of attributes of the elements. A finite state automaton comprises states and transitions representing structural relationships among elements and attributes of structured path expressions and state look-ahead logic that is configured to output a final state when an entity matches one or more of the structured path expressions. The automaton performs state transitions resulting in reaching a specified final state if a match to an expression occurs.

Growing community of inventors

San Ramon, CA, United States of America

Karempudi V Ramarao