Arista Networks, Inc.

Prashanth Krishnamurthy

Tula Kraiser

Simon Francis Capper

Michael Chih-Yen Wang

Peter Lam

Sebastiano Borgione

Sean Hope

A network address translation (NAT) device may receive a network packet having a network address for translation. The NAT device may determine whether a translation for the network address exists on the NAT device. The NAT device may forward the network packet to a peer NAT device based on a criterion.

Network address translation (NAT) devices configured to resolve NAT state synchronization issues

Processing an ingress packet in a packet pipeline to determine a forwarding rule includes identifying a matching rule in each forwarding table in the pipeline. Prefix lengths of the respective matching rules are compared. The matching rule with the greatest prefix length serves as the basis for forwarding an egress packet.

Forwarding rules among lookup tables in a multi-stage packet processor

Techniques for implementing history-based connection-server affinity on a network load balancer are provided. In one set of embodiments, the network load balancer can receive a network packet destined for a service, where the service is associated with a plurality of servers, and where the packet is part of a network connection between a client device and one of the plurality of servers. The network load balancer can further compute, using a portion of the packet, a bucket identifier of a bucket for the network connection, identify a first server in the plurality of servers that is currently mapped to the bucket identifier in a hash table, and send the packet to the first server. If the network load balancer receives the packet back from the first server, the network load balancer can determine, based on local history information, a second server that was previously mapped to the bucket identifier in the hash table and send the packet to that second server.

Implementing history-based connection-server affinity on a network load balancer

Techniques for implementing resilient hashing with multiple hashes are provided. In one set of embodiments, a network device can maintain a first hash table comprising mappings between a first set of hash indices and a set of bit values. The network device can also maintain a second hash table comprising mappings between a second set of hash indices and active next-hop destinations. Upon receiving a network packet, the network device can compute a first hash and can match the first hash value to a first mapping in the first hash table based on the first mapping's hash index. When the first mapping's bit value indicates that the first mapping's hash index corresponds to an active next-hop destination, the network device can further match the first hash value to a second mapping in the second hash table and send the network packet to the second mapping's active next-hop destination.

Resilient hashing with multiple hashes

Certain embodiments disclosed herein relate to method for egress maximum transmission unit (MTU) enforcement. The method may include receiving a protocol packet at an ingress interface of a network device; make a first determination of a protocol packet payload length; performing an ingress MTU identifier lookup in an ingress MTU identifier table using the protocol packet payload length to obtain an ingress MTU identifier; performing a packet propagation lookup to obtain an egress MTU identifier; performing an MTU enforcement lookup in an MTU enforcement table using the ingress MTU identifier and the egress MTU identifier to obtain an egress action; and performing the egress action.

Growing community of inventors

San Jose, CA, United States of America

Prashanth Krishnamurthy