Abstract: A management system (or controller) is configured to send commands to robotic components of different types (e.g., different command types, byte order types, etc.). Once configured, a translation component may be deployed to translate some commands to some robotic components that use a different command type than a native command type used by the management system. The management system uses a native byte order type to create commands, which may be big endian or little endian. While some of the robotic components (e.g., first robotic components) may also use the native byte order type, other robotic components (e.g., second robotic components) may use a non-native byte order type (in relation to the management system). For example, the native byte order type may be big endian while the non-native byte order type may be little endian, or vice versa.

Abstract: A network protocol is provided to identify and authenticate devices from different vendors that are deployed in a network. Each vendor is provided a vendor key unique to the vendor by a network management server. A vendor server associated with the vendor provisions a device with a first hash value generated using the vendor key among other device attributes. When the device is deployed in the network, the network management server queries the device. The device generates a second hash value using the first hash value and sends it in a response to the network management server. The network management server computes a local hash value using the vendor key and the attributes received from the response. The network management server authenticates the device if the local hash value matches with the second hash value.

Abstract: A heat pipe is provided that is adapted for use as part of an antenna. The heat pipe includes a first conductive shell portion; a second conductive shell portion; and an insulating shell portion disposed between and connected to the first conductive shell portion and the second conductive shell portion. A wick structure is disposed within the sealed chamber.

Abstract: Packet processors or other devices with packet processing pipelines may implement pipelined evaluations of algorithmic forwarding route lookups. As network packets are received, a destination address for the network packets may be divided into different possible prefix lengths and corresponding entries in a routing table for the different possible prefix lengths may be determined according to a hash scheme for the routing table. The entry values may be read from the routing table and evaluated at subsequent stages to identify the entry with a longest prefix match with respect to the destination address for the network packet. The routing table may include entries for different types of network packets and may be configured to include virtual routing and forwarding for network packets.

Abstract: Systems, methods, apparatus and computer readable medium is disclosed for extending the Virtual Routing and Forwarding (VRF) in the network using embedded source identifiers in the packets. An example apparatus may include ports, memory and processing logic. The memory may include VRF routing tables corresponding to respective VRF domains and a list of media access control (MAC) addresses, wherein each MAC address in the list is linked to one of the respective VRF routing tables. The processing logic may be configured to receive an ingress packet at a port, identify a matching MAC address in the list that matches a source identifier of the ingress packet, and process the ingress packet according to the respective VRF domain associated with the matching MAC address that matches the source identifier.

Abstract: Techniques are disclosed regarding interfaces, each configured to output network packets. The techniques can include a memory storing a first multipath group associated with the interfaces and a routing table, containing a first route to the first multipath group. The techniques can also include congestion detection logic configured to determine that an interface of the first multipath group is congested. The techniques can additionally include congestion avoidance logic configured to, upon determining that the interface of the first multipath group is congested, generate a second route in the routing table to a second multipath group associated with the interfaces of the first multipath group, wherein the second route diverts a flow of network packets from the first multipath group to the second multipath group.

Abstract: Disclosed are techniques regarding interfaces, each configured to output network packets. The techniques can include a memory storing a first multipath group associated with the interfaces and a routing table containing routes to the first multipath group. The techniques can further include congestion detection logic configured to determine that an interface of the first multipath group is congested from a flow of network packets, the flow of network packets directed to the first multipath group from a route of the routing table. The techniques can additionally include congestion avoidance logic configured to, upon determining that the interface of the first multipath group is congested, dissociate the route from the first multipath group and associate the route with a second multipath group, the second multipath group associated with the interfaces of the first multipath group.

Abstract: Entropy in routing tables may be increase to perform packet forwarding. Hash tables that store forwarding routes may be divided into multiple hash table segments. Forwarding routes may be stored across the hash table segments in different route segments. When looking up route segments to identify a forwarding route for a destination address of a network packet, digest values generated for previous route segments may be used to determine hash key values to identify hash table entries in a different hash table segment. The forwarding route may be identified according to the hash table entries located based on the digest values for previous route segments.

Abstract: Disclosed are techniques regarding interfaces, each configured to output network packets. The techniques can regard a memory for storing multipath groups, virtual output queues, and a histogram table for storing statistical information associated with network packets to be output by interfaces. The techniques can include generating a shared-interface list including a member that represents a union of interfaces of at least some of the multipath groups, wherein the multipath groups of the member share at least one of the interfaces. The techniques can include associating the histogram table with the member. The techniques can include collecting the statistical information pertaining to network packets indicated by information stored in one of the virtual output queues, populating the histogram table with the statistical information, and determining that one of the interfaces is congested based on the statistical information.

Abstract: Systems, methods, apparatus and computer readable medium are disclosed for extending Virtual Routing and Forwarding (VRF) for a network. An example apparatus includes ports, memory and processing logic. The memory includes VRF routing tables corresponding to respective VRF domains. The memory may also include a list of media access control (MAC) addresses, wherein each MAC address in the list is linked to one of the respective VRF domains. The processing logic may be coupled to access the memory and coupled to the ports. The processing logic may be configured to receive an ingress packet at a port of the apparatus, identify a VRF domain that the ingress packet belongs to, process the ingress packet according to the VRF domain, and optionally generate an egress packet, by embedding/writing a MAC address in the egress packet that acts as a source identifier for the respective VRF domain.

Abstract: A fast reroute (FRR) implementation utilizes an optimized FRR table to implement a fast switchover to a backup link upon detecting a primary link failure on a label switched path (LSP). The switchover can be performed in a negligible amount of time (close to zero milliseconds) based on a backup indicator flag which can be dynamically updated. The FRR table stores pre-determined backup egress interfaces and FRR labels corresponding to primary egress interfaces to minimize the switchover time.

Abstract: One pre-configured code point from of a plurality of code points for a multiprotocol label switching (MPLS) traffic class represents a congestion marked code point associated with traffic congestion and the remaining code points represent not-congestion marked. Congestion associated with a label switching path can be determined based on a congestion notification from a router queue and on a pre-determined congestion indicator from a packet header.

Abstract: Disclosed herein is an apparatus for processing an Internet Protocol (IP) header and label switching (LS) headers of a packet in a pipeline. The apparatus includes an LS header processing circuit configured to select a first operation for the packet using an LS header from the packet, and an IP header processing circuit configured to perform an IP lookup to select a second operation for the packet. The apparatus further includes a tunnel initiation circuit configured to initiate an LS tunnel or IP tunnel. The LS header processing circuit, the IP header processing circuit, and the tunnel initiation circuit are operable to operate sequentially on a same packet and concurrently on different packets in a pipeline. Each of these circuits is operable to be bypassed based on an outermost header in the packet, or the selected one of the first operation or the second operation.

Abstract: Techniques are disclosed regarding receiving a plurality of flows of network packets and determining, by processing logic of a device, a hash value for each of the network packets of the flows, wherein the hash value indicates the flow of network packets that a network packet belongs to. Based on the hash value, one of a plurality of interface ports of a multipath group of the device can be selected for output of network packets from two of the flows of network packets. Network packets from the two flows of network packets to be output by the interface port can be stored. Upon determining that a number of packets stored from the one of the two flows of network packets meets a first threshold, one of the two flows of network packets can be identified as a congestion contributing flow.

Abstract: A programmable switch fabric can allow dynamic path selection for a specific class of packets using programmable action codes. Multiple packet processors inside a switch can process an incoming packet simultaneously and can make a decision (e.g., drop, forward, copy, etc.) related to the packet. A specific reassignment action code can be associated with the decision that needs to be prevailed for a specific class of packets. A priority arbiter can reassign the priority based on the specific reassignment action code so that the action associated with that action code prevails in the decision provided by the priority arbiter.

Abstract: Disclosed are techniques for determining lookup value(s) for each of a plurality of network packets. The lookup value can be used to locate a forwarding table storage location(s) for populating or retrieving forwarding information from forwarding table(s). An entropy value of the lookup values can indicate a greater degree of disorder than an entropy value for addresses of the network packets.

Abstract: A management system (or controller) is configured to send commands to robotic components of different types (e.g., different command types, byte order types, etc.). Once configured, a translation component may be deployed to translate some commands to some robotic components that use a different command type than a native command type used by the management system. The management system uses a native byte order type to create commands, which may be big endian or little endian. While some of the robotic components (e.g., first robotic components) may also use the native byte order type, other robotic components (e.g., second robotic components) may use a non-native byte order type (in relation to the management system). For example, the native byte order type may be big endian while the non-native byte order type may be little endian, or vice versa.

Abstract: Power management of a routing table, which comprises a plurality of hash tables, is provided by supporting various power domain configurations. Each power domain configuration can be associated with a different number of power domains than other power domain configurations. Each power domain can add vertical capacity to the entire routing table by adding a fixed number of buckets to each of the hash tables. Efficient power management can be achieved by switching between a lower power domain configuration and a higher power domain configuration during runtime based on the dynamic load conditions.

Abstract: Disclosed are techniques for implementing a device with memory comprising a data table, the data table configured to store a plurality of elements in buckets, wherein each of the plurality of buckets contains a plurality of elements. The memory can further comprise an indirection table, the indirection table comprising a plurality of bucket reference storage locations and a plurality of hash reference storage locations. The device can include processing logic configured to generate a plurality of hash values using information to be inserted into the data table and locate a hash reference stored in one of the plurality of hash reference storage locations corresponding to one of the plurality of hash values. The processing logic can further locate a bucket of the plurality of buckets corresponding to the one of the plurality of hash values.

Abstract: Common portions of forwarding routes in a routing table may be aggregated. A hash table may store common portions of forwarding routes in shared entries that include route aggregation maps. When a network packet is received, a shared entry may be identified that includes a common portion that is a longest matching portion of the destination address. The route aggregation map in the shared entry may then be evaluated to select a forwarding route described by the route aggregation map that matches a longest portion of the destination address subsequent to the common portion of the shared entry. The network packet may then be forwarded according to the selected forwarding route.