Silver Peak Systems, Inc.

Alcatel Canada Inc.

Alcatel-lucent Canada Inc.

Cisco Technology, Inc.

Brixham Solutions Ltd.

Hammerhead Systems, Inc.

John Burns

David Anthony Hughes

Zhigang Yin

Jonathan L Bosloy

Jan Medved

Fong Liaw

James Stewart McCormick

David Bumstead

David A Maluf

Shawn P McAllister

Herbert Michael Wildfeuer

Raghuram S Sudhaakar

David Watkinson

John Z Yu

Mark Tooker

Klement Sekera

David Furshpan

Alex Dadnam

Sameer Kanagala

In one embodiment, a network device connected to an Internet Protocol (IP) network and a serial network scans an infrastructure of the serial network. Based on the scanning, the network device can determine one or more serial endpoints within the serial network infrastructure, and may then allocate an IP address to each of the one or more serial endpoints. The network device may then map received IP network traffic into serial protocol commands on the serial network for a destination serial endpoint having an allocated IP address corresponding to a destination IP address of the received IP network traffic, and may also bridge data present on the serial network from a sourcing serial endpoint into an IP message on the IP network with an indication of a corresponding allocated IP address of the sourcing serial endpoint, accordingly.

Internet protocol (IP) network virtualization of serial network endpoints

Methods and systems for the optimization of available computing resources within a virtual environment are disclosed. An exemplary method comprises determining the sizes of the computing resources available to the virtual machine and determining optimal data structures for the virtual machine based on the sizes of the computing resources. The optimal data structures may include an indexing data structure and a historic data. The method may further comprise allocating a Random Access Memory (RAM) and disk storage to the optimal data structures and configuring the optimal data structures within the RAM and the disk storage. The optimization of data structures involves balancing requirements of the indexing data structure and the historic data.

Optimizing available computing resources within a virtual environment

A system for matching data using flow based packet data storage includes a communications interface and a processor. A communications interface receives a packet between a source and a destination. The processor identifies a flow between the source and the destination based on the packet. The processor determines whether some of packet data of the packet indicates a potential match to data in storage using hashes. The processor then stores the data from the most likely data match and second most likely data match without a packet header in a block of memory in the storage based on the flow.

Data matching using flow based packet data storage

Systems and methods for pre-fetching of data in a memory are provided. By pre-fetching stored data from a slower memory into a faster memory, the amount of time required for data retrieval and/or processing may be reduced. First, data is received and pre-scanned to generate a sample fingerprint. Fingerprints stored in a faster memory that are similar to the sample fingerprint are identified. Data stored in the slower memory associated with the identified stored fingerprints is copied into the faster memory. The copied data may be compared to the received data. Various embodiments may be included in a network memory architecture to allow for faster data matching and instruction generation in a central appliance.

Pre-fetching stored data from a memory

Systems and methods for identification of data stored in memory are provided. A data packet is received and a first packet byte within the data packet is compared to a first memory byte within a memory. A mismatch is determined between the first packet byte and the first memory byte. A memory location is accessed that contains a second memory byte that is non-consecutive with the first memory byte. A packet location accessed that contains a second packet byte that is non-consecutive with the first packet byte. The second packet byte is compared to the second memory byte. A retrieval instruction is generated based at least in part on a result of the comparison between the second packet byte and the second memory byte. Various embodiments may be included in a network memory architecture to allow for faster data matching and instruction generation in a central appliance.

Identification of non-sequential data stored in memory

Pre-fetching data into a memory

A system for processing packets includes a communications interface and a processor. A communications interface receives a packet between a source and a destination. The processor identifies a flow between the source and the destination based on the packet. The processor determines whether some of packet data of the packet matches to storage data in storage using hashes. The processor then stores the packet data in a block of memory in the storage based on the flow and if the packet data does not match the storage data.

Systems and methods for identification of data stored in memory are provided. A data packet is received and a first packet byte within the data packet is compared to a first memory byte within a memory. A mismatch is determined between the first packet byte and the first memory byte. A memory location is jumped to that contains a second memory byte that is non-consecutive with the first memory byte. A packet location is jumped to that contains a second packet byte that is non-consecutive with the first packet byte. The second packet byte is compared to the second memory byte. A retrieval instruction is generated based at least in part on a result of the comparison between the second packet byte and the second memory byte. Various embodiments may be included in a network memory architecture to allow for faster data matching and instruction generation in a central appliance.

Identification of data stored in memory

A method for deferred storage of data is disclosed. A packet comprising instructions and literal data for rebuilding packet data from a network device is received. The packet data is rebuilt according to the instructions and the literal data. The rebuilt packet data is rewritten to a temporary page in memory. A page utilization metric is calculated based on the contents of the temporary page, the contents comprising the rebuilt data packet. Whether the contents of the temporary page sufficiently match data in data storage is determined. The contents of the temporary page are discarded or stored based on the determination.

Deferred data storage

Growing community of inventors

Los Altos, CA, United States of America

John Burns