Patent classifications
H04L12/743
Weighted load balancing using scaled parallel hashing
A method for weighted data traffic routing can include receiving a data packet at data switch, where the data switch includes a plurality of egress ports. The method can also include, for each of the egress ports, generating an independent hash value based on one or more fields of the data packet and generating a weighted hash value by scaling the hash value using a scaling factor. The scaling factor can be based on at least two traffic routing weights of a plurality of respective traffic routing weights associated with the plurality of egress ports. The method can further include selecting an egress port of the plurality of egress ports based on the weighted hash value for each of the egress ports and transmitting the data packet using the selected egress port.
DYNAMIC ROUTE PROFILE STORAGE IN A HARDWARE TRIE ROUTING TABLE
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.
System and method for supporting shared multicast local identifiers (MLID) ranges in a high performance computing environment
System and method for supporting shared multicast local identifiers (MLIDs) a high performance computing environment. In accordance with an embodiment, a shared MLID range can be configured such that each subnet within a fabric can utilize an MLID within a shared MLID range without the need to utilize a TCAM, or other memory, lookup of a MGID to MLID mapping.
Systems and method for content provisioning via distributed presentation engines
Systems and methods for content selection with first and second recommendation engines are disclosed herein. The system can include a memory include a content library database and a model database. The system can include a user device having a first network interface and a first I/O subsystem. The system can include one or more servers that can include a packet selection system and a presentation system. These one or more servers can: receive response data from the user device; provide received response data to a first recommendation engine; alert a second recommendation engine when a selected next node is a placeholder node; retrieve at least one statistical model relevant to selection of next node content; and select next node content based on an output of the at least one statistical model.
Packet generation in the data plane of a forwarding element
A method of generating packets in the data plane of a forwarding element is provided. The method selects a configuration set from a plurality of configuration sets of based on a triggering event. The method generates a set of packets using a packet template that corresponds to the selected configuration set. The method sets values of a plurality of the packet fields to identify different information such as the destination of packets. The method places the generated set of packets into an ingress pipeline of the forwarding element.
Flow classification apparatus, methods, and systems
Apparatus, methods, and systems for tuple space search-based flow classification using cuckoo hash tables and unmasked packet headers are described herein. A device can communicate with one or more hardware switches. The device can include memory to store hash table entries of a hash table. The device can include processing circuitry to perform a hash lookup in the hash table. The lookup can be based on an unmasked key include in a packet header corresponding to a received data packet. The processing circuitry can retrieve an index pointing to a sub-table, the sub-table including a set of rules for handling the data packet. Other embodiments are also described.
ADDRESS TRANSLATION FOR EXTERNAL NETWORK APPLIANCE
Systems, methods, and computer-readable media relate to providing a network management service. A system is configured to request first network information from a first component of a network using a public IP address for the first component, wherein the first network information includes private IP addresses for a second component in the network and translate, based on a mapping information for a private IP address space to a public IP address space, the private IP address for a second component to a public IP address for the second component. The system is further configured to request second network information from the second component using the public IP address and provide a network management service for the network based on the second network information.
SELECTION OF PAIRED TRANSMIT QUEUE
Some embodiments provide a method for selecting a transmit queue of a network interface card (NIC) of a host computer for an outbound data message. The NIC includes multiple transmit queues and multiple receive queues. Each of the transmit queues is individually associated with a different receive queue, and the MC performs a load balancing operation to distribute inbound data messages among multiple receive queues. The method extracts a set of header values from a header of the outbound data message. The method uses the extracted set of header values to identify a receive queue which the MC would select for a corresponding inbound data message upon which the NIC performed the load balancing operation. The method selects a transmit queue associated with the identified receive queue to process the outbound data message.
System and method for supporting ICN-within-IP networking
An ICN-over-IP architecture, which supports ICN-dependent IP addresses, is provided as an integrated architecture requiring small changes within the network, utilizing the incrementally introduced ICN-enabled IP routers efficiently where ICN-enabled IP routers are distributed within/across domains and are capable of coordinating among others based on domain or ICN imposed policies. System, devices and methods are provided achieving improved performance with the introduction of additional ICN-enabled IP routers within/across domains, and continuing to perform efficiently by relying on the principles of the current IP forwarding and taking advantage of IP's currently available features.
Forwarding element data plane with flow size detector
Some embodiments of the invention provide a data-plane forwarding circuit (data plane) that has a flow-size detection circuit that generates flow-size density distribution for all or some of the data message flows that it processes for forwarding in a network. The flow-size (FS) detection circuit in some embodiments generates statistical values regarding the processed data message flows, and based on these statistical values, it generates a FS density distribution that expresses a number of flows in different flow-size sub-ranges in a range of flow sizes. In some embodiments, the density distribution is a probabilistic density distribution that is based on probabilistic statistical values that the flow-size detection circuit generates for the data message flows that are processed for forwarding within the network. The FS detection circuit in some embodiments generates probabilistic statistical values for the data message flows by generating hash values from header values of the data message flows and accumulating flow-size values at memory locations identified by the generated hash values. In some embodiments, the generated hashes for different data message flows can collide, which results in the accumulated flow-size values being probabilistic values that might have a certain level of inaccuracy.