The embodiments of the present disclosure provide a data packet processing method and apparatus, a storage medium and an electronic device. The method includes that: a Bit Index Explicit Replication (BIER) Multicast Identifier (BMID) information of a data packet is set, wherein the BMID information is used for indicating a multicast channel to which the data packet belongs; and the BMID information is sent to a Bit-Forwarding Ingress Router (BFIR). Through the solution in the embodiments of the present disclosure, the technical problem in the related art that a node receives duplicate data packets is solved, duplicate data packets may be prevented, and data transmission efficiency is improved.

Techniques for implementing multi-table OpenFlow using a parallel hardware table lookup architecture are provided. In certain embodiments, these techniques include receiving, at a network device from a software-defined networking (SDN) controller, flow entries for installation into flow tables of the network device, where the flow entries are structured in a manner that assumes the flow tables can be looked-up serially by a packet processor of the network device, but where the flow tables are implemented using hardware lookup tables (e.g., TCAMs) that can only be looked-up in parallel by the packet processor. The techniques further include converting, by the network device, the received flow entries into a format that enables the packet processor to process ingress network traffic correctly using the flow entries, despite the packet processor's parallel lookup architecture, and installing the converted flow entries into the flow tables/hardware lookup tables.

A method for automatically establishing an address-port mapping table of a switching device in an interconnect fabric uses hardware link-up and link-down processes to build and update the lowest cost (e.g., shortest path) port entries in the mapping table. Traffic loops are precluded by comparing cost values based on the source addresses of the devices in the interconnect fabric, without blocking any particular port.

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).

Network hardware devices organized in a wireless mesh network (WMN) in which one network hardware devices includes a first radio and a second radio coupled to a processing device. The processing device receives a request from a client consumption device via the first radio and determines a destination for the request as a second mesh network device. The processing device access a master routing table to determine that the second radio is to forward the request and forwards the request to the second radio. The second radio accesses a local routing table at the second radio to determine that a radio of a third mesh network device is a next-hop mesh network device in a first path to the second mesh network device. The second radio sends the request to the radio of the third mesh network device.

A method is implemented by a network device to dynamically optimize lookup speed in a packet processing table maintained at the network device while the network device is in operation. The method includes determining one or more runtime metrics of the packet processing table, selecting a lookup algorithm for the packet processing table from a set of lookup algorithms supported by the network device based on the one or more runtime metrics of the packet processing table, and configuring the network device to match incoming packets against rules in the packet processing table using the selected lookup algorithm for the packet processing table.

An apparatus and method for path creation element driven dynamic setup of forwarding adjacencies and explicit path. In one embodiment of the method, a node receives an instruction to create a tunnel between the node and another node. The node creates or initiates the creation of the tunnel in response to receiving the instruction, wherein the tunnel comprises a plurality of nodes in data communication between the node and the other node. The node maps a first identifier (ID) to information relating to the tunnel. The node advertises the first ID to other nodes in a network of nodes.

Embodiments of the present invention relate to a Lookup and Decision Engine (LDE) for generating lookup keys for input tokens and modifying the input tokens based on contents of lookup results. The input tokens are parsed from network packet headers by a Parser, and the tokens are then modified by the LDE. The modified tokens guide how corresponding network packets will be modified or forwarded by other components in a software-defined networking (SDN) system. The design of the LDE is highly flexible and protocol independent. Conditions and rules for generating lookup keys and for modifying tokens are fully programmable such that the LDE can perform a wide variety of reconfigurable network features and protocols in the SDN system.

Some embodiments provide a method for a network controller that manages a flow-based managed forwarding element (MFE). The method receives multiple sets of service rules for implementation by the MFE. The sets of service rules have a priority order and the rules in each set of service rules have separate priority orders. The method organizes the service rules in all of the sets of service rules into a single ordered list of service rules. The method assigns priority values within a space-constrained set of priority values to the service rules in the list in a manner designed to minimize re-assignment when changes to the sets of service rules are received. The method uses the assigned priority values to generate flow entries for the MFE to use to implement the service rules.

An integrated circuit includes an exact-match flow table structure, a crossbar switch, and an egress packet modifier. Each flow entry includes an egress action value, an egress flow number, and an egress port number. A Flow Id is generated from an incoming packet. The Flow Id is used to obtain a matching flow entry. A portion of the packet is communicated across the crossbar switch to the egress packet modifier, along with the egress action value and flow number. The egress action value is used to obtain non-flow specific header information stored in a first egress memory. The egress flow number is used to obtain flow specific header information stored in a second egress memory. The egress packet modifier adds the header information onto the portion of the packet, thereby generating a complete packet. The complete packet is then output from an egress port indicated by the egress port number.