Marvell Israel (misl) Ltd.

Marvellworld Trade Ltd.

Einat Ophir

Vitaly Sukonik

Itay Peled

Dan Ilan

Michael Weiner

Sarig Livne

Mark Dunaevsky

Rafi Tamir

Moshe Anschel

A packet processing system and method for processing data units are provided. A packet processing system includes a processor, first memory having a first latency, and second memory having a second latency that is higher than the first latency. A first portion of a queue for queuing data units utilized by the processor is disposed in the first memory, and a second portion of the queue is disposed in the second memory. A queue manager is configured to push new data units to the second portion of the queue and generate an indication linking a new data unit to an earlier-received data unit in the queue. The queue manager is configured to transfer one or more queued data units from the second portion of the queue to the first portion of the queue prior to popping the queued data unit from the queue, and to update the indication.

Device and method for packet processing with memories having different latencies

There is provided a network device comprising a physical queue management processor configured to manage attributes of physical queues of data packets. The network device further comprises a scheduling processor which is configured to manage scheduling nodes that establish a scheduling hierarchy among the physical queues in a network, utilizing a bi-directional mapping of the physical queues to logical queues. The network device further comprises a traffic management processor which is configured to modify the bi-directional mapping mentioned above.

Dynamic reshuffling of traffic management scheduler hierarchy

Aspects of the disclosure provide a method for network traffic scheduling. The method includes selecting, at a present node within a node hierarchy that multiplexes a plurality of input nodes to an output node, a winning node from a plurality of lower level nodes, obtaining first parameters provided from the winning node, the first parameters being in association with the winning node, determining second parameters in association with the present node at least partially based on the first parameters, and providing the second parameters in association with the present node to an upper level node in the node hierarchy for scheduling at the upper level node. To determine the second parameters in association with the present node, in an embodiment, the method includes using the first parameters to look up an entry in a lookup table that stores the second parameters in association with the first parameters.

Network traffic scheduler and associated method, computer program and computer program product

Growing community of inventors

Tel Mond, Israel

Einat Ophir