A message forwarding method, device and equipment

Abstract

The present invention provides a message forwarding method, device and equipment, the method comprising: dividing a physical link of a network device into a plurality of sub-links; configuring a sub-link identifier and a node adjacency identifier for the sub-link; generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link; and forwarding the message according to the forwarding table. The scheme of the present invention can realize the exclusive use of the underlying physical resources at the sub-link granularity and improve the network value.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a message forwarding method, device and equipment. Background Art

[0002] Existing slicing technologies include FlexAlgo technology, SR-TE, and SRv6 Policy tunnel technology. Among them, FlexAlgo (FA for short) technology is based on the IGP (internal gateway) single topology. Each node and each L3 link corresponds to one or more FA algorithm spaces, which are published by the IGP protocol to form an IGP sub-calculation space. FlexAlgo technology can only guarantee node selection and physical link selection, and realize coarse-grained slicing at the physical port level. However, in the existing network, it is impossible to guarantee that there are multiple links between all nodes, so it is impossible to guarantee the exclusive use of slice resources end to end. In addition, slice users of this solution can only enjoy a certain physical link exclusively, and it is impossible to allocate multiple sub-link resources to different slice users. Therefore, it will cause great resource waste for scenarios with physical isolation slice requirements.

[0003] SR-TE and SRv6 Policy technologies are source routing tunnel technologies that can calculate a path identifier list Segmentlist that meets the user's SLA (service level agreement) requirements, such as latency and bandwidth, in the network.<SID1、SID2、…SIDn> , where SID is the segment identifier, which guides user messages to be forwarded along the specified path in the network.

[0004] SR-TE and SRv6 Policy solve the path planning problem by guiding packets to avoid congested sections and forward along the specified path. However, the resources on each physical link on the forwarding path, such as bandwidth, cannot be guaranteed because link resources are still shared by all tunnels and cannot be associated with the underlying sub-link physical resources. Only logical isolation is achieved, which cannot meet the hard slicing requirements for exclusive use of resources required by users. Summary of the invention

[0005] The technical problem to be solved by the present invention is how to provide a message forwarding method, device and equipment to achieve slicing of physical resources based on sub-links and exclusive use of underlying physical resources at the granularity of each slice sub-link, thereby improving network value.

[0006] In order to solve the above technical problems, the technical solution of the present invention is as follows:

[0007] A message forwarding method, applied to a network device, comprising:

[0008] Dividing a physical link of the network device into a plurality of sub-links;

[0009] Configuring a sub-link identifier and a node adjacency identifier for the sub-link;

[0010] Generate a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

[0011] The message is forwarded according to the forwarding table.

[0012] Optionally, each of the multiple sub-links is configured with physical resources.

[0013] Optionally, the sub-link identifier includes: a slice identifier of the network slice to which the sub-link belongs and an underlying physical resource identifier of the sub-link.

[0014] Optionally, the node adjacency identifier is in the Algorithm field in the sub-extended format of the node adjacency identifier.

[0015] Optionally, the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, for announcing multiple sub-link node adjacency identifiers.

[0016] Optionally, the color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device include at least: the color types required to be included in the path calculation constraints of the flexible algorithm FA slices to which each sub-link contained in the physical link belongs.

[0017] Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link includes:

[0018] According to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, a forwarding table is generated based on the calculation of the sub-link information of the interface.

[0019] Optionally, generating a forwarding table according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, based on calculation of the sub-link information of the interface, includes:

[0020] A network device that acts as a forwarding node in the network determines the flexible algorithm FA slice identifier to which it belongs based on the prefix identifier SID;

[0021] Selecting a node adjacency identifier according to the FA slice identifier;

[0022] According to the node adjacency identifier, the outbound interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

[0023] Optionally, generating a forwarding table according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, based on calculation of the sub-link information of the interface, includes:

[0024] The head node network device in the network determines the flexible algorithm FA slice identifier to which it belongs according to the prefix identifier SID;

[0025] According to the preset indication information announced by each device on the forwarding path, the FA algorithm corresponding to the prefix identifier SID is used to calculate the path to the destination prefix that meets the constraint conditions, and arrange the paths of each sub-link on the path;

[0026] According to the FA slice identifier, select a node adjacency identifier of the current sublink;

[0027] According to the node adjacency identifier, the outbound interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

[0028] Optionally, arranging paths for the sub-links on the path includes:

[0029] Arrange the path for the node identifier SID of the flexible algorithm FA slice corresponding to each node on the path; or,

[0030] Path arrangement is performed on the node adjacency identifiers of the sub-links on the path.

[0031] Optionally, forwarding the message according to the forwarding table includes:

[0032] The message is forwarded according to the physical resources corresponding to each sub-link in the forwarding table.

[0033] An embodiment of the present invention further provides a message forwarding device, the device comprising:

[0034] A processing module, configured to divide the physical link of the network device into a plurality of sub-links; configure a sub-link identifier and a node adjacency identifier for the sub-link; and generate a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

[0035] The transmission module is used to forward the message according to the forwarding table.

[0036] An embodiment of the present invention further provides a network device, including:

[0037] A processor, configured to divide a physical link of the network device into a plurality of sub-links; configure a sub-link identifier and a node adjacency identifier for the sub-link; and generate a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

[0038] The transceiver is used for forwarding messages according to the forwarding table.

[0039] An embodiment of the present invention further provides a network device, comprising: a processor and a memory storing a computer program, wherein the computer program executes the method described above when executed by the processor.

[0040] An embodiment of the present invention further provides a computer-readable storage medium storing instructions, which, when executed on a computer, enable the computer to execute the method described above.

[0041] The above solution of the present invention includes at least the following beneficial effects:

[0042] The above-mentioned scheme of the present invention divides the physical link of the network device into multiple sub-links; configures a sub-link identifier and a node adjacency identifier for the sub-link; generates a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link; forwards messages according to the forwarding table; realizes slicing of physical resources based on sub-links and exclusive use of underlying physical resources at the granularity of each sliced ​​sub-link, thereby improving network value. BRIEF DESCRIPTION OF THE DRAWINGS

[0043] Figure 1 It is a flow chart of a message forwarding method according to an embodiment of the present invention;

[0044] Figure 2 1. It is a schematic diagram of the structure of the node adjacency identifier sub-extended format End.X SID sub-TLV according to an embodiment of the present invention;

[0045] Figure 3 It is a schematic diagram of the FADF sub-sub-TLV structure;

[0046] Figure 4 is a schematic diagram of the structure of preset indication information in an embodiment of the present invention;

[0047] Figure 5 is a schematic diagram of the physical network networking structure of devices in a network according to an embodiment of the present invention;

[0048] Figure 6 1 is a schematic diagram of allocation of End SID and End.X SID of each device end node identifier in an embodiment of the present invention;

[0049] Figure 7 is a schematic diagram of the FA128 slice topology of an embodiment of the present invention;

[0050] Figure 8 is a schematic diagram of the FA129 slice topology of an embodiment of the present invention;

[0051] Fig. 9 is a schematic diagram of the FA130 slice topology of an embodiment of the present invention;

[0052] Fig.10It is a schematic diagram of the forwarding table of each device of the SRv6 BE tunnel of the FA130 slice message according to an embodiment of the present invention;

[0053] Fig.11 It is a schematic diagram of the SRv6 Policy tunnel forwarding process of the FA130 slice message according to an embodiment of the present invention;

[0054] Fig.12 It is a schematic diagram of the SRv6 Policy tunnel forwarding process of the FA130 slice message according to an embodiment of the present invention;

[0055] Fig.13 It is a module block diagram of a message forwarding device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0056] The exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

[0057] like Figure 1 As shown, an embodiment of the present invention provides a message forwarding method, which is applied to a network device, and the method includes:

[0058] Step 11, dividing the physical link of the network device into multiple sub-links;

[0059] Step 12, configuring a sub-link identifier and a node adjacency identifier for the sub-link;

[0060] Step 13, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

[0061] Step 14: forward the message according to the forwarding table.

[0062] This embodiment of the present invention divides the physical link of the network device into multiple sub-links, the multiple sub-links are isolated from each other, and each of the multiple sub-links is configured with exclusive physical resources. The physical resources here can be at least one of the following: VLAN (virtual local area network) enhanced sub-interface, Channelized sub-interface, FlexE / MTN (tunnel isolation) sub-interface. This embodiment of the present invention is based on the slicing of the physical resources of the sub-links and the exclusive use of the underlying physical resources at the granularity of each sliced ​​sub-link, so as to enhance the network value and provide users with a sub-link-level resource-guaranteed data bearer network hard slicing service.

[0063] In the above embodiment of the present invention, the sub-link identifier includes: a slice identifier of the network slice to which the sub-link belongs and an underlying physical resource identifier of the sub-link. The sub-link identifier length can be 4 bytes, of which the upper 8 bits represent the slice identifier FA-ID (Flexible Algorithm Slice Identifier) ​​of the slice to which the sub-link belongs, and the remaining lower 24 bits represent the sub-link resource ID, such as VLANID / ChannelID / FlexEID / MTNID, etc.

[0064] The following is an example of a sublink identifier. To simplify the expression, each number in the following table represents an 8-bit decimal value:

[0065]

[0066] The physical resource attributes corresponding to the above sub-links can be flexibly defined on the device, and only bandwidth resources are used as an example here.

[0067] In the above embodiment of the present invention, the node adjacency identifier is in the Algorithm field of the sub-extended format of the node adjacency identifier, such as Figure 2 As shown, an independent node adjacency identifier (End.XSID) is allocated to each of the above sub-links, and the Algorithm field corresponding to the sub-extension format (End.X SID sub-TLV) of each node adjacency identifier is consistent with the FA algorithm (Flexible Algorithm) used by the FA slice to which it belongs.

[0068] In the above embodiment of the present invention, the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, which is used to announce multiple sub-link node adjacency identifiers.

[0069] For example, an SRv6 node advertises multiple sub-link End.X SIDs by carrying multiple SRv6 End.X SID sub-TLVs (node ​​adjacency identifier sub-extended format) in the same adjacency TLV (extended format).

[0070] The device locally stores the mapping relationship between the End.X SID of each sub-link and the corresponding sub-link identifier.

[0071] The mapping relationship example is as follows:

[0072] End.X SID Sub-Link Num End.x1 / FA1 1001 End.x2 / FA2 2002 End.x3 / FA3 3003

[0073] It should be noted that: multiple End.X SIDs may belong to the same FA slice, and the traffic of the slice is load-shared on the sub-link resources mapped by the multiple End.X SIDs, preferably evenly load-shared.

[0074] In the above embodiments of the present invention, in order to be compatible with various types of underlying resources, a sub-link identifier: Sub-Link Num is introduced; of course, VLANID / ChannelID / FlexEID / MTNID may also be directly used to identify a specific sub-link.

[0075] In the above-mentioned embodiment of the present invention, the color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least include: the color types required to be included in the path calculation constraints of the flexible algorithm FA slices to which each sub-link contained in the physical link belongs.

[0076] That is to say, the colors contained in the EAG (extended management group) sub-TLV (sub-extended format) of each adjacent TLV (extended format) corresponding to each physical link on the node must at least include the colors required to be included in the path calculation constraints of the FA slices to which each sub-link belongs.

[0077] In an optional embodiment of the present invention, step 13 may include:

[0078] Step 131: Generate a forwarding table according to preset indication information, the sub-link identifier of the sub-link and the node adjacency identifier, and calculation based on the sub-link information of the interface.

[0079] The expected indication information here can be to extend the FADF (Flexible Algorithm Definition Flag) sub-sub-TLV of the FAD (Flexible Algorithm Definition) sub-TLV of the router capability TLV, and add a Q-flag (i.e., preset indication information Q) to indicate that the calculation is performed based on the sub-link information of the interface. The structure of the FADF sub-sub-TLV is as follows: Figure 3 As shown, the expanded Flags structure is as follows Figure 4 shown.

[0080] In an optional embodiment of the present invention, step 131 may include:

[0081] Step 1311, a network device serving as a forwarding node in the network determines a flexible algorithm FA slice identifier to which it belongs according to the prefix identifier SID;

[0082] Step 1312, selecting a node adjacency identifier according to the FA slice identifier;

[0083] Step 1313: Determine the outbound interface sublink corresponding to the prefix identifier SID according to the node adjacency identifier, and generate a forwarding table.

[0084] In an optional implementation, the SRv6-BE method is adopted. Specifically, the forwarding device in the network knows the FA-ID (flexible algorithm slice identifier) ​​to which it belongs based on the prefix SID (prefix identifier), and then knows that the device of the corresponding slice supports sub-link-based path calculation based on the setting information of the Q-flag field in the FADFsub-sub-TLV of the device. Therefore, when calculating the path locally, the slice information to which the sub-link End.X SID belongs is considered (the local End.X SID that supports the corresponding Algorithm is selected according to the FA-ID of the prefix SID, and then which sub-link to go according to the End.X SID fragment), and the outbound interface sub-link corresponding to each prefix SID is calculated, and a local forwarding table is generated to guide the traffic to enter the VLAN enhanced sub-interface, Channel channelized sub-interface, and FlexE / MTN interface corresponding to the Sub-Link Num on the device outbound interface for forwarding, so as to ensure that the FA slice to which the prefix SID belongs can exclusively use the corresponding sub-link underlying physical resources.

[0085] The forwarding table example is as follows:

[0086] Prefix Nexthop OutIf (outgoing interface) Sub-Link Num A0:3:1 / FA1 End.x1 GE0 / 1 / 0 1001 A1:3:1 / FA2 End.x2 GE0 / 1 / 0 2002 A2:3:1 / FA3 End.x3 GE0 / 1 / 0 3003

[0087] It should be noted that, in order to be compatible with various types of underlying resources, a sub-link identifier is introduced: Sub-Link Num; it can also be directly associated with the physical resources of a specific sub-link, such as VLANID / ChannelID / FlexEID / MTNID.

[0088] In an optional embodiment of the present invention, step 131 may include:

[0089] Step 1314, the head node network device in the network determines the flexible algorithm FA slice identifier to which it belongs according to the prefix identifier SID;

[0090] Step 1315, according to the preset indication information announced by each device on the forwarding path, the FA algorithm corresponding to the prefix identifier SID is used to calculate the path to the destination prefix that meets the constraint condition, and arrange the paths of each sub-link on the path;

[0091] Step 1316: Select a node adjacency identifier of the current sublink according to the FA slice identifier;

[0092] Step 1317: Determine the outbound interface sublink corresponding to the prefix identifier SID according to the node adjacency identifier, and generate a forwarding table.

[0093] In step 1315, the sub-links on the path are arranged into paths, including:

[0094] The path is arranged for the node identifier SID of the flexible algorithm FA slice corresponding to each node on the path; or, the path is arranged for the node adjacency identifier of the sub-link on the path.

[0095] In an optional implementation, the SRv6-Policy method is used to arrange the path for the node identifier SID of the flexible algorithm FA slice corresponding to each node on the path, that is, a loose path: the head node PE device knows the FA-ID to which it belongs according to the prefix SID, and at the same time, according to the setting information of the Q-flag field in the FADF sub-sub-TLV announced by each device, it knows that the device supports sub-link-based path calculation, so the FA algorithm corresponding to the prefix SID is used to calculate the path to this destination prefix that meets the constraint conditions, and the NodeSID corresponding to the FA of each node along the way is used to arrange the path. When the traffic is forwarded along the path to the specified device in the Segmentlist (SID list), the device knows that the path should be calculated based on the sub-link locally according to the setting information of the Q-flag field in the FADF sub-sub-TLV, so the local End.X SID that supports the corresponding Algorithm is selected according to the FA-ID of the prefix SID, and then the local mapping table is checked according to the End.X SID fragment to know which sub-interface the traffic goes through, and the traffic is forwarded on the determined sub-interface link, ensuring the prefix. The FA slice to which the SID belongs has exclusive sub-link underlying physical resources.

[0096] In an optional implementation, the SRv6-Policy method is used to perform path arrangement on the node adjacency identifiers of the sub-links on the path, and the path is strictly enforced: the head node PE device knows the FA-ID to which it belongs based on the prefix SID, and at the same time, based on the setting information of the Q-flag field in the FADF sub-sub-TLV announced by each device, it knows that the device supports sub-link-based path calculation, so the FA algorithm corresponding to the prefix SID is used to calculate the path to the destination prefix that meets the constraint conditions, and the End.X SID of the corresponding sub-link is used to perform SRv6 Policy tunnel path arrangement (that is, the Algorithm of the End.X SID of each sub-link on the SRv6 Policy path is consistent with the FA-ID of the prefix SID), thereby guiding the traffic carried in the SR Policy tunnel to be forwarded on the determined sub-link, ensuring that the FA slice to which the prefix SID belongs has exclusive sub-link underlying physical resources.

[0097] In an optional embodiment of the present invention, the above step 14 may include: forwarding the message according to the physical resources corresponding to each sub-link in the forwarding table.

[0098] The implementation process of the above embodiment is described below in conjunction with specific embodiments:

[0099] 1) Network description:

[0100] Topology Figure 5 As shown: Assume that there are A, B, C, D, E, F, G, and H devices in the network, running the ISIS dynamic routing protocol, and are all in the same ISIS (Link State Routing Protocol) domain. All devices support the FA function and the Q-flag of the FADF sub-sub-TLV announced to the outside is set. If the Q-flag is set to the first preset bit, it means that the path is calculated based on the sub-link. The first preset bit here can be 1 or 0, and of course it can also be a flag bit expressed in other ways.

[0101] 2) If Figure 6 The figure shows the allocation diagram of End SID and End.X SID of each device in the network.

[0102] The affinity attributes of each link in the network are configured as follows:

[0103] Link (bidirectional) Affinity attributes AB, AF, BC, FG, GH, HE, CG 0x00000111 (green, yellow, blue) CD,DE 0x00000101 (green, blue) BF 0x00000110 (green, yellow) DH 0x00000100 (green)

[0104] Based on the above basic configuration, the following three FA slice topologies can be formed: Figure 7 , Figure 8 as well as Fig. 9 As shown, Figure 7 Indicates green link topology, Figure 8 Indicates yellow link topology, Fig. 9 Indicates the blue link topology.

[0105] Device sub-link resource pre-configuration: On the forwarding device, configure the mapping relationship between End.XSID and sub-link identifier Sub-Link Num for the logical sub-link of each physical link. Taking device A as an example, the mapping relationship is shown in the following table, and the same applies to other devices.

[0106]

[0107]

[0108] Configure the physical resources corresponding to each sub-link identifier Sub-Link Num on the forwarding device. Taking VLAN resources as an example, the mapping relationship on device A is shown in the following table. Other devices are similar:

[0109] Sub-Link Num VLAN ID Bandwidth …… 1001 001 5G …… 2002 002 5G …… 3003 003 5G ……

[0110] Here, the physical resources corresponding to the logical sub-link resources may also be Channel channelized sub-interface resources, Flex / MTN sub-interface resources, etc., and only VLAN enhanced sub-interface resources are used as an example here. Other physical resources other than bandwidth may also be configured for VLAN enhanced sub-interface / Channel channelized sub-interface / Flex / MTN sub-interface, and only bandwidth resources are used as an example here.

[0111] 3) Message forwarding process

[0112] ①SRv6 BE tunnel, the forwarding device in the network generates a local forwarding table for different Prefix-SIDs according to the operating mechanism described above. Taking device A as an example, the forwarding table is as follows:

[0113] Prefix Nexthop OutIf Sub-Link Num E1:1:: / FA128 X1:1:: GE0 / 1 / 0 1001 E2:1:: / FA129 X2:1:: GE0 / 1 / 0 2002 E3:1:: / FA130 X3:1:: GE0 / 1 / 0 3003

[0114] When a message with the destination of E3:1:100 reaches device A, device A checks the forwarding table and finds that the outgoing interface of the message is GE0 / 1 / 0 and the corresponding sub-link identifier Sub-Link Num is 3003. Then, according to Sub-Link Num, the table is checked to find the corresponding Vlan003 sub-interface, and the E3:1:100 message is forwarded through the Vlan003 sub-interface, thereby ensuring exclusive 10G physical bandwidth resources.

[0115] The forwarding process of other devices is the same, until the device can obtain the physical resource guarantee corresponding to the FA130 slice on each link reaching the destination. Fig.10 As shown in the figure, the schematic diagram of the forwarding table of each device in the SRv6 BE tunnel of FA130 slice message.

[0116] ②SRv6-Policy Tunnel

[0117] Based on the operating mechanism described above, the head node PE device can calculate the path that meets the slice constraint conditions for different Prefix-SIDs, and use the Adj-SID of the corresponding sub-link to arrange the SRv6 Policy tunnel path.

[0118] Taking Prefix SID: E1:1:: / FA128, E2:1:: / FA129 and E3:1:: / FA130 and SRv6 Policy strict path as an example, the SRv6 Policy paths generated by head node A for them are:

[0119] E1:1:: / FA128, Segmentlist:<X1:1::100,X1:2:1::100,X1:3::100,X1:4::100>

[0120] E2:1:: / FA129, Segmentlist:<X2:1::100,X2:2::100,X2:10::100,X2:7::100,X2:8::100>

[0121] E3:1:: / FA130, Segmentlist:<X3:1::100,X3:2::100,X3:3::100,X3:4::100>

[0122] After the message is forwarded to each device along the path specified by the SRv6 Policy, each device finds the corresponding outbound interface and the corresponding sub-link identifier Sub-Link Num according to the next hop End.X SID. Then, it looks up the table according to Sub-Link Num to find the corresponding VLAN enhanced sub-interface and forwards the message through the VLAN enhanced sub-interface, thereby ensuring exclusive physical bandwidth resources.

[0123] The packet forwarding process is as follows: Taking the VPN traffic iterated to the SRv6 Policy tunnel of slice FA130 (the tunnel endpoint is E3:1:100) as an example Fig.11 and Fig.12 shown.

[0124] The message arrives at the ingress node A. Device A iterates the message to the SRv6 Policy tunnel (tunnel endpoint is E3:1:100) of slice FA130 according to the VPN routing policy, and adds the IPv6 header of the SRv6 Policy tunnel to the original message. The segmentlist of its SRH is<X3:1::100,X3:2::100,X3:3::100,X3:4::100,E3:1::B100> (E3:1::B100 is the VPN SID corresponding to the traffic), and the current SL pointer points to X3:1::100.

[0125] Device A searches the local mapping table based on X3:1::100 in the DA field and finds that the outbound interface of the packet is GE0 / 1 / 0 and the corresponding sub-link identifier Sub-Link Num is 3003. It then searches the table based on Sub-Link Num and finds the corresponding Vlan003 sub-interface. It then copies X3:2::100 to the DA field in the outer IPv6 header, adds SL-1, and forwards the packet through the Vlan003 sub-interface of GE0 / 1 / 0 to device B.

[0126] Device B searches the local mapping table based on X3:2::100 in the DA field and finds that the outbound interface of the packet is GE0 / 1 / 0 and the corresponding sub-link identifier Sub-Link Num is 3003. It then searches the table based on Sub-Link Num and finds the corresponding Vlan003 sub-interface. It then copies X3:3::100 to the DA field in the outer IPv6 header, adds SL-1, and forwards the packet through the Vlan003 sub-interface of GE0 / 1 / 0 to device C.

[0127] Subsequent devices at this node all perform the same local mapping table lookup based on the DA field, associate it with the corresponding VLAN enhanced sub-interface and forward the message until it reaches the tunnel tail node E device. The message can obtain the physical resource guarantee of the VLAN enhanced sub-interface corresponding to the FA130 slice on each link in the forwarding path.

[0128] The above embodiment of the present invention extends the FADF sub-sub-TLV and adds a Q-flag to indicate that the path is calculated based on the sub-link information of the interface; the configuration rules of the color of the affinity attribute of each physical link: it must at least include the color required to be included in the path calculation constraint of the FA slice to which each sub-link belongs. The allocation rules of the sub-link identifier, the planning principles and configuration strategies of each slice identifier and the corresponding resources; allocate an independent End.XSID to each sub-link resource and announce it externally, maintain the mapping relationship between the End.X SID and the sub-link identifier, and each sub-link End.X SID contains the FA algorithm information and announces it externally; the path calculation processing mechanism for identifying the newly added FADF identifier on the forwarding device, the association relationship between the sub-link End.X SID and the sub-link identifier, and the entire processing mechanism and process to the sub-link underlying resources can realize the exclusive use of each slice resource on the same physical link, which can solve the problem that each FlexAlgo slice can only enjoy one physical link exclusively, the isolation granularity is coarse, and it cannot be deployed on a large scale to realize hard isolation of slices. The above-mentioned embodiments of the present invention can well provide underlying physical resource guarantees for slicing, realize hard slicing, and solve the problem of soft isolation only through tunnels and complete sharing of physical resources.

[0129] like Fig.13 As shown, an embodiment of the present invention further provides a message forwarding device 130, and the device 130 includes:

[0130] The processing module 131 is used to divide the physical link of the network device into multiple sub-links; configure the sub-link identifier and the node adjacency identifier for the sub-link; and generate a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

[0131] The transmission module 132 is used to forward the message according to the forwarding table.

[0132] Optionally, each of the multiple sub-links is configured with physical resources.

[0133] Optionally, the sub-link identifier includes: a slice identifier of the network slice to which the sub-link belongs and an underlying physical resource identifier of the sub-link.

[0134] Optionally, the node adjacency identifier is in the Algorithm field in the sub-extended format of the node adjacency identifier.

[0135] Optionally, the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, for announcing multiple sub-link node adjacency identifiers.

[0136] Optionally, the color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device include at least: the color types required to be included in the path calculation constraints of the flexible algorithm FA slices to which each sub-link contained in the physical link belongs.

[0137] Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link includes:

[0138] According to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, a forwarding table is generated based on the calculation of the sub-link information of the interface.

[0139] Optionally, generating a forwarding table according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, based on calculation of the sub-link information of the interface, includes:

[0140] A network device that acts as a forwarding node in the network determines the flexible algorithm FA slice identifier to which it belongs based on the prefix identifier SID;

[0141] Selecting a node adjacency identifier according to the FA slice identifier;

[0142] According to the node adjacency identifier, the outgoing interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

[0143] Optionally, according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, indicating the calculation of the sub-link information based on the interface, generating the forwarding table includes:

[0144] The head node network device in the network determines the flexible algorithm FA slice identifier to which it belongs according to the prefix identifier SID;

[0145] According to the preset indication information announced by each device on the forwarding path, the FA algorithm corresponding to the prefix identifier SID is used to calculate the path to the destination prefix that meets the constraint conditions, and arrange the paths of each sub-link on the path;

[0146] According to the FA slice identifier, select a node adjacency identifier of the current sublink;

[0147] According to the node adjacency identifier, the outgoing interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

[0148] Optionally, arranging paths for the sub-links on the path includes:

[0149] The path is arranged for the node identifier SID of the flexible algorithm FA slice corresponding to each node on the path; or, the path is arranged for the node adjacency identifier of the sub-link on the path.

[0150] Optionally, forwarding the message according to the forwarding table includes:

[0151] The message is forwarded according to the physical resources corresponding to each sub-link in the forwarding table.

[0152] It should be noted that the device is a device corresponding to the above method, and all implementation methods in the above method embodiments are applicable to the embodiments of the device and can achieve the same technical effects.

[0153] An embodiment of the present invention further provides a network device, including:

[0154] A processor, configured to divide a physical link of the network device into a plurality of sub-links; configure a sub-link identifier and a node adjacency identifier for the sub-link; and generate a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

[0155] The transceiver is used for forwarding messages according to the forwarding table.

[0156] Optionally, each of the multiple sub-links is configured with physical resources.

[0157] Optionally, the sub-link identifier includes: a slice identifier of the network slice to which the sub-link belongs and an underlying physical resource identifier of the sub-link.

[0158] Optionally, the node adjacency identifier is in the Algorithm field in the sub-extended format of the node adjacency identifier.

[0159] Optionally, the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, for announcing multiple sub-link node adjacency identifiers.

[0160] Optionally, the color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device include at least: the color types required to be included in the path calculation constraints of the flexible algorithm FA slices to which each sub-link contained in the physical link belongs.

[0161] Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link includes:

[0162] According to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, a forwarding table is generated based on the calculation of the sub-link information of the interface.

[0163] Optionally, according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, indicating the calculation of the sub-link information based on the interface, generating the forwarding table includes:

[0164] A network device that acts as a forwarding node in the network determines the flexible algorithm FA slice identifier to which it belongs based on the prefix identifier SID;

[0165] Selecting a node adjacency identifier according to the FA slice identifier;

[0166] According to the node adjacency identifier, the outgoing interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

[0167] Optionally, according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, indicating the calculation of the sub-link information based on the interface, generating the forwarding table includes:

[0168] The head node network device in the network determines the flexible algorithm FA slice identifier to which it belongs according to the prefix identifier SID;

[0169] According to the preset indication information announced by each device on the forwarding path, the FA algorithm corresponding to the prefix identifier SID is used to calculate the path to the destination prefix that meets the constraint conditions, and arrange the paths of each sub-link on the path;

[0170] According to the FA slice identifier, select a node adjacency identifier of the current sublink;

[0171] According to the node adjacency identifier, the outgoing interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

[0172] Optionally, arranging paths for the sub-links on the path includes:

[0173] The path is arranged for the node identifier SID of the flexible algorithm FA slice corresponding to each node on the path; or, the path is arranged for the node adjacency identifier of the sub-link on the path.

[0174] Optionally, forwarding the message according to the forwarding table includes:

[0175] The message is forwarded according to the physical resources corresponding to each sub-link in the forwarding table.

[0176] It should be noted that the network device is a network device corresponding to the above method, and all implementation methods in the above method embodiment are applicable to the embodiment of the network device and can achieve the same technical effect.

[0177] The embodiment of the present invention further provides a network device, comprising: a processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the method described above is executed. All implementations in the above method embodiment are applicable to this embodiment and can achieve the same technical effect.

[0178] The embodiment of the present invention also provides a computer-readable storage medium storing instructions, which, when executed on a computer, enable the computer to execute the method described above. All implementations in the above method embodiment are applicable to this embodiment and can achieve the same technical effect.

[0179] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present invention.

[0180] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0181] In the embodiments provided by the present invention, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0182] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0183] In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0184] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium, including several instructions for a computer device (which can be a personal computer, server, or network device, etc.) to perform all or part of the steps of the method described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, ROM, RAM, magnetic disks, or optical disks.

[0185] In addition, it should be noted that in the apparatus and method of the present invention, it is obvious that each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be regarded as equivalent schemes of the present invention. Moreover, the steps of performing the above-mentioned series of processing can naturally be performed in chronological order according to the order of description, but it is not necessary to perform them in chronological order, and some steps can be performed in parallel or independently of each other. For those of ordinary skill in the art, it is understood that all or any steps or components of the method and apparatus of the present invention can be implemented in any computing device (including processors, storage media, etc.) or a network of computing devices in hardware, firmware, software or a combination thereof, which can be achieved by those of ordinary skill in the art using their basic programming skills after reading the description of the present invention.

[0186] Therefore, the purpose of the present invention can also be achieved by running a program or a group of programs on any computing device. The computing device can be a well-known general device. Therefore, the purpose of the present invention can also be achieved by simply providing a program product containing a program code that implements the method or device. That is to say, such a program product also constitutes the present invention, and the storage medium storing such a program product also constitutes the present invention. Obviously, the storage medium can be any well-known storage medium or any storage medium developed in the future. It should also be pointed out that in the device and method of the present invention, it is obvious that each component or each step can be decomposed and / or recombined. These decompositions and / or recombinations should be regarded as equivalent schemes of the present invention. In addition, the steps of performing the above-mentioned series of processing can naturally be performed in chronological order according to the order of description, but it is not necessary to perform them in chronological order. Some steps can be performed in parallel or independently of each other.

[0187] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A message forwarding method, characterized in that: Applied to a network device, the method comprises: Dividing the physical link of the network device into a plurality of sub-links; the plurality of sub-links are isolated from each other, and each of the plurality of sub-links is configured with an exclusive physical resource; Configuring a sub-link identifier and a node adjacency identifier for the sub-link; Generate a forwarding table according to the preset indication information, the sub-link identifier of the sub-link and the node adjacency identifier; forwarding the message according to the forwarding table; The color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least include: the color types required to be included in the path calculation constraints of the flexible algorithm FA slice to which each sub-link contained in the physical link belongs.

2. The message forwarding method according to claim 1, characterized in that: The sub-link identifier includes: the FA slice identifier of the FA slice to which the sub-link belongs and the underlying physical resource identifier of the sub-link.

3. The message forwarding method according to claim 1, characterized in that: The Algorithm field of the sub-extended format End.X SID sub-TLV of the node adjacency identifier is consistent with the FA algorithm used by the FA slice to which it belongs.

4. The message forwarding method according to claim 1, characterized in that: The network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, which is used to announce multiple sub-link node adjacency identifiers.

5. The message forwarding method according to claim 1, characterized in that: The preset indication information is used to indicate path calculation based on sub-link information of the interface.

6. The message forwarding method according to claim 5, characterized in that: When the value of the preset indication information is equal to the first value, it indicates to calculate a path based on the sub-link information of the interface.

7. The message forwarding method according to claim 1, characterized in that: The preset indication information carries the reserved bit of the FADF flexible algorithm definition flag sub-sub-TLV of the FAD flexible algorithm definition of the router capability TLV.

8. The message forwarding method according to any one of claims 1 and 6, characterized in that: Generate a forwarding table based on the calculation of the sublink information of the interface according to the preset indication information and the sublink identifier and the node adjacency identifier of the sublink, including: A network device that acts as a forwarding node in the network determines the flexible algorithm FA slice identifier to which it belongs based on the prefix identifier SID; Selecting a node adjacency identifier according to the FA slice identifier; According to the node adjacency identifier, the outbound interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

9. The message forwarding method according to any one of claims 1 and 6, characterized in that: Generate a forwarding table based on the calculation of the sublink information of the interface according to the preset indication information and the sublink identifier and the node adjacency identifier of the sublink, including: The network device serving as the head node in the network determines the flexible algorithm FA slice identifier to which it belongs according to the prefix identifier SID; According to the preset indication information announced by each device on the forwarding path, the FA algorithm corresponding to the prefix identifier SID is used to calculate the path to the destination prefix that meets the constraint conditions, and arrange the paths of each sub-link on the path; According to the FA slice identifier, select a node adjacency identifier of the current sublink; According to the node adjacency identifier, the outbound interface sub-link corresponding to the prefix identifier SID is determined, and a forwarding table is generated.

10. The message forwarding method according to claim 9, characterized in that: Arranging paths for each sub-link on the path includes: Arrange the path for the node identifier SID of the flexible algorithm FA slice corresponding to each node on the path; or, Path arrangement is performed on the node adjacency identifiers of the sub-links on the path.

11. The message forwarding method according to claim 1, characterized in that: According to the forwarding table, the message is forwarded, including: The message is forwarded according to the physical resources corresponding to each sub-link in the forwarding table.

12. A message forwarding device, characterized in that: Applied to network equipment, the device comprises: A processing module, configured to divide the physical link of the network device into a plurality of sub-links; configure a sub-link identifier and a node adjacency identifier for the sub-link; generate a forwarding table according to preset indication information, the sub-link identifier and the node adjacency identifier of the sub-link; the plurality of sub-links are isolated from each other, and each of the plurality of sub-links is configured with an exclusive physical resource; A transmission module, used for forwarding messages according to the forwarding table; The color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least include: the color types required to be included in the path calculation constraints of the flexible algorithm FA slice to which each sub-link contained in the physical link belongs.

13. A network device, characterized in that: include: A processor, configured to divide a physical link of the network device into a plurality of sub-links; and configure a sub-link identifier and a node adjacency identifier for the sub-link; Generate a forwarding table according to preset indication information, a sublink identifier of the sublink and a node adjacency identifier; the multiple sublinks are isolated from each other, and each of the multiple sublinks is configured with an exclusive physical resource; A transceiver, used for forwarding messages according to the forwarding table; The color types in the affinity attributes contained in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least include: the color types required to be included in the path calculation constraints of the flexible algorithm FA slice to which each sub-link contained in the physical link belongs.

14. A network device, characterized in that: include: A processor and a memory storing a computer program, wherein when the computer program is executed by the processor, the method according to any one of claims 1 to 11 is executed.

15. A computer-readable storage medium, characterized in that: Instructions are stored, and when the instructions are executed on a computer, the computer is caused to perform the method according to any one of claims 1 to 11.

Images