One embodiment provides a system for facilitating efficient communication of a collection of interests. During operation, the system receives, by an intermediate node, a first packet which has a name and a first nonce, wherein the first packet indicates a set of member interests, wherein a member interest has a name. In response to not obtaining a matching entry in a pending interest table based on the name for the first packet, the system creates a new entry in the pending interest table, wherein an entry includes a second nonce, a reference count, and a set of arrival nonces and corresponding arrival interfaces. The system sets the new entry's second nonce to a new nonce, and sets the new entry's reference count to a number of member interests indicated in the first packet. The system forwards the first packet, wherein the first nonce is replaced with the new nonce.

An apparatus and method is disclosed for segment routing (SR) over label distribution protocol (LDP). In one embodiment, the method includes a node receiving a packet with an attached segment ID. In response, the node may attach a label to the packet. Thereafter, the node may forward the packet with the attached label and segment ID to another node via a label switched path (LSP).

An information processing device includes a field programmable gate array configured to store route information in flow control, and forward packets according to the route information; one or more memories configured to store a flow cache that includes at least a part of the route information; and one or more processors coupled to the one or more memories and the one or more processors configured to divide the route information into a plurality of division areas; and acquire hit information extracted from each of the entries in a first division area of the plurality of division areas to delete a part of entries of the flow cache stored in the one or more memories, the first division area including flows whose number is greater than a threshold value.

A traffic scheduling method includes determining, by a first network device, first traffic scheduling information and a transmission path of a first data stream based on a first talker attribute message received from a talker device and a listener attribute message received from a listener device, and then sending, by the first network device, a first traffic scheduling message to a network device on the transmission path. The first traffic scheduling message includes the first traffic scheduling information. The first traffic scheduling information indicates the network device on the transmission path to generate a gate control list. The gate control list indicates the network device on the transmission path to control, based on the gate control list, a state of a port used to transmit the first data stream.

Provided is an Address Resolution Protocol (ARP) learning method, which includes: determining, by a forwarding chip, an IP address of a target device; when an MAC address corresponding to the IP address of the target device is not stored in an ARP forwarding table, generating and broadcasting, by the forwarding chip, an ARP request message, wherein the ARP request message includes the IP address of the target device; receiving, by the forwarding chip, an ARP response message fed back by the target device, wherein the ARP response message includes an MAC address of the target device; and writing, by the forwarding chip, the IP address of the target device and the MAC address corresponding to the IP address into the ARP forwarding table. The present disclosure also provides a node device and a computer-readable medium.

This application discloses a route information storage method. The method is applied to a wireless mesh network, the wireless mesh network includes a first node, a second node, and at least two stations STAs, the first node is an upper-level node of the second node, the at least two STAs include a first STA and a second STA, and the first STA and the second STA are connected to the second node. In the method, the first node receives a routing request for access requested by the first STA, and if it is determined that a first route entry corresponding to the second STA already exists, the first node no longer generates a new route entry for the first STA, but reuses the first route entry.

Disclosed are a data flow table for high-speed large-scale concurrent data flows, method and apparatus for processing the data flow table, and a storage medium. The method includes: acquiring, according to a data flow identifier of a data flow to be inserted, addresses of candidate buckets in a fingerprint table and a data flow fingerprint; detecting whether there is an idle unit in the candidate buckets in the fingerprint table, if there is an idle unit, selecting the candidate bucket having the idle unit as target bucket; and sequentially searching for the idle unit from bottom unit to top unit of the target bucket, and when the idle unit is found in the target bucket, writing data flow fingerprint of said data flow into the found idle unit, and writing data flow record of said data flow into a recording bucket corresponding to the candidate bucket.

In one embodiment, a method generally includes a first edge (E) node in a network receiving an encapsulated data packet, wherein the encapsulated data packet comprises an outer header and a data packet, wherein the outer header comprises a first router locator (RLOC) corresponding to the first E node, wherein the data packet comprises an internet protocol (IP) header, and wherein the IP header comprises a destination endpoint identification (EID) corresponding to a host H. The first E node determines whether the host H is attached to the first E node. And in response to the first E node determining the host is attached to the first E node, the first E node forwards the data packet to the host H. The first E node receives a message from another node after the host H detaches from the first E node and reattaches to another E node, wherein the message comprises the destination EID.

Described herein are systems, methods, and software to manage the compression of route tables for communication between networking elements. In one implementation, a network device identifies network keys for a route table by replacing attributes in the tables with values. The network device further generates a compressed route table using the route keys and associating each of the route keys with one or more additional attributes. The network device also generates a dictionary to associate each of the values for the route keys to a corresponding attribute of the attributes.

A packet forwarding method and a network device are provided, and the method is applied to the network device. The network device includes a first virtual routing and forwarding (VRF) table and a second VRF table. The method includes: the network device receives a first packet. If the first packet carries tunnel attribute information, the network device forwards the first packet based on the first VRF table. The first VRF table includes one or more local routes, and next-hop outbound interfaces of the one or more local routes are all local outbound interfaces. The network device forwards the first packet based on the first VRF table, so that a packet from a tunnel may be forwarded to a local virtual machine for processing and may not be forwarded to another tunnel endpoint device, to avoid a routing loop during packet forwarding.