Cisco Technology, Inc.

Nadav Tsvi Chachmon

Aviran Kadosh

Ofer Iny

Guy Caspary

Aviram Yeruchami

In one embodiment, quasi-Output Queue behavior of a packet switching device is achieved using virtual output queue (VOQ) ordering independently determined for each particular output queue (OQ), including using maintained latency information of the VOQs of the particular OQ. In one embodiment, all packets from all VOQs with a same port-priority destination experience similar latency within specific time-window, which is similar to the packet service provided by an Output Queue switch architecture. In one embodiment, all input ports that send traffic to same output port-priority receive bandwidth which is proportional to their bandwidth demand divided by total bandwidth. Prior approaches that emulate the performance of an OQ switch architecture require complex and time-consuming scheduling determinations and do not scale. Independently determining the order for sending packets from the VOQs associated with each particular OQ provides a scalable and implementable system with quasi-Output Queue behavior.

Quasi-output queue behavior of a packet switching device achieved using virtual output queue ordering independently determined for each output queue

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

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.

Growing community of inventors

Moshav Yaad, Israel

Nadav Tsvi Chachmon