Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Abstract: Aspects of the subject technology relate to systems for arbitrating direct forwarder (“DF”) instantiation between VPC peers used to facilitating the transport of bidirectional multicast traffic over a L2/L3 network boundary. In some aspects, arbitration of DF instantiation on a given VPC peer can include determining a first set of metrics for a first VPC switch, determining a second set of metrics for a second VPC switch, and determining, at the first VPC switch, whether to instantiate a designated forwarder (DF) operation based on a comparison of the first set of metrics and the second set of metrics. Methods and machine-readable media are also provided.

Abstract: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

Abstract: In one embodiment, longest prefix matching (LPM) operations are performed on a value in multiple interspersed prefix length search spaces to determine an overall longest prefix matching result in a packet switching system. A first LPM lookup unit performs a first LPM operation on the particular lookup value in a first search space finding a first longest matching prefix, and a second LPM lookup unit performs a second LPM operation on the particular lookup value in a second search space finding a second longest matching prefix. The longer of the first and second longest matching prefixes determines the overall LPM. In one embodiment, the first search space and the second search space include non-default route prefixes with interspersed prefix lengths matching a same value, such as, but not limited to the particular lookup value (e.g., a destination address of a packet).

Abstract: The present disclosure involves systems and methods for managing a trie routing table for a networking device of a communication or computer network. In one implementation, the networking device may utilize a dynamic algorithm for associating hashing functions with pivot tiles of the routing table to improve hash utilization and avoid hash collisions. Further, route prefixes may be relocated from pivot tiles in an attempt to free the tiles for reallocation to other prefix base width or may be relocated to other possible pivot tiles or to a general storage space when a hash collision is detected. This provides for even distribution of pivots within tiles which have base widths in range of a pivot route. The above implementations may occur together or separately to improve the operation of the networking device and provide faster route lookup.

Abstract: In one embodiment, longest prefix matching (LPM) operations are performed on a value in multiple interspersed prefix length search spaces to determine an overall longest prefix matching result in a packet switching system. A first LPM lookup unit performs a first LPM operation on the particular lookup value in a first search space finding a first longest matching prefix, and a second LPM lookup unit performs a second LPM operation on the particular lookup value in a second search space finding a second longest matching prefix. The longer of the first and second longest matching prefixes determines the overall LPM. In one embodiment, the first search space and the second search space include non-default route prefixes with interspersed prefix lengths matching a same value, such as, but not limited to the particular lookup value (e.g., a destination address of a packet).

Abstract: In accordance with one example embodiment, a system configured for programming a network layer multicast address entry in a routing table of an ingress line card module is disclosed. The network layer multicast address entry includes a network layer address associated with at least one egress line card. The system is further configured for programming a data link layer multicast routing address entry in a routing table of a fabric card module in which the data link layer multicast routing address entry corresponds to the network layer multicast address entry.

Abstract: In one embodiment, a method includes receiving a request to add a prefix to memory for a route lookup at a forwarding device, the memory comprising a plurality of pivot tiles for storing pivot entries, each of the pivot entries comprising a plurality of prefixes and a pointer to a trie index, searching at the forwarding device, a dynamic pool of the pivot tiles based on a base-width associated with the prefix, allocating at least a portion of the pivot tile to the base-width and creating a pivot entry for the prefix and other prefixes with a corresponding base-width, and dynamically updating prefixes stored on the pivot tiles based on route changes to optimize storage of prefixes on the pivot tiles. An apparatus and logic are also disclosed herein.

Abstract: Aspects of the subject technology relate to systems for arbitrating direct forwarder (“DF”) instantiation between VPC peers used to facilitating the transport of bidirectional multicast traffic over a L2/L3 network boundary. In some aspects, arbitration of DF instantiation on a given VPC peer can include determining a first set of metrics for a first VPC switch, determining a second set of metrics for a second VPC switch, and determining, at the first VPC switch, whether to instantiate a designated forwarder (DF) operation based on a comparison of the first set of metrics and the second set of metrics. Methods and machine-readable media are also provided.

Abstract: A plurality of line cards with each line card having a respective network forwarding engine and a respective outgoing interface (OIF) list and at least one fabric module communicatively coupled with each line card with each fabric module can have a respective network forwarding engine. The local OIF list can be asymmetrically programmed. The network forwarding engine of a line card can be configured to receive a multicast packet, compare a multicast address associate with the received multicast packet with entries in the local OIF list of the line card and forward the received multicast packet to at least one interface associated with the multicast address in response to the comparison resulting in a match.

Abstract: Methods and systems may be provided for installing a route entry associated with multicast traffic to a memory. Client devices may be notified of the route entry for advertisement by an active source device. The delivery group and delivery source may be retrieved from the information for the route entry. Multicast data trees may maintain delivery group and delivery source information for access.

Abstract: Techniques are provided for optimizing multicast routing in a network. At a router device, a message is sent to one or more physical devices. The message is configured to solicit a response indicating a network assignment for each of the physical devices. A response message is received from each of the physical devices. The response message comprises network assignment information for each of the physical devices. For each of the physical devices, the network assignment information is translated into a segment identifier. The segment identifier is distributed to other router devices in the network.

Abstract: Techniques are provided for optimizing multicast routing in a network. At a router device, a message is sent to one or more physical devices. The message is configured to solicit a response indicating a network assignment for each of the physical devices. A response message is received from each of the physical devices. The response message comprises network assignment information for each of the physical devices. For each of the physical devices, the network assignment information is translated into a segment identifier. The segment identifier is distributed to other router devices in the network.

Abstract: Techniques are provided for optimizing multicast routing in a network. At a router device, a message is sent to one or more physical devices. The message is configured to solicit a response indicating a network assignment for each of the physical devices. A response message is received from each of the physical devices. The response message comprises network assignment information for each of the physical devices. For each of the physical devices, the network assignment information is translated into a segment identifier. The segment identifier is distributed to other router devices in the network.

Abstract: Devices, methods and instructions encoded on computer readable medium are provided herein for creation of an overlay network on a non-multicast or source specific multicast (SSM) core. In one example, virtual private network (VPN) adjacencies are established between an adjacency server and one or more edge devices each located at different network sites. A unicast replication list is then generated at the adjacency server. The unicast replication list includes the Internet Protocol addresses for each of the edge devices having VPN adjacencies with the adjacency server. The unicast replication list is then advertised to each of the edge devices for use in establishing VPN adjacencies with one another.

Abstract: Techniques are provided for optimizing multicast routing in a network. At a router device, a message is sent to one or more physical devices. The message is configured to solicit a response indicating a network assignment for each of the physical devices. A response message is received from each of the physical devices. The response message comprises network assignment information for each of the physical devices. For each of the physical devices, the network assignment information is translated into a segment identifier.