Marvell International Limited

Marvellworld Trade Ltd.

Xelerated Newco Ab

Jakob Carlström

Vitaly Sukonik

Kurt Thomas Boden

Thomas Bodén

Gunnar Nordmark

Mattias Persson

Gil Levy

Carmi Arad

Sarig Livne

Par Westlund

Mark Dunaevsky

Rafi Tamir

Ronny Nilsson

Hakan Zeffer

Johan Back

Thomas Badén

The disclosed embodiments relate to a system that provides an intelligent port infrastructure for communication network devices. This is accomplished by incorporating a highly configurable pre-classifier module into the port infrastructure. This pre-classifier makes it possible to realign packet data to add a configurable number of bytes to the front of the packet, and also to select interesting data from incoming packets for further analysis. The selected data is sent into a configurable classification engine, which generates instructions that specify how to determine associated packet attributes. The packet attributes are then generated based on the instructions, and are forwarded along with the packet to downstream processing units.

Method and apparatus for pre-classifying packets

A meter module for use in a network device comprises conformance circuitry configured to: access a first memory device storing a conformance indicator that indicates whether a permitted rate of packet traffic has been exceeded, and classify packets received at the network device based at least in part on the conformance indicator. Sampling circuitry is configured to, responsively to the conformance circuitry classifying the packets: sample events associated with at least some of the received packets, and generate indicators of the sampled events. Update circuitry is configured to: access a second memory device, slower than the first memory, to update a number of tokens stored in the second memory device, and access the first memory device to update the conformance indicator when the updated number of tokens indicates that the permitted rate of packet traffic has been exceeded.

Time efficient counters and meters architecture

A write queue, for queuing a packet in a traffic manager coupled to a memory device, is selected from among a preemptable write queue configured to queue packets that are candidates for being retrieved from the traffic manager before the packets are written to the memory device and a non-preemptable write queue configured to queue packets that are not candidates for being retrieved from the traffic manager before the packets are written to the memory device. The packet is written to the selected write queue. A read request is generated for retrieving the packet from the memory device, and it is determined whether the packet is queued in the preemptable write queue. If the packet is queued in the preemptable write queue, the packet is extracted from the preemptable write queue for retrieving the packet from the traffic manager before the packet is written to the memory device.

Packet buffer with dynamic bypass

A network device includes a plurality of interfaces configured to receive, from a network, packets to be processed by the network device. A load determination circuit of the network device is configured to determine whether a packet traffic load of the network device is above a traffic load threshold, and a dual-mode counter module is configured to (i) determine a count of quanta associated with the received packets using a first counting mode in response to the load determination unit determining that the packet traffic load is above the traffic load threshold, and (ii) determine a count of quanta associated with the received packets using a second counting mode, different than the first counting mode, in response to the load determination unit determining that the packet traffic load is not above the traffic load threshold.

The present invention relates to a data buffer memory () and method for storing data in a data communications network, and to a data buffer system () comprising such a data buffer memory. The data buffer memory comprising a data section (') comprising a number of memory pages (); and a package descriptor section (&#x2032;) comprising a 5 number of package descriptors (); wherein at least one queue () of packets is stored in the data section (&#x2032;) as an ordered set of packages, and wherein a package is an ordered set of packets.

Packet buffer comprising a data section and a data description section

Aspects of the disclosure provide a method for communicating queue information. The method includes determining a queue state for each one of a plurality of queues at least partially based on respective queue length, selecting a queue with a greatest difference between the queue state of the queue and a last reported queue state of the queue, and reporting the queue state of the selected queue to at least one node.

Method, network device, computer program and computer program product for communication queue state

A network processor includes an arbitration device, a processing device, and a pipeline. The arbitration device receives a first packet and a second packet. The second packet includes a first control message. The pipeline includes access devices, where the access devices include first and second access devices. The pipeline, based on a clock signal, forwards the first and second packets between successive ones of the access devices. The arbitration device: sets a timer based on at least one of (i) an amount of time for data to travel between the first and second access devices, or (ii) a number of pipeline stages between the first and second access devices; adjusts a variable based on (i) the clock signal, and (ii) transmission of the first packet from the arbitration device to the pipeline; and based on the timer and the variable, schedules transmission of the second packet through the pipeline.

Method and apparatus for scheduling packets for transmission in a network processor having a programmable pipeline

A system for managing traffic in a communication network. The system includes a plurality of queues each configured to store data packets and a plurality of scheduling nodes each configured to process data packets from one or more of the plurality of queues. A scheduler is configured to schedule, using the plurality of scheduling nodes, respective transfers of the data packets from the plurality of queues. Each of the plurality of scheduling nodes is assigned to one or more of the plurality of queues. Each of the plurality of scheduling nodes and each of the plurality of queues is assigned a respective scheduling priority. The respective scheduling priorities are selectively changeable between a predetermined scheduling priority and a dynamic scheduling priority, wherein the dynamic scheduling priority corresponds to a priority propagated from the one or more of the plurality of queues.

Systems and methods for managing traffic in a network using dynamic scheduling priorities

A method of and a network processor unit for processing of packets in a network, the network processor comprising: communication interface configured to receive and transmit packets; at least one processing means for processing packets or parts thereof; an embedded switch configured to switch packets between the communication interface and the processing means; and wherein the embedded switch is configured to analyze a received packet and to determine whether the packet should be dropped or not; if the packet should not be dropped, the switch is configured to store the received packet, to send a first part of the packet to the processing means for processing thereof, to receive the processed first part of the packet from the processing means, and to transmit the processed first part of the packet.

Network processor unit and a method for a network processor unit

The present invention relates to a processor and a method for processing a data packet, the method including steps of decreasing a value of a first credit parameter when the data packet is admitted to a processor at least partly based on the value of the first credit parameter and a first limit of the first credit parameter, and increasing the value of the first credit parameter, in dependence on a data storage level in a buffer in which the data packet is stored before being admitted to the processor, the value of the first credit parameter not being increased, so as to become larger than a second limit of the first credit parameter, when the buffer is empty.

Method for packet flow control using credit parameters with a plurality of limits

A packet processor implemented in hardware. The packet processor includes a processing pipeline including a plurality of processing elements. The plurality of processing elements are configured to process a first data packet transferred sequentially through the plurality of processing elements. The first data packet includes information indicating a period of time that at least a first processing element of the plurality of processing elements uses to process the first data packet. The first processing element is prevented from processing other data packets due to performing processing on the first data packet during the period of time. A packet rate shaper is configured to, prior to the first data packet entering the processing pipeline, read the information in the first data packet, selectively increment and decrement a token value, and selectively grant the first data packet access to the processing pipeline based on the information and based on the token value.

Method for reducing buffer capacity in a pipeline processor

The present invention relates to a traffic manager () and a method for a traffic manager (), the method comprising the step of reading a first data packet (D-D) comprised in a first queue (Q-Q) based on a scheduling priority (SP), the scheduling priority (SP) being determined: &#x2014;at least partly on a configured priority of the first queue (Q-Q), &#x2014;at least partly on a first meter value (MV-MV) of a first meter (Mi-MM) associated with the first queue (Q-Q); and&#x2014;at least partly on a second meter value (MV-MV) of a second meter (M-M) associated with a first scheduling node (N-N); the first scheduling node being a parent node of the first queue.

Method and apparatus for managing traffic in a network

A method of and a network processor unit () for processing of packets in a network, the network processor () comprising: communication interface () configured to receive and transmit packets; at least one processing means () for processing packets or parts thereof; an embedded switch () configured to switch packets between the communication interface () and the processing means (); and wherein the embedded switch () is configured to analyze a received packet and to determine whether the packet should be dropped or not; if the packet should not be dropped, the switch is configured to store the received packet, to send a first part of the packet to the processing means () for processing thereof, to receive the processed first part of the packet from the processing means (), and to transmit the processed first part of the packet.

Growing community of inventors

Uppsala, Sweden

Jakob Carlström