Packeteer, Inc.

Apple Inc.

Michael J Quinn

Jon Eric Okholm

Mary Laier

Roopesh R Varier

Saurabh Aggarwal

Scott Andrew Hankins

James Joseph Stabile

Brett D Galloway

Paul Leslie Archard

Li Fang

David Jacobson

Farzad Ghannadian

Christopher J Plummer

George C Cowsar

Michael B Shoemaker

A system and method for dynamically controlling aggregate and individual packet flow characteristics within a compressed logical data tunnel. A logical data tunnel is formed and includes one or more packet flows. Each packet flow includes individual packets having a shared destination address. Bandwidth allocated to control an aggregated flow of packets routed through the logical data tunnel. A transfer rate is assigned to control each packet flow transiting within the logical data tunnel.

System and method for dynamically controlling aggregate and individual packet flow characteristics within a compressed logical data tunnel

Packet flow rate control techniques are enhanced by the interactive and early invocation of packet queuing to control short flows of packets and to eliminate undershoot and overshoot of a targeted flow rate. Packet queuing involves the scheduled release of packets in accordance with flow policies (priorities) to achieve a pre-selected outgoing target flow rate. The combination of controlled packet queuing and packet flow rate control with appropriate mechanisms for favoring one over the other improves the efficiency of data transmission.

Method and apparatus for controlling transmission flow using explicit rate control and queuing without data rate supervision

A method for use in a network device that uses a proportional/integral/derivative (PID)-type algorithm to compute one or more flow control parameters intended to achieve a target rate for a data flow.

Aggregate rate control using PID

Methods, apparatuses and systems directed to an adaptive network traffic monitoring and measurement system. In one implementation, the present invention provides a measurement engine that monitors data flows on the packet processing path of a network device and executes measurement policy that control the granularity with which measurement data is recorded. In one implementation, the present invention provides a filtering and aggregation mechanism that can seamlessly adapt to changes in measurement policy configuration.

Adaptive, flow-based network traffic measurement and monitoring system

Flow-aware task distribution in network devices having multiple processor architectures. In one embodiment, the present invention can be used for high bandwidth network processing in an application and flow aware Quality of Service (QoS) network device. In some implementations, the present invention provides a task distribution architecture capable of flow state awareness and link level QoS control. In some implementations, the present invention can incorporate one or more processes, such as flow distributors and device distributors, that route packets for processing among different processing units on the basis flow correspondence and/or link or network path attributes. The flow and device distributors, in one implementation, allow for the separation and paralletization of packet processing functionality into flow-specific and link-specific processing units, allowing for a highly-scalable, flow-aware task distribution in a network device that processes network application traffic.

Multi-dimensional computation distribution in a packet processing device having multiple processing architecture

Methods, apparatuses and systems allowing for network link state mirroring in intermediate network devices. A variety of intermediate network devices disposed between two network devices are operationally transparent to the two network devices. For example, a bandwidth management device disposed between a gateway router and a LAN hub or switch, is operationally transparent, to both network devices since the bandwidth management device, pacing or otherwise controlling packet flows, does not alter the essential routing or switching functions of the devices. The present invention promotes or enhances this operational transparency by mirroring the link state detected at a first network interface on other network interfaces. This functionality is highly useful in today's network topologies where information regarding failure of a link can be used to re-route traffic, alert a network administrator, and the like.

Network link state mirroring

Packet flow rate control techniques are enhanced by the interactive and early invocation of packet queuing to control short flows of packets and to eliminate undershoot and overshoot of a targeted flow rate. Packet queuing involves the scheduled release of packets in accordance with flow policies (priorities) to achieve a preselected outgoing target flow rate. The combination of controlled packet queuing and packet flow rate control with appropriate mechanisms for favoring one over the other improves the efficiency of data transmission.

Method and apparatus for controlling data transmission volume using explicit rate control and queuing without data rate supervision

Methods, apparatuses and systems facilitating the distribution of updated traffic identification functionality to bandwidth management devices. The present invention, in one embodiment, allows for automatic updates to the traffic identification functionality implemented by bandwidth management devices eliminating the cumbersome upgrade processes required by prior art methods and systems. The present invention, in one embodiment, also provides a system facilitating management of upgrades for multiple bandwidth management devices.

Methods, apparatuses and systems facilitating distribution of updated traffic identification functionality to bandwidth management devices

A method and apparatus for performing classification in a hierarchical classification system performing caching are described. In one embodiment, the method comprises walking a classification tree in the hierarchical classification system to determine whether an incoming flow matches a class in the classification tree, and performing a lookup on a cache storing a data structure of multiple classes of one classification type to compare the incoming flow with multiple classes at the same time to determine whether the incoming flow matches one of the classes.

Method and apparatus for fast lookup of related classification entities in a tree-ordered classification hierarchy

A system which enables new data paths that form different network configurations to be constructed during the run time of the computer determines whether a given configuration specified by a user is legitimate, and if so, creates a data path. In operation, a user issues a command to open a data path containing a particular protocol module. In response, an open handler inquires whether the particular configuration specified by the user is proper. This inquiry is sent to individual configurators, which comprise shared libraries containing routines pertaining to the various protocols stored in the computer. A configurator responds to the inquiry if it contains information pertaining to the protocol identified by the user. The routines in the configurator also indicate whether the protocol module can be connected in a legitimate configuration. If it can, a data path is created. If the particular connection specified by the user is not proper, the configurator routine identifies a different code module to which the specified protocol module can be properly connected. This process continues in a recursive manner, until a legitimate configuration is found. A data path is then constructed in accordance with this configuration.

System for run-time configuration of network data transfer paths

A system is provided for managing code resources for use by client applications in a computer, wherein the computer has internal memory storing at least one client application. The apparatus comprises a resource set catalog stored in the internal memory. The resource set catalog identifies a plurality of function sets of functions by respective function set IDs. Further, the resource set catalog includes set records which characterize the functions within the respective sets. A dispatch engine, in the internal memory, linked with a client application, supplies a particular function set ID in response to a call by the client application of a particular function which is a member of a corresponding function set identified by the particular function set ID. A lookup engine in the internal memory, coupled with the resource set catalog and the dispatch engine, is responsive to the particular function set ID to look up a set record for a corresponding function set in the resource set catalog. Finally, a link engine in the internal memory and coupled with the dispatch engine returns the particular function to the client application in response to the set record. Thus, because the link engine is responsive to the set record, which is not linked with the client, the client need not be aware of changes in the structure of the library in which the particular function set resides. Thus, the function set can be moved into and out of internal memory, revised, placed in different sections of internal memory, and otherwise handled independently of the client, without requiring re-compilation of the client application.

Growing community of inventors

Campbell, CA, United States of America

Michael J Quinn