Patent classifications
H04L45/42
Distributed label assignment for labeled routing protocol routes
In general, various aspects of the techniques are described in this disclosure for distributed label assignment for labeled routes. In one example, a method includes obtaining, by a first thread of a plurality of execution threads for at least one routing protocol process executing on processing circuitry of a network device, an allocation of first labels drawn from a label space for a network service; adding, by the first thread, the first labels to a first local label pool for the first thread; generating, by the first thread, after obtaining the allocation of the first labels, a labeled route comprising a route for the network service and a label assigned by the first thread from the first local label pool; and outputting, by the network device, the labeled route.
Distributed label assignment for labeled routing protocol routes
In general, various aspects of the techniques are described in this disclosure for distributed label assignment for labeled routes. In one example, a method includes obtaining, by a first thread of a plurality of execution threads for at least one routing protocol process executing on processing circuitry of a network device, an allocation of first labels drawn from a label space for a network service; adding, by the first thread, the first labels to a first local label pool for the first thread; generating, by the first thread, after obtaining the allocation of the first labels, a labeled route comprising a route for the network service and a label assigned by the first thread from the first local label pool; and outputting, by the network device, the labeled route.
Computational accelerator for storage operations
A system includes a host processor, which has a host memory and is coupled to store data in a non-volatile memory in accordance with a storage protocol. A network interface controller (NIC) receives data packets conveyed over a packet communication network from peer computers containing, in payloads of the data packets, data records that encode data in accordance with the storage protocol for storage in the non-volatile memory. The NIC processes the data records in the data packets that are received in order in each flow from a peer computer and extracts and writes the data to the host memory, and when a data packet arrives out of order, writes the data packet to the host memory without extracting the data and processes the data packets in the flow so as to recover context information for use in processing the data records in subsequent data packets in the flow.
Computational accelerator for storage operations
A system includes a host processor, which has a host memory and is coupled to store data in a non-volatile memory in accordance with a storage protocol. A network interface controller (NIC) receives data packets conveyed over a packet communication network from peer computers containing, in payloads of the data packets, data records that encode data in accordance with the storage protocol for storage in the non-volatile memory. The NIC processes the data records in the data packets that are received in order in each flow from a peer computer and extracts and writes the data to the host memory, and when a data packet arrives out of order, writes the data packet to the host memory without extracting the data and processes the data packets in the flow so as to recover context information for use in processing the data records in subsequent data packets in the flow.
High-availability networking as a service via Wi-Fi
A first network device may receive a request associated with forming a high-availability cluster with a second network device, wherein the first network device is associated with a session of a user device. The first network device may determine, based on authorization information associated with the first network device, that the first network device is authorized to form the high-availability cluster. The first network device may configure communication links with the second network device to form the high-availability cluster. The first network device may synchronize, with the second network device, session information associated with the session via the communication links. The first network device may route session traffic of the session to the second network device and a data network to enable the user device to receive a high-availability service during the session.
High-availability networking as a service via Wi-Fi
A first network device may receive a request associated with forming a high-availability cluster with a second network device, wherein the first network device is associated with a session of a user device. The first network device may determine, based on authorization information associated with the first network device, that the first network device is authorized to form the high-availability cluster. The first network device may configure communication links with the second network device to form the high-availability cluster. The first network device may synchronize, with the second network device, session information associated with the session via the communication links. The first network device may route session traffic of the session to the second network device and a data network to enable the user device to receive a high-availability service during the session.
Avoiding markers for longest prefix match based on binary search tree algorithm
In one embodiment, a packet processing apparatus includes interfaces, a memory to store a representation of a routing table as a binary search tree of address prefixes, and store a marker with an embedded prefix including k marker bits providing a marker for an address prefix of a node corresponding to a prefix length greater than k, and n additional bits, such that the k marker bits concatenated with the n additional bits provide another address prefix, packet processing circuitry configured upon receiving a data packet having a destination address, to traverse the binary search tree to find a longest prefix match, compare a key with the k marker bits, extract an additional n bits from the destination address, and compare the extracted n bits with the n additional bits, and process the data packet in accordance with a forwarding action indicated by the longest prefix match.
Avoiding markers for longest prefix match based on binary search tree algorithm
In one embodiment, a packet processing apparatus includes interfaces, a memory to store a representation of a routing table as a binary search tree of address prefixes, and store a marker with an embedded prefix including k marker bits providing a marker for an address prefix of a node corresponding to a prefix length greater than k, and n additional bits, such that the k marker bits concatenated with the n additional bits provide another address prefix, packet processing circuitry configured upon receiving a data packet having a destination address, to traverse the binary search tree to find a longest prefix match, compare a key with the k marker bits, extract an additional n bits from the destination address, and compare the extracted n bits with the n additional bits, and process the data packet in accordance with a forwarding action indicated by the longest prefix match.
METHOD AND DEVICE FOR PACKET FORWARDING
Provided are a method and device for packet forwarding. The method comprises: interface direction information and a routing table issued by a control plane are received, where a route in the routing table carries a routing direction identifier; when a packet is received from an interface, a forwarding plane determines the interface direction of an incoming interface of the packet according to the interface direction information, and determines a routing direction of the packet according to the routing direction identifier; if the interface direction of the incoming interface matches the routing direction, then the packet is forwarded; and if not, then the packet is discarded.
MODEL TRAINING-BASED COMMUNICATION METHOD AND APPARATUS, AND SYSTEM
This application provides a model training-based communication method and apparatus, and a system, to effectively decrease a data amount of a parameter transmitted between the communication device and the central server. The method includes: The communication device determines a change amount of a first model parameter value. If the communication device determines, based on the change amount of the first model parameter value, that a first model parameter is stable, the communication device stops sending an update amount of the first model parameter value to the central server in a preset time period. The update amount of the first model parameter value is determined by the communication device based on user data in a process of performing model training. The communication device receives a second model parameter value sent by the central server.