Message processing method, communication node and storage medium

Abstract

The invention provides a message processing method, a communication node and a storage medium. The method comprises the steps that transmission path information is packaged in a message based on fixed-length unit bit index explicit replication, the fixed-length unit bit index explicit replication comprises a fixed-length unit, and the fixed-length unit comprises a node bit forwarding router identifier BFR-ID of a corresponding node and a node replication forwarding bit string; and sending the message.

Description

Technical Field

[0001] The present application relates to the field of network communication technology, for example, to a message processing method, a communication node and a storage medium. Background Art

[0002] In an Ad Hoc network, the connection between nodes is not fixed and does not need to rely on an existing network architecture. The network topology often changes dynamically with the movement of nodes. Nodes in the network can forward network encapsulated messages to other nodes, but the mutual dependence is very low. This type of network is currently widely used in the computer and wireless fields, and has been widely deployed in aircraft, ships, and vehicle networking.

[0003] There are a large number of multicast scenarios in Ad Hoc networks. Traditional multicast technologies such as Protocol Independent Multicast (PIM) not only require each node to run the PIM protocol, save the multicast tree state, and rely on periodic join messages to establish and maintain the multicast tree, but also rely on routing protocols to establish the underlying topology. Once the topology changes, the PIM protocol needs to re-establish the multicast tree through join / leave messages after the entire network routing protocol converges. Such consumption is completely unable to adapt to the characteristics of the dynamic changes in the Ad Hoc network topology. There are also some other multicast technologies, but they all have the problem of strong dependence between nodes. Once the network topology changes, the routing protocol needs to notify and calculate these changes, and update the forwarding routing table before normal forwarding can continue. The dynamic changes in the network topology also make global planning very difficult, and the processing capabilities of the nodes in the Ad Hoc network are too high. Summary of the invention

[0004] The present application provides a message processing method, a communication node and a storage medium.

[0005] The present application provides a message processing method, including:

[0006] Encapsulating the transmission path information in the message based on the fixed-length unit bit index explicit replication, the fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes a node bit forwarding router identifier BFR-ID of the corresponding node and a node replication forwarding bit string;

[0007] Send the message.

[0008] The present application also provides a message processing method, including:

[0009] Receive a message, where the message contains transmission path information encapsulated by explicit replication based on a fixed-length unit bit index. The fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes a node bit forwarding router identifier of a corresponding node and a node replication forwarding bit string.

[0010] Determine the node replication forwarding bit string of this node according to the fixed-length unit corresponding to this node.

[0011] Process the message according to the node replication forwarding bit string of this node.

[0012] An embodiment of the present application also provides a communication node, including: a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the above message processing method is implemented.

[0013] An embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored. When the program is executed by a processor, the above message processing method is implemented. Description of the Drawings

[0014] Figure 1 A schematic diagram of a network corresponding to a multicast scenario provided for an embodiment;

[0015] Figure 2 A flowchart of a message processing method provided for an embodiment;

[0016] Figure 3 A flowchart of another message processing method provided for an embodiment;

[0017] Figure 4 A schematic diagram of a network layer provided for an embodiment;

[0018] Figure 5 A schematic diagram of a FUBIER provided for an embodiment;

[0019] Figure 6 A schematic diagram of a fixed-length unit provided for an embodiment;

[0020] Figure 7 A schematic diagram of a node replication forwarding bit string provided for an embodiment;

[0021] Figure 8 A schematic diagram of a multicast path encapsulated based on FUBIER provided for an embodiment;

[0022] Figure 9 A schematic diagram of the fixed-length units of each node provided for an embodiment;

[0023] Figure 10Another schematic diagram of a network level provided for an embodiment;

[0024] Figure 11 Schematic structural diagram of a message processing device provided for an embodiment;

[0025] Figure 12 Another schematic structural diagram of a message processing device provided for an embodiment;

[0026] Figure 13 Schematic hardware structure diagram of a communication node provided for an embodiment. Detailed implementation manners

[0027] The present application will be described below with reference to the accompanying drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain the present application, rather than limiting the present application. It should be noted that, without conflict, the embodiments in the present application and the features in the embodiments can be arbitrarily combined with each other. Additionally, it should be noted that, for the sake of description, only parts related to the present application rather than all structures are shown in the accompanying drawings.

[0028] Figure 1 Schematic diagram of a network corresponding to a multicast scenario provided for an embodiment. As Figure 1 shown, traffic can be forwarded from node A of this network to the receiving end that needs this traffic through nodes B, C, D, E, F, G, H, K, M, N, etc. Among them, there is a shared network between nodes G, M, and N. If Bit Indexed Explicit Replication (BIER) is applied to this network, node A serves as the BFIR ingress node, encapsulates a BIER header for the traffic, and the bit string in the BIER header needs to identify the egress (connected to the receiver) nodes C, D, F, H, K, M, and N. The encapsulated message will be forwarded in this network by each node looking up the BIER forwarding table. Among them, when each node forwards to the next node, it also needs to encapsulate the BIER forwarding table index required by the next node in the BIER header. Before encapsulating the message at the ingress node, it is necessary to establish the underlying topology through a routing protocol in the network, transmit the BFR-ID and BIER forwarding table index of each node, so that each node can form a BIER forwarding table leading to all other nodes in the network, and know the BIER forwarding table index required by the next node, etc. Once the network topology changes, it is necessary for the routing protocol to announce and calculate these changes, and update the BIER forwarding routing table before normal forwarding can continue; therefore, there is a strong dependence between each node, and in fact, the BIER technology cannot be directly applied to this network.

[0029] Bit Index Explicit Replication Traffic Engineering (BIER-TE) has a weaker dependence on routing protocols compared to BIER. However, it requires global planning of link Bit-Positions. In an Ad Hoc network, since the topology changes dynamically, it is very difficult to carry out global planning. Therefore, the BIER-TE technology cannot be directly applied to this network.

[0030] The present invention defines a Fixed Unit Bit Indexed Explicit Replication (FUBIER) technology, which can implement the forwarding of traffic along multicast paths in Ad Hoc networks and ordinary conventional networks, and has the characteristics of statelessness, low dependence, and simple and efficient processing.

[0031] Figure 2 A flowchart of a message processing method provided for an embodiment. This method can be applied to a first communication node, such as an ingress node, source node, root node, or message sending end in a network. The first communication node can encapsulate and send the message. As Figure 2 shown, the method provided in this embodiment includes step 110 and step 120.

[0032] In step 110, based on the fixed unit bit index explicit replication, the transmission path information is encapsulated in the message. The fixed unit bit index explicit replication includes fixed units, and each fixed unit includes the node bit forwarding router identifier (BFR-ID) of the corresponding node and the node replication forwarding bit string.

[0033] In step 120, the message is sent.

[0034] In this embodiment, the fixed unit is used to reflect the transmission path of the message between different nodes. FUBIER usually includes multiple fixed units. Each fixed unit is used to indicate the BFR-ID of the corresponding node and the node replication forwarding bit string. Each bit in the node replication forwarding bit string corresponds to an interface of this node that needs to replicate and forward the message. On this basis, when the network topology changes, the encapsulated information can also be adjusted conveniently, which can reduce the dependence between nodes. The length of the fixed unit can be 32 bits, 64 bits, 96 bits, 128 bits, etc. The lengths of the various information in the fixed unit can be adjusted according to the actual network deployment, and the positions of the various information can also be adjusted according to the implementation situation. Generally, the encapsulation and processing methods of each node in a network are unified. FUBIER can be encapsulated in the BitString position in the BIER header, or can be encapsulated separately following Ethernet, IPv4, IPv6, etc. This embodiment does not limit this.

[0035] In one embodiment, the node replication and forwarding bit string includes a local decapsulation identifier, which is used to indicate whether the corresponding node decapsulates the message. The local decapsulation identifier can also be referred to as the local decapsulation flag bit or the decapsulation flag bit of this node, etc.

[0036] In one embodiment, the local decapsulation identifier is the lowest bit or the highest bit of the node replication and forwarding bit string. The local decapsulation identifier bits of each node can be unified as the lowest or highest bit of the bit string.

[0037] In one embodiment, the fixed-length unit further includes the hierarchical information of the corresponding node, and the hierarchical information is used to indicate the layer to which the corresponding node belongs.

[0038] In one embodiment, the method further includes:

[0039] Obtain the forwarding table of each node in the network, where the forwarding table includes the interface of this node and the interface index;

[0040] Determine the transmission path information according to the forwarding table of each node.

[0041] In this embodiment, before encapsulating the message, each node can generate its own forwarding table according to the interface of this node and the interface index situation. The forwarding table includes the interface index and the specific interface, and may also include the neighbors connected to the interface. The first communication node determines the multicast path in the network according to the forwarding tables of each node, and performs encapsulation in the form of explicit replication of the fixed-length unit bit index.

[0042] In one embodiment, the forwarding table further includes the neighbor nodes of the interface of this node.

[0043] In one embodiment, the transmission path information is encapsulated based on the fixed-length unit bit index explicitly after the Ethernet header or IPv4 / IPv6 header, or carried by the options in the hop-by-hop options header extension header or destination options extension message header of IPv6.

[0044] The above message processing method can make the nodes have basically no dependence on each other, and also have no dependence on the routing protocol. Whether it is implemented by software or hardware chips, it can achieve simple logic and high processing efficiency. And in addition to Ad Hoc networks, it is also applicable to conventional networks.

[0045] Figure 3 It is a flowchart of another message processing method provided for an embodiment. This method can be applied to the second communication node, and the second communication node can be a node that forwards messages or a receiving end of the message. As Figure 3 shown, the method provided in this embodiment includes:

[0046] In step 210, a message is received, and the message contains transmission path information encapsulated by explicit copying based on a fixed-length unit bit index. The fixed-length unit bit index explicit copying includes a fixed-length unit, and the fixed-length unit includes a node bit forwarding router identifier of a corresponding node and a node copy forwarding bit string.

[0047] In step 220, the node copy forwarding bit string of this node is determined according to the fixed-length unit corresponding to this node.

[0048] In step 230, the message is processed according to the node copy forwarding bit string of this node.

[0049] In this embodiment, when each node receives a message containing transmission path information encapsulated by explicit copying based on a fixed-length unit bit index, it can search for the fixed-length unit where the BFR-ID of this node is located, obtain the node copy forwarding bit string of this node, determine whether to de-encapsulate the message and forward it to the receiver according to the node copy forwarding bit string of this node, and check whether there is an interface index that needs to be forwarded. If so, it needs to perform copy forwarding according to the forwarding table of this node. If there is no interface index that needs to be forwarded, the forwarding ends. In addition, if the fixed-length unit where the BFR-ID of this node cannot be found, an error can be recorded, the message can be discarded and no longer processed, etc.

[0050] In one embodiment, the node copy forwarding bit string includes a local de-encapsulation identifier; processing the message according to the node copy forwarding bit string of this node includes: when the local de-encapsulation identifier is a specified value, de-encapsulating the message and forwarding the message to the receiver of this node. For example, it is determined whether the local de-encapsulation identifier is set to 1. If it is set to 1, the message is de-encapsulated and forwarded to the receiver.

[0051] In one embodiment, the local de-encapsulation identifier is the lowest bit or the highest bit of the node copy forwarding bit string.

[0052] In one embodiment, processing the message according to the node copy forwarding bit string of this node includes:

[0053] When there is an interface index to be forwarded in the node copy forwarding bit string of this node, the message is copied and forwarded to the next-hop node according to the forwarding table of this node.

[0054] In one embodiment, the fixed-length unit further includes the hierarchical information of the corresponding node, and the hierarchical information is used to indicate the layer to which the corresponding node belongs.

[0055] In one embodiment, the method further includes: determining the hierarchical information in the fixed-length unit of the neighbor node; when the hierarchical information of the neighbor node is one level higher than the hierarchical information of this node, the hierarchical information of the neighbor node passes the verification.

[0056] In this embodiment, it is possible to check whether the hierarchical information of the next node is correct. The hierarchical information of the next-hop node for forwarding should be one level greater than that of this node. If the hierarchical information of the next node is incorrect, the message is not forwarded to that next-hop node. It should be noted that in a shared network, this check may not be required, or it may not be necessary to check all next-hop nodes.

[0057] In one embodiment, before processing the message according to the replication forwarding bit string of this node, the method further includes: deleting the fixed-length unit corresponding to the specified node in the explicit replication of the fixed-length unit bit index, where the specified node includes nodes with hierarchical information equal to or lower than the hierarchical information of this node.

[0058] In this embodiment, before forwarding the message to the next-hop node, the fixed-length units with levels equal to or lower than this node in the explicit replication encapsulation of the fixed-length unit bit index can be deleted, thereby reducing the search time for the next-hop node and subsequent nodes and improving the message processing efficiency.

[0059] In one embodiment, the method further includes:

[0060] Generating a forwarding table for this node according to this node's interface and interface index.

[0061] In one embodiment, the forwarding table further includes the neighbor nodes of this node's interface.

[0062] In one embodiment, the transmission path information is encapsulated after the Ethernet header or IPv4 / IPv6 header based on the explicit replication of the fixed-length unit bit index, or carried by options in the hop-by-hop options header extension header or destination options extension message header of IPv6.

[0063] The message processing method of the present application is exemplarily described below through some embodiments.

[0064] Embodiment 1

[0065] Figure 4 It is a schematic diagram of a network hierarchy provided for an embodiment. Taking Figure 1 the network shown as an example, several levels can be divided according to the distance between each node and the root node. As Figure 4 shown, A is the root node, at level 0 (Level 0), nodes B, C, and D are at Level 1, nodes E, F, and G are at Level 2, and nodes H, K, M, and N are at Level 3. Among them, nodes C, D, F, H, K, M, and N are connected to multicast traffic receivers.

[0066] Based on FUBIER, the multicast path is encapsulated. Each fixed-length unit contains the node BFR-ID and the node replication and forwarding bit string. Each bit in the node replication and forwarding bit string corresponds to an interface of this node that needs to replicate and forward packets. The lowest bit in the node replication and forwarding bit string can be used as the general decapsulation identification bit for this node. If the decapsulation identification bit of a node's replication and forwarding bit string is set, it means that there is a local receiver at this node and the packet needs to be decapsulated, that is, after removing the encapsulated fixed-length unit bit index and explicit replication encapsulation, it is sent to the receiver of this node.

[0067] Figure 5 A schematic diagram of FUBIER provided for an embodiment. As Figure 5 shown, FUBIER identifies the multicast path as a series of fixed-length units (which can be simply referred to as units). Each node involved in the entire multicast path can be identified by a fixed-length unit.

[0068] Figure 6 A schematic diagram of a fixed-length unit provided for an embodiment. The length of the fixed-length unit can be determined according to the node complexity in the network, such as 32 bits, 64 bits, or 96 bits, 128 bits, etc.; each fixed-length unit contains the node BFR-ID of this node and the node replication and forwarding bit string (Fwd-BitString, also known as the interface forwarding bit string Intf-BitString) information or element of this node, and optionally contains level information or element. In the simplest implementation, the level element may not be included. The positions of the elements in the fixed-length unit can be exchanged according to the implementation situation, and the length of each element can be fixed. For example, if the length of the fixed-length unit is 32 bits, where the BFR-ID is represented by 16 bits, the level information is represented by 4 bits, and the node replication and forwarding bit string is represented by 12 bits.

[0069] Figure 7 A schematic diagram of a node replication and forwarding bit string provided for an embodiment. As Figure 7 shown, in addition to containing the interface forwarding bit string (Intf-BitString) of this node, it also contains the decapsulation identification (Decap) of this node. Each node can uniformly use the lowest bit or the highest bit as the decapsulation identification bit for this node, Figure 7 showing that the lowest bit is used as the decapsulation identification bit for this node. Each bit in the node replication and forwarding bit string corresponds to a local interface of the corresponding node. If the corresponding bit is set (set to 1), it means that the packet needs to be forwarded from this local interface.

[0070] Before encapsulating the packet at the entrance, i.e., the root node, in addition to configuring the BFR-ID of its own node (the BFR-ID values of each node are different), each node generates its own forwarding table. As shown in Table 1, if the bit corresponding to the index value is set to 1 in the node's replicated forwarding bit string, it indicates that the packet needs to be forwarded from the interface corresponding to the index value. The forwarding table is only related to the local interfaces and has nothing to do with the traffic direction, etc. It is a stateless forwarding table. Table 2 shows the forwarding table of node A, Table 3 shows the forwarding table of node B, and Table 4 shows the forwarding table of node C. This forwarding table is only related to the interface connection of the local node and has nothing to do with the traffic.

[0071] Table 1 Local Node Forwarding Table

[0072]

[0073] Table 2 Node A Forwarding Table

[0074]

[0075] Table 3 Node B Forwarding Table

[0076]

[0077] Table 4 Node C Forwarding Table

[0078]

[0079] Figure 8 is to Figure 4 An example of encapsulating the multicast path shown using the FUBIER technology. All forwarding nodes involved in this traffic are encapsulated in a fixed-length unit manner. All units can be used as the BitString in the BIER header and carried by the BIER header, or they can be separated from the BIER header and directly represented by a specific Ethernet type or IPv4 / IPv6 protocol type. In this way, FUBIER can directly follow the Ethernet header or IPv4 / IPv6 header, or even carry FUBIER as an option in the IPv6 Hop-by-Hop Options Header (HBH) extension header or DestinationOptions Header (DOH). The present invention does not limit this here.

[0080] Figure 9The fixed-length units of each node are shown in sequence. The fixed-length unit of node A contains the BFR-ID of node A and the hierarchical information of this node 0. Since there is no receiver for this node, the de-encapsulation flag of this node in the bit string for replication and forwarding is not set (set to 0). The corresponding bits of interfaces 1, 2, and 3 (corresponding to the interfaces for sending to nodes B, C, and D) in the bit string for replication and forwarding of this node are set (set to 1). After the message is replicated, it is sent out from interfaces 1, 2, and 3 respectively. The fixed-length unit of node B contains the BFR-ID of node B and the hierarchical information. The corresponding bits of interfaces 2 and 4 connected to nodes E and F in the bit string for replication and forwarding of this node are set. Similarly, since there is no receiver for this node, the de-encapsulation flag of this node in the bit string for replication and forwarding is not set. In addition to the BFR-ID of node C and the hierarchical information, since there is a receiver for this node but no interface that needs to be further forwarded, the local de-encapsulation bit in the bit string for replication and forwarding of this node is set, and the bits corresponding to other interfaces in the bit string for replication and forwarding are not set, that is, all 0. In addition to the BFR-ID of node D and the hierarchical information, since there is a receiver for this node and there are also interfaces that need to be forwarded, the local de-encapsulation bit in the bit string for replication and forwarding of this node is set, and the bit corresponding to interface 9 in the bit string for replication and forwarding is set. The fixed-length unit of node E contains the BFR-ID of node E and the hierarchical information. The 6th and 8th bits corresponding to the interfaces connected to H and K in the bit string for replication and forwarding of this node are set. The encapsulation logic of the fixed-length units of nodes F, G, H, etc. is similar to the above.

[0081] The processing flow of the node for the FUBIER encapsulated message includes: first, find the unit where this node is located, that is, find the unit with the BFR-ID value consistent with this node, and obtain the bit string information (and hierarchical information) for replication and forwarding of this node. If the de-encapsulation flag bit of this node is set, then de-encapsulate the message, remove the entire FUBIER encapsulation and forward it to the receiver. If the bit string for replication is not all 0, it means there is an interface index that needs to be forwarded. Then, look up the forwarding table of this node and replicate the message to be sent out from the interface corresponding to the set index.

[0082] Combined with Figure 4As shown in the figure, when the forwarding engine of Node A receives a packet encapsulated by FUBIER, it searches for a unit with the same BFR-ID as this node. If no unit with the same BFR-ID as this node is found, the packet is discarded. After finding the unit of this node, according to the setting information in the copy-forward bit string of this node, starting from the lowest bit (excluding the de-encapsulation identification bit) of the copy-forward bit string, the 1st, 2nd, and 3rd bits are set, indicating that the packet needs to be copied and forwarded from interfaces 1, 2, and 3. Then, the packet is copied three times and sent out from interfaces 1, 2, and 3 respectively. When Node B receives a packet encapsulated by FUBIER, after finding the unit of this node, according to the setting information in the copy-forward bit string of this node, it is found that starting from the lowest bit (excluding the de-encapsulation identification bit) of the copy-forward bit string, the 2nd and 4th bits are set. After copying the packet, it is sent out from interfaces 2 and 4. When Node C receives a FUBIER-encapsulated packet, after finding the unit of this node, according to the setting information in the copy-forward bit string of this node, it is found that no bit is set except the de-encapsulation identification bit. Therefore, the packet is de-encapsulated, and after removing the entire FUBIER encapsulation, it is forwarded to the receiver. When Node D receives a FUBIER-encapsulated packet, after finding the unit of this node, according to the setting information in the copy-forward bit string of this node, it is found that in addition to the de-encapsulation identification bit, the 9th bit is also set. Then, the packet is copied and sent out from interface 9, and at the same time, the packet is de-encapsulated, and after removing the entire FUBIER encapsulation, it is forwarded to the receiver. The processing processes of other nodes are similar. Eventually, the packet can reach all receivers, completing the forwarding on the entire multicast path.

[0083] In Figure 4 the network shown in the figure, a fixed-length unit of 32 bits, that is, 4 bytes, can be used to achieve it. For an 11-node multicast path, the finally encapsulated FUBIER length is 44 bytes, occupying a small number of bytes and having simple and efficient processing.

[0084] In some networks, there may be a situation where each node has a relatively large number of interfaces. At this time, methods such as using a fixed-length unit of 64 bits or 96 bits can be adopted to increase the number of bits occupied by the copy-forward bit string of this node to achieve it. This will not be elaborated here.

[0085] Figure 10 It is a schematic diagram of another network layer provided for an embodiment. As Figure 10 shown, a certain traffic enters through Node H and passes through Nodes E, B, A, C, and D. Then, the receivers of Nodes C and D receive this traffic. Similarly, based on the distance from the ingress node H, it is known that Node E is the first-level node, Node B is the second-level node, Node A is the third-level node, and Nodes C and D are the fourth-level nodes. After encapsulating the units of these nodes in the FUBIER manner and passing through the processing of each hop node, it can finally reach the receiver. In this process, it is not necessary for each node to save the state according to the multicast flow, and it can be achieved only based on its own forwarding table.

[0086] The multicast path needs to know the BFR-ID of each node, as well as the interface and its index information. This part of the information can be directly obtained by the controller or the ingress / root node from each node, or can be advertised through the extension of the protocol, that is, through the extension of Ad Hoc network routing protocols such as AODV (Ad hoc On-Demand Distance Vector) and OLSR (Optimized Link State Routing Protocol). When the FUBIER technology is applied to a conventional bearer network, it can also be extended and advertised through the OSPF routing protocol (Open Shortest Path First), Intermediate System-to-Intermediate System IS-IS, Border Gateway Protocol (BGP), Routing In Fat Trees (RIFT), or BABEL protocol. Since the BFR-ID and interface information of the node itself do not change with the network topology changes caused by node movement, there is basically no dependence on the routing protocol.

[0087] Embodiment 2

[0088] Based on the above embodiment, assuming that the FUBIER encapsulation of the node contains hierarchical elements, and the forwarding table of the node contains the neighbor node information as shown in Table 1, hierarchical verification can be achieved to avoid forwarding mis-encapsulated packets.

[0089] Specifically, when the node receives a FUBIER-encapsulated packet, it finds the unit where the node is located, obtains the hierarchical information of the node and the copy-forward bit string information, and then, according to the setting in the copy-forward bit string, looks up the forwarding table. In addition to finding the local interface, it can also obtain the neighbor information corresponding to the interface. Then, using the BFR-ID information of the neighbor, it finds its unit in the FUBIER encapsulation, obtains its hierarchical information, and compares the hierarchical level of the neighbor with that of the node. If the hierarchical information of the neighbor is one level higher than that of the node, the verification passes; otherwise, it indicates that the encapsulation is incorrect, which may be a forged packet and may cause risks such as loops. At this time, the error information can be recorded and the packet can be discarded without further forwarding.

[0090] Among them, if the unit where the neighbor is located cannot be found, it also indicates that the encapsulation is incorrect, and the error will be recorded and the packet will be discarded without further forwarding.

[0091] For example Figure 4Node B in it receives the FUBIER encapsulated message, finds the unit where this node is located, obtains the hierarchical information of this node as 1. According to the setting situation in the copy and forward bit string, it is found that the message is to be copied and sent out from interfaces 2 and 4. When looking up the forwarding table, the neighbors corresponding to interfaces 2 and 4 can be obtained as nodes E and F. Then, before node B copies and forwards the message, it will use the BFR-ID of nodes E and F to look up the FUBIER encapsulation. After obtaining the units of nodes E and F respectively, it checks the hierarchical information of nodes E and F to see if it is 2. If it is, the verification passes, and node B copies the message and sends it out from interfaces 2 and 4. If not, it means there is an encapsulation error, and continuing to forward may cause risks such as loops. At this time, the error can be recorded, and the message can be discarded without further forwarding.

[0092] It should be noted that assuming there is a shared network on the multicast path, that is, on this network, any message sent by a node can be received by other nodes. At this time, hierarchical verification may not be required, or all neighbors can be verified, but as long as only one passes the hierarchical verification, it can be normally forwarded. For example Figure 4 In it, there is a shared network among nodes G, M, and N. In the forwarding tables of nodes G, M, and N, one interface corresponds to multiple neighbors. Assuming that node N has no receiver and the corresponding unit of node N cannot be found in the FUBIER encapsulation, but node M can pass the verification. At this time, it still needs to be normally forwarded instead of discarding the message.

[0093] Embodiment 3:

[0094] Based on the above embodiment, assuming that the FUBIER encapsulation of the node contains hierarchical elements, then before each node looks up the forwarding table and prepares to forward it from the corresponding interface, it can delete the units in the FUBIER encapsulation that are at the same level as this node or have a lower level (that is, closer to the root node than this node). In this way, when the next-level node processes it, it can more quickly find the corresponding unit and process it.

[0095] For example Figure 4For node A in , before finding the need to forward through interface 1 / 2 / 3 at the forwarding layer, node A deletes the units in the FUBIER encapsulation whose levels are equal to or lower than this node. In this example, it is to delete the unit of node A. In this way, when the message is sent to nodes B, C, and D, there will no longer be the unit of node A in the FUBIER encapsulation. Taking node B as an example, before node B processes the message and finds the need to forward through interface 2 / 4, node B also deletes the units in the FUBIER encapsulation whose levels are equal to or lower than this node, that is, deletes the units of nodes B, C, and D, so that when forwarding to the next-level nodes E and F, there will be no units of nodes A, B, C, and D in the FUBIER encapsulation. Therefore, when the next-level node receives it, it can save the time to find the units with levels lower than this node, which can speed up the processing of the node and improve the efficiency.

[0096] In the FUBIER encapsulation and processing method in any of the above embodiments, there is no state of the multicast tree, nodes do not depend on each other, and there is no need to rely on routing protocols, so multicast forwarding in Ad Hoc networks and conventional networks can be simply and efficiently implemented.

[0097] The embodiment of the present application also provides a message processing device. Figure 11 It is a schematic structural diagram of a message processing device provided for an embodiment. As Figure 11 shown, the message processing device includes:

[0098] An encapsulation module 310, configured to encapsulate the transmission path information in the message based on the explicit copy of the fixed-length unit bit index. The explicit copy of the fixed-length unit bit index includes a fixed-length unit, and the fixed-length unit includes the node bit forwarding router identifier BFR-ID and the node copy forwarding bit string of the corresponding node;

[0099] A sending module 320, configured to send the message.

[0100] In an embodiment, the node copy forwarding bit string includes a local decapsulation identifier, and the local decapsulation identifier is used to indicate whether the corresponding node decapsulates the message.

[0101] In an embodiment, the local decapsulation identifier is the lowest bit or the highest bit of the node copy forwarding bit string.

[0102] In an embodiment, the fixed-length unit further includes the level information of the corresponding node, and the level information is used to indicate the level to which the corresponding node belongs.

[0103] In an embodiment, the method further includes:

[0104] Obtaining the forwarding table of each node in the network, where the forwarding table includes the interfaces and interface indexes of this node;

[0105] Determine the transmission path information according to the forwarding table of each node.

[0106] In one embodiment, the forwarding table further includes neighbor nodes of the interface of this node.

[0107] The message processing device proposed in this embodiment and the message processing method proposed in the above embodiment belong to the same inventive concept. Technical details not described in detail in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as the execution of the message processing method.

[0108] An embodiment of the present application further provides a message processing device. Figure 12 It is a schematic structural diagram of another message processing device provided for an embodiment. As Figure 12 shown, the message processing device includes:

[0109] A message receiving module 410, configured to receive a message, where the message contains transmission path information encapsulated by explicit replication based on a fixed-length unit bit index. The fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes a node bit forwarding router identifier and a node replication forwarding bit string of the corresponding node;

[0110] A determination module 420, configured to determine the node replication forwarding bit string of this node according to the fixed-length unit corresponding to this node;

[0111] A processing module 430, configured to process the message according to the node replication forwarding bit string of this node.

[0112] In one embodiment, the node replication forwarding bit string of this node includes a local de-encapsulation identifier;

[0113] The processing module 430 is configured to:

[0114] When the local de-encapsulation identifier is a specified value, de-encapsulate the message and forward the message to the receiver of this node.

[0115] In one embodiment, the local de-encapsulation identifier is the lowest bit or the highest bit of the node replication forwarding bit string.

[0116] In one embodiment, the processing module 430 is configured to:

[0117] When there is an interface index to be forwarded in the node replication forwarding bit string of this node, copy and forward the message to the next-hop node according to the forwarding table of this node.

[0118] In one embodiment, the fixed-length unit further includes the hierarchical information of the corresponding node, and the hierarchical information is used to indicate the layer to which the corresponding node belongs.

[0119] In one embodiment, the apparatus further comprises:

[0120] A hierarchy determination module configured to determine the hierarchy information in the fixed-length units of neighbor nodes;

[0121] A verification module configured to, when the hierarchy information of the neighbor node is one level higher than that of the local node, verify the hierarchy information of the neighbor node.

[0122] In one embodiment, before processing the message according to the local node's copy and forward bit string, the apparatus further comprises:

[0123] A deletion module configured to delete the fixed-length units corresponding to the specified nodes in the explicit copy of the fixed-length unit bit index, where the specified nodes include nodes whose hierarchy information is equal to or lower than that of the local node.

[0124] In one embodiment, the apparatus further comprises:

[0125] A generation module configured to generate a forwarding table of the local node according to the local node interface and the interface index.

[0126] In one embodiment, the forwarding table further includes neighbor nodes of the local node interface.

[0127] The message processing apparatus proposed in this embodiment and the message processing method proposed in the above embodiment belong to the same inventive concept. For technical details not described in detail in this embodiment, reference can be made to any of the above embodiments, and this embodiment has the same beneficial effects as the execution of the message processing method.

[0128] This application embodiment also provides a communication node, Figure 13 which is a schematic hardware structure diagram of a communication node provided in an embodiment. As Figure 13 shown, the communication node provided by this application includes a processor 510 and a memory 520; the processor 510 in the communication node can be one or more, Figure 13 and one processor 510 is taken as an example here; the memory 520 is configured to store one or more programs; the one or more programs are executed by the one or more processors 510, so that the one or more processors 510 implement the message processing method as described in the embodiments of this application.

[0129] The communication node further includes: a communication device 530, an input device 540, and an output device 550.

[0130] The processor 510, the memory 520, the communication device 530, the input device 540, and the output device 550 in the communication node can be connected through a bus or other means, Figure 13 and taking connection through a bus as an example here.

[0131] The input device 540 can be used to receive input digital or character information and generate key signal inputs related to the user settings and function controls of the communication node. The output device 550 can include display devices such as a display screen.

[0132] The communication device 530 can include a receiver and a transmitter. The communication device 530 is configured to perform information transceiver communication under the control of the processor 510.

[0133] The memory 520, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the message processing method described in the embodiments of the present application (for example, the encapsulation module 310 and the sending module 320 in the message processing device). The memory 520 can include a program storage area and a data storage area. Among them, the program storage area can store an operating system and application programs required for at least one function; the data storage area can store data created according to the use of the communication node. In addition, the memory 520 can include high-speed random access memory and can also include non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some instances, the memory 520 can further include a memory remotely set relative to the processor 510, and these remote memories can be connected to the communication node through a network. Examples of the above network include but are not limited to the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0134] The embodiments of the present application also provide a storage medium storing a computer program, and when the computer program is executed by a processor, it implements any one of the message processing methods in the embodiments of the present application. The method includes: encapsulating transmission path information in a message based on fixed-length unit bit index explicit replication, where the fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes the node bit forwarding router identifier BFR-ID and the node replication forwarding bit string of the corresponding node; sending the message. Alternatively, the method includes: receiving a message, where the message contains transmission path information encapsulated based on fixed-length unit bit index explicit replication, the fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes the node bit forwarding router identifier and the node replication forwarding bit string of the corresponding node; determining the node replication forwarding bit string of the current node according to the fixed-length unit corresponding to the current node; processing the message according to the node replication forwarding bit string of the current node.

[0135] The computer storage medium of the embodiments of the present application may adopt any combination of one or more computer-readable media. The computer-readable media may be computer-readable signal media or computer-readable storage media. The computer-readable storage media may be, for example, but not limited to: electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or components, or any combination of the above. More specific examples (non-exhaustive list) of the computer-readable storage media include: electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fibers, portable CD-ROMs, optical storage devices, magnetic storage devices, or any suitable combination of the above. The computer-readable storage media may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, device, or component.

[0136] The computer-readable signal media may include data signals propagated in a baseband or as part of a carrier wave, which carry computer-readable program codes. Such propagated data signals may take various forms, including but not limited to: electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal media may also be any computer-readable media other than the computer-readable storage media, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, device, or component.

[0137] The program codes contained on the computer-readable media may be transmitted by any appropriate medium, including but not limited to: wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the above.

[0138] Computer program code for performing the operations of this application can be written in one or more programming languages or combinations thereof. The programming languages include object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, executed as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, by using an Internet service provider to connect through the Internet).

[0139] As described above, it is only an exemplary embodiment of this application and is not used to limit the protection scope of this application.

[0140] Those skilled in the art should understand that the term user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable network browser, or a vehicle-mounted mobile station.

[0141] Generally speaking, various embodiments of this application can be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in firmware or software that can be executed by a controller, a microprocessor, or other computing devices, although this application is not limited thereto.

[0142] Embodiments of this application can be implemented by a data processor of a mobile device executing computer program instructions, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions can be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0143] Any block diagram of a logical process in the accompanying drawings of the present application may represent a program step, or may represent interconnected logical circuits, modules, and functions, or may represent a combination of program steps and logical circuits, modules, and functions. A computer program may be stored in a memory. The memory may have any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to read-only memory (ROM), random access memory (RAM), optical memory devices and systems (such as digital video disc (DVD) or compact disk (CD), etc.). The computer-readable medium may include a non-transitory storage medium. The data processor may be any type suitable for the local technical environment, such as but not limited to a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FGPA), and a processor based on a multi-core processor architecture.

[0144] By way of illustrative and non-limiting examples, a detailed description of exemplary embodiments of the present application has been provided above. However, various modifications and adaptations of the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and the claims, without departing from the scope of the present application. Accordingly, the proper scope of the present application will be determined in accordance with the claims.

Claims

1. A message processing method, applied to a first node, characterized in that, Including: Encapsulating the transmission path information in a message based on fixed-length unit bit index explicit replication, where the fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes a node-bit forwarding router identifier BFR-ID of a corresponding node and a node replication forwarding bit string; Sending the message.

2. The method according to claim 1, characterized in that, The node replication forwarding bit string includes a local decapsulation identifier, and the local decapsulation identifier is used to indicate whether the corresponding node decapsulates the message.

3. The method according to claim 2, wherein The local decapsulation identifier is the lowest bit or the highest bit of the node replication forwarding bit string.

4. The method according to claim 1, characterized in that, The fixed-length unit further includes hierarchical information of the corresponding node, and the hierarchical information is used to indicate the hierarchy to which the corresponding node belongs.

5. The method according to claim 1, characterized in that, Also including: Obtaining the forwarding table of each node in the network, where the forwarding table includes the interfaces of the local node and interface indexes; Determining the transmission path information according to the forwarding tables of each node.

6. The method according to claim 4, wherein The forwarding table further includes the neighbor nodes of the interfaces of the local node.

7. The method according to claim 1, characterized in that, The transmission path information is encapsulated based on fixed-length unit bit index explicit replication after the Ethernet header or IPv4 / IPv6 header, or carried by options in the hop-by-hop options header extension header or destination options extension header of IPv6.

8. A message processing method, applied to a second node, characterized in that, Including: Receiving a message, where the message contains transmission path information encapsulated based on fixed-length unit bit index explicit replication, the fixed-length unit bit index explicit replication includes a fixed-length unit, and the fixed-length unit includes a node-bit forwarding router identifier of a corresponding node and a node replication forwarding bit string; Determining the node replication forwarding bit string of the local node according to the fixed-length unit corresponding to the local node; Processing the message according to the node replication forwarding bit string of the local node.

9. The method according to claim 8, wherein The node replication forwarding bit string of the local node includes a local decapsulation identifier; Processing the message according to the node replication forwarding bit string of the local node includes: When the local decapsulation identifier is a specified value, decapsulating the message and forwarding the message to the receiver of the local node.

10. The method according to claim 9, characterized in that, The local decapsulation identifier is the lowest bit or the highest bit of the node replication forwarding bit string.

11. The method according to claim 9, characterized in that Processing the message according to the node replication forwarding bit string of the local node includes: When there is an interface index to be forwarded in the node replication forwarding bit string of the local node, copying and forwarding the message to the next-hop node according to the forwarding table of the local node.

12. The method according to claim 9, wherein The fixed-length unit further includes hierarchical information of the corresponding node, and the hierarchical information is used to indicate the hierarchy to which the corresponding node belongs.

13. The method according to claim 12, characterized in that, Also including: Determining the hierarchical information in the fixed-length unit of the neighbor node; When the hierarchical information of the neighbor node is one level higher than the hierarchical information of the local node, the hierarchical information of the neighbor node passes the verification.

14. The method according to claim 12, wherein Before processing the message according to the node replication forwarding bit string of the local node, further including: Deleting the fixed-length unit corresponding to the specified node in the fixed-length unit bit index explicit replication, where the specified node includes nodes with hierarchical information equal to or lower than the hierarchical information of the local node.

15. The method according to claim 9, wherein Also including: Generating the forwarding table of the local node according to the interfaces and interface indexes of the local node.

16. The method according to claim 15, wherein: The forwarding table further includes the neighbor nodes of the interfaces of the local node.

17. The method according to claim 8, characterized in that The transmission path information is explicitly replicated and encapsulated based on a fixed-length cell bit index after the Ethernet header or the IPv4 / IPv6 header, or carried by options in the hop-by-hop options header extension header or the destination options extension header of IPv6.

18. A communication node, characterized in that, Comprising: a memory, and one or more processors; the memory configured to store one or more programs; when the one or more programs are executed by the one or more processors, such that the one or more processors implement the packet processing method according to any one of claims 1-17.

19. A computer-readable storage medium, having a computer program stored thereon, characterized in that, When the program is executed by a processor, it implements the packet processing method according to any one of claims 1-18.

Images