Patent classifications
H04L49/1546
METHOD AND APPARATUS TO DETECT NETWORK IDLENESS IN A NETWORK DEVICE TO PROVIDE POWER SAVINGS IN A DATA CENTER
A network device can place some or all of the packet processing pipeline into a low-power state for detected idle intervals of sufficient duration. The network device detects idleness greater than a critical duration and automatically engages a low-power mode involving clock throttling and/or clock gating. The power savings in the packet processing pipeline in the network device is based on the average long-term residency in idleness. The idle power is reduced for the packet processing pipeline in the network device by detecting average long-term idleness as a function of the minimum latency of the packet processing pipeline, which is used to reduce the clock rate of the packet processing pipeline, thereby resulting in power savings for the network device.
METHOD AND APPARATUS TO DETECT NETWORK IDLENESS IN A NETWORK DEVICE TO PROVIDE POWER SAVINGS IN A DATA CENTER
A network device can place some or all of the packet processing pipeline into a low-power state for detected idle intervals of sufficient duration. The network device detects idleness greater than a critical duration and automatically engages a low-power mode involving clock throttling and/or clock gating. The power savings in the packet processing pipeline in the network device is based on the average long-term residency in idleness. The idle power is reduced for the packet processing pipeline in the network device by detecting average long-term idleness as a function of the minimum latency of the packet processing pipeline, which is used to reduce the clock rate of the packet processing pipeline, thereby resulting in power savings for the network device.
DISTRIBUTED NETWORK CONTROL SYSTEM WITH ONE MASTER CONTROLLER PER LOGICAL DATAPATH SET
A network control system for managing a plurality of switching elements that implement a plurality of logical datapath sets. The network control system includes first and second controllers for generating requests for modifications to first and second logical datapath sets. The first controller is further for determining whether to make modifications to the first logical datapath set. The second controller is further for determining whether to make modifications to the second logical datapath set. Each controller is further for receiving logical control plane data that specifies logical datapath sets and for converting the logical control plane data to physical control plane data for propagating to the switching elements.
DISTRIBUTED NETWORK CONTROL SYSTEM WITH ONE MASTER CONTROLLER PER LOGICAL DATAPATH SET
A network control system for managing a plurality of switching elements that implement a plurality of logical datapath sets. The network control system includes first and second controllers for generating requests for modifications to first and second logical datapath sets. The first controller is further for determining whether to make modifications to the first logical datapath set. The second controller is further for determining whether to make modifications to the second logical datapath set. Each controller is further for receiving logical control plane data that specifies logical datapath sets and for converting the logical control plane data to physical control plane data for propagating to the switching elements.
Deep fusing of clos star networks to form a global contiguous web
Access nodes of a large-scale network are arranged into a number of groups. The groups are arranged into a number of bands. Each distributor of a pool of distributors interconnects each access node of a selected group to at least one channel from each group of a selected band. A discipline of allocating the selected group and the selected band to a distributor ensures that each access node has: a number, approximately equal to half the number of groups, of parallel single-hop paths to each other access node of a same group; a number, approximately equal to half the number of bands, of parallel single-hop paths to each access node of a different group within a same band; and one single-hop path to each other access node of a different access band. To eliminate the need for cross connectors, geographically-spread distributors are arranged into geographically-spread constellations of collocated distributors.
Deep fusing of clos star networks to form a global contiguous web
Access nodes of a large-scale network are arranged into a number of groups. The groups are arranged into a number of bands. Each distributor of a pool of distributors interconnects each access node of a selected group to at least one channel from each group of a selected band. A discipline of allocating the selected group and the selected band to a distributor ensures that each access node has: a number, approximately equal to half the number of groups, of parallel single-hop paths to each other access node of a same group; a number, approximately equal to half the number of bands, of parallel single-hop paths to each access node of a different group within a same band; and one single-hop path to each other access node of a different access band. To eliminate the need for cross connectors, geographically-spread distributors are arranged into geographically-spread constellations of collocated distributors.
Method and system for classifying data packet fields on FPGA
A method and system for classifying data packet fields are disclosed. They associate a final tag to each of the fields in a data packet in relation to a set of classifying rules, and involve building a decision tree using a recursive algorithm to apply the set of classifying rules on the data packet fields, mapping each node of the built decision tree respectively to a processing element of a FPGA, each processing element comprising a processor and a memory, pipelining all mapped processing elements, and processing the data packet fields through the pipelined and mapped processing elements.
Method and system for classifying data packet fields on FPGA
A method and system for classifying data packet fields are disclosed. They associate a final tag to each of the fields in a data packet in relation to a set of classifying rules, and involve building a decision tree using a recursive algorithm to apply the set of classifying rules on the data packet fields, mapping each node of the built decision tree respectively to a processing element of a FPGA, each processing element comprising a processor and a memory, pipelining all mapped processing elements, and processing the data packet fields through the pipelined and mapped processing elements.
FLOW OFFLOADING METHOD FOR A PROGRAMMABLE NETWORK INTERFACE CONTROLLER (NIC)
Examples described herein relate to a driver that is to: determine a configuration of a packet processing pipeline of a network interface device to perform an instruction set written in a domain specific language (DSL) for the packet processing pipeline based on emulation or analysis of a parser of the packet processing pipeline and provide the configuration to the packet processing pipeline of the network interface device to specify operations of the packet processing pipeline of the network interface device.
FLOW OFFLOADING METHOD FOR A PROGRAMMABLE NETWORK INTERFACE CONTROLLER (NIC)
Examples described herein relate to a driver that is to: determine a configuration of a packet processing pipeline of a network interface device to perform an instruction set written in a domain specific language (DSL) for the packet processing pipeline based on emulation or analysis of a parser of the packet processing pipeline and provide the configuration to the packet processing pipeline of the network interface device to specify operations of the packet processing pipeline of the network interface device.