Marvell Israel (misl) Ltd.

Cisco Technology, Inc.

Broadcom Corporation

Marvell International Limited

Marvellworld Trade Ltd.

Marvell Semiconductor Israel Ltd.

Marvell Israel (m.l.s.l) Ltd.

Marvell Isreal (m.i.s.l.) Ltd.

Aviran Kadosh

Ofer Iny

Carmi Arad

Denis Krivitski

Yoram Revah

Eyal Michel Dagan

Gil Levy

Nafea Bishara

Yaniv Kopelman

Golan Schzukin

Nadav Tsvi Chachmon

Tal Mizrahi

Shira Turgeman

Ori Rottenstreich

Guy Caspary

Nafea Bshara

Adee Ofir Ran

Rami Zemach

Chirag Shroff

Mark Andrew Gustlin

Matthew Todd Lawson

Dylan Thomas Walker

Sachin Agarwal

Yariv Anafi

Srirajkumar Sundararaman

Samir Valjibhai Rajgor

Mohammad Issa

Kevin Shyh-Kang Chang

Symbol multiplexing Physical Medium Attachment (PMA) may be provided. A plurality of first lanes may be received and then Alignment Markers (AMs) from the plurality of first lanes may be used to determine symbol boundaries and identify the plurality of first lanes. Next, groups of the plurality of first lanes may be de-skewed and checkerboard patterns in the plurality of first lanes may be undone. Then the plurality of first lanes may be symbol-wise multiplexed to a plurality of second lanes. The plurality of second lanes may then be sent.

Symbol multiplexing physical medium attachment (PMA)

A method of operating a system-on-chip (SOC) including decrypting, by isolated Root of Trust (RoT) code, a Stock Keeping Unit (SKU) license code from a host during bootup of a device. Then validating, by the isolated RoT code, the SKU license code with firmware and at least one built-in key of a plurality of built-in keys from secure storage. Finally, enabling or disabling, by the isolated RoT code, at least one feature set of a plurality of feature sets comprising resources configured at the SOC based on at least one SKU license code which has been decrypted by isolated RoT code using at least one built-in key and authenticated by firmware.

On-demand and secure hardware license-based SKU creation for ASICs

Devices, systems, methods, and processes for transmitting and receiving one or more data packets are described herein. A device may face an internal non-deterministic delay in processing causing a gap or an interruption during transmission of the data packet. During the gap, the device can transmit one or more Intra-Packet Idle (IPI) words between the transmission of the data packet. The IPI words can be ignored or discarded by a receiver. The device may transmit the data packet into multiple parts by transmitting the IPI words between the parts. The receiver can receive the parts of the data packet and the IPI words and retrieve the data packet based on the parts of the data packet. The device may set a configurable threshold value indicative of a maximum number of the IPI words that can be transmitted during the gap of the interruption, such that the receiver can efficiently identify and discard a runt packet. The device does not require a buffer to fetch and store the data packet prior to the transmission, thereby eliminating a latency caused by the buffer.

Systems and methods of inserting idles within packets to reduce latency

A port extender provides individual flow control for ports multiplexed from a network device. The port extender is configured to multiplex a network device port across the front panel ports on the port extender. The port extender also determines that an input buffer for the network device port is overloaded, and generates a Priority-based Flow Control (PFC) frame identifying that the network device port is congested. The port extender sends the PFC frame via the network device port to the network device. The PFC frame causes the network device coupled to the network device port to discontinue sending data for transmission from the plurality of ports on the port extender.

Priority-based flow control messaging for port extender

Presented herein are methodologies in which packets or events are selected statistically to update a counter of a network device. The updated value that is stored in the counter also reflects a number of packets (or corresponding bytes) that were not selected to update the counter. The methodology includes receiving, at a network device, a first packet followed by a second packet, probabilistically selecting the second packet to update a value of a counter of the network device while probabilistically not selecting the first packet to update the value of the counter, and updating the value of the counter to account for both the first packet and the second packet.

Statistical packet and byte counters

In one embodiment, a load balancing method may comprise: assigning a plurality of packets of a flow to a plurality of segments according to a segmentation criterion, each segment including one or more packets of said plurality of packets, and at least one of the plurality of segments including more than one packet of the plurality of packets; tagging each packet of the plurality of packets with a segment sequence identifier to indicate to which segment the packet is assigned; and arranging the plurality of packets for transmission via an interconnect so that all packets belonging to a same segment will be transmitted via a same path.

Network traffic load balancing

A network element is configured to efficiently load balance packets through a computer network. The network element receives a packet associated with flow attributes and generates a Load Balancing Flow Vector (LBFV) from the flow attributes. The network element partitions the LBFV into a plurality of LBFV blocks and reorders the LBFV blocks to generate a reordered LBFV. The LBFV blocks are reordered based on a reordering sequence that is different from reordering sequences on other network elements in the computer network. The network element hashes the reordered LBFV to generate a hash key for the packet and selects a next hop link based on the hash key. The next hop link connects the network elements to a next hop network element in the computer network.

Effective seeding of CRC functions for flows' path polarization prevention in networks

A port extender provides individual flow control for ports multiplexed from a network device. The port extender is configured to multiplex a network device port across the front panel ports on the port extender. The port extender also determines that passing traffic through one of the front panel ports is degraded due to network congestion, and generates a flow control message identifying the front panel port. The port extender sends the flow control message via the network device port to the network device. The flow control message causes the network device coupled to the network device port to discontinue sending data for transmission from the degraded port.

Techniques for flow rate based load balancing are described. In one embodiment, a method includes receiving a packet associated with a packet flow at an ingress top-of-rack switch in a spine-leaf network. The method includes determining identification information for the packet flow, including a source and a destination. Based on the identification information, the method includes determining an instantaneous flow rate for a first path through the network from the source to the destination. The method also includes comparing the instantaneous flow rate to an average flow rate. Based on the comparison between the instantaneous flow rate to the average flow rate, the method includes assigning the packet flow to one of the first path or a second path.

Flow rate based network load balancing

Packets that are to be transmitted via a plurality of egress interfaces of a network device are stored in a memory of the network device. The packets are stored in a plurality of queues that respectively correspond to the egress interfaces. The network device determines a set of queues, from among the plurality of queues, for which packet dropping is enabled. The network device determines whether a utilization level of the memory meets a threshold. In response to determining that the utilization level of the memory meets the threshold: the network device randomly or pseudorandomly selects a first queue from the set of queues for which packet dropping is enabled, dequeues a first packet from the selected first queue, and deletes the first packet that was dequeued from the selected first queue.

Methods and apparatus for memory resource management in a network device

In one embodiment, a network node comprising: a memory, including one or more memory entries associated with a meter; a sensor adapted to detect a discrepancy between an allocated bandwidth allocated to the meter and a data bandwidth measured by the meter, the allocated bandwidth being a portion of a total allocated bandwidth allocated to a plurality of meters, and the discrepancy being that the allocated bandwidth compared to the data bandwidth is one of: excessive or insufficient; and a generator, wherein the generator is adapted, upon the sensor detecting that the allocated bandwidth is excessive, to generate a message indicative of at least part of the allocated bandwidth being released from the meter, and wherein the generator is further adapted, upon the sensor detecting that the allocated bandwidth is insufficient, to generate a message indicative of a request for an allocation of additional bandwidth to the meter.

Distributed meters and statistical meters

A data unit is received at a first one of a plurality of network devices associated with a first one of the plurality of link aggregate groups. A hashing function is applied to the data unit to generate a first hash value, where the first hash value identifies a communication link in the first one of the plurality of link aggregate groups. The data unit is received at a second one of the plurality of network devices associated with a second one of the plurality of link aggregate groups. The hashing function is applied to the data unit to generate a second hash value that is distinct from the first value, where the second hash value identifies a communication link in a second one of the plurality of link aggregate groups along which the data unit is to be communicated.

Growing community of inventors

Misgav, Israel

Aviran Kadosh