CN115150311A

CN115150311A - Message forwarding method, device and equipment

Info

Publication number: CN115150311A
Application number: CN202110347858.5A
Authority: CN
Inventors: 姜文颖; 程伟强; 龚立艳
Original assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Current assignee: China Mobile Communications Group Co Ltd; China Mobile Communications Ltd Research Institute
Priority date: 2021-03-31
Filing date: 2021-03-31
Publication date: 2022-10-04

Abstract

The invention provides a message forwarding method, a device and equipment, wherein the method comprises the following steps: 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 invention can realize the exclusive sharing of the bottom physical resources with the sub-link granularity and improve the network value.

Description

Message forwarding method, device and equipment

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, and a device for forwarding a packet.

Background

Existing slicing techniques include FlexAlgo technology, SR-TE, SRv6 Policy tunneling technology. The FlexAlgo (FA for short, flexible algorithm) technology is based on IGP (interior gateway) single topology, each node and each L3 link correspond to one or more FA algorithm spaces, and the FA algorithm spaces are issued by an IGP protocol to form an IGP sub-computation path space. The FlexAlgo technology can only ensure node selection and physical link selection and realize slicing of coarse granularity at the level of a physical port, but the existing network can not ensure that all links between nodes are multiple, so that the exclusive sharing of slicing resources can not be ensured end to end, and slicing users can only share a certain physical link and can not realize the allocation of multiple sub-link resources to different slicing users, so that great resource waste can be caused to scenes with physical isolation slicing requirements.

SR-TE and SRv6 Policy technologies are source routing tunnel technologies, and can calculate a path identifier list (SID 1, SID2, … SIDN) meeting requirements for a user in a network based on SLA (service level agreement) requirements of the user, such as time delay and bandwidth, wherein the SID is a segment identifier and guides a user message to be forwarded in the network along a specified path.

The SR-TE and SRv6 Policy solve the path planning problem by itself, which instructs the packet to avoid the congested road segment and forward along the specified path, but resources, such as bandwidth, on each physical link on the forwarding path cannot be guaranteed, because link resources are shared by all tunnels, the link resources cannot be associated with physical resources of sub-links on the bottom layer, only logical isolation is achieved, and the hard slice requirement of exclusive sharing of resources required by a user cannot be met.

Disclosure of Invention

The technical problem to be solved by the present invention is how to provide a method, an apparatus and a device for forwarding a packet. The sharing of the slices based on the physical resources of the sub-links and the bottom physical resources of the granularity of each slice sub-link is realized, and the network value is improved.

In order to solve the technical problems, the technical scheme of the invention is as follows:

a message forwarding method is applied to network equipment, and the method comprises the following steps:

dividing a physical link of the 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.

Optionally, each of the plurality of sub-links is configured with a physical resource.

Optionally, the sub-link identifier includes: the slice identifier of the network slice to which the sublink belongs and the bottom-layer physical resource identifier of the sublink.

Optionally, the node adjacency identification is an Algorithm field in a sub-extension format of the node adjacency identification.

Optionally, the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, and is configured to advertise multiple sub-link node adjacency identifiers.

Optionally, the color type in the affinity attribute included in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least includes: the flexible algorithm FA slice to which each sub-link included in the physical link belongs requires the included color category in the computation constraint.

Optionally, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link, including:

and generating a forwarding table based on the calculation of the interface sub-link information according to preset indication information and the sub-link identifier and the node adjacent identifier of the sub-link.

Optionally, generating a forwarding table according to 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, including:

a network device serving as a forwarding node in a network determines a flexible algorithm FA slice identifier to which the network device belongs according to the prefix identifier SID;

selecting a node adjacency identifier according to the FA slice identifier;

and determining an outgoing interface sublink corresponding to the prefix identification SID according to the node adjacency identification, and generating a forwarding table.

Optionally, the generating a forwarding table according to 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:

the network equipment serving as a head node in the network determines a flexible algorithm FA slice identifier to which the equipment belongs according to the prefix identifier SID;

calculating a path meeting constraint conditions to the target prefix by using an FA algorithm corresponding to the prefix identification SID according to preset indication information announced by each device on a forwarding path, and arranging paths of each sub-link on the path;

selecting a node adjacency identifier of the current sublink according to the FA slice identifier;

Optionally, the arranging the path for each sub-link on the path includes:

arranging paths for node identifications SID of nodes corresponding to flexible algorithm FA slices on the paths; or,

and performing path arrangement on the node adjacency identifiers of the sub-links on the path.

Optionally, forwarding a packet according to the forwarding table includes:

and forwarding the message according to the physical resources corresponding to the sub-links in the forwarding table.

An embodiment of the present invention further provides a packet forwarding apparatus, where the apparatus includes:

a processing module for dividing a physical link of the 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 the transmission module is used for forwarding the message according to the forwarding table.

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

a processor to divide a physical link of the network device into a plurality of sublinks; 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 the transceiver is used for forwarding the message according to the forwarding table.

An embodiment of the present invention further provides a network device, including: a processor, a memory storing a computer program which, when executed by the processor, performs the method as described above.

Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method as described above.

The scheme of the invention at least comprises the following beneficial effects:

the scheme of the invention divides the physical link of the network equipment 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; forwarding the message according to the forwarding table; the method and the device realize the exclusive sharing of the slices of the physical resources based on the sublinks and the bottom physical resources of the granularity of each slice sublink, and improve the network value.

Drawings

Fig. 1 is a schematic flowchart of a message forwarding method according to an embodiment of the present invention;

fig. 2 is a schematic structural diagram of node adjacency identification sub-extension format end.x SID sub-TLV according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of FADF sub-sub-TLV structure;

FIG. 4 is a schematic structural diagram of the preset indication information according to the embodiment of the present invention;

FIG. 5 is a diagram illustrating a physical networking architecture of devices in a network, in accordance with an embodiment of the present invention;

fig. 6 is a schematic diagram of distribution of End node identifiers End SID and end.x SID of each device in the embodiment of the present invention;

FIG. 7 is a schematic diagram of an FA128 slice topology according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of an FA129 slice topology according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of an FA130 slice topology according to an embodiment of the present invention;

fig. 10 is a schematic diagram of forwarding tables of devices in an FA130 slice packet SRv BE tunnel according to an embodiment of the present invention;

fig. 11 is a schematic diagram of a FA130 slice packet SRv Policy tunnel forwarding process according to an embodiment of the present invention;

fig. 12 is a schematic diagram of a FA130 slice packet SRv Policy tunnel forwarding process according to an embodiment of the present invention;

fig. 13 is a schematic block diagram of a message forwarding apparatus according to an embodiment of the present invention.

Detailed Description

Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

As shown in fig. 1, an embodiment of the present invention provides a packet forwarding method, which is applied to a network device, and the method includes:

step 11, dividing the physical link of the network equipment into a plurality of sub-links;

step 12, configuring a sub-link identifier and a node adjacency identifier for the sub-link;

step 13, generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link;

and step 14, forwarding the message according to the forwarding table.

In this embodiment of the present invention, the physical link of the network device is divided 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. The physical resource may be at least one of: VLAN (virtual local area network) enhancer interface, channelized sub-interface and Flexe/MTN (tunnel isolated) sub-interface. The embodiment of the invention improves the network value based on the slicing of the physical resources of the sublinks and the exclusive sharing of the bottom physical resources of the granularity of each slice sublink, and provides sublink-level data carrying network hard slicing service with resource guarantee for users.

In the above embodiment of the present invention, the sub-link identifier includes: the slice identifier of the network slice to which the sublink belongs and the bottom-layer physical resource identifier of the sublink. The length of the sublink identifier may be 4 bytes, wherein the upper 8 bits represent a slice identifier FA-ID (flexible algorithm slice identifier) of a slice to which the sublink belongs, and the remaining lower 24 bits represent a sublink resource ID, such as vlan ID/ChannelID/FlexEID/MTNID.

An example of sublink identification is as follows, where for simplicity each number in the table below represents an 8bit decimal value:

the physical resource attribute corresponding to each sub-link may be flexibly defined on the device, and this is only exemplified by the bandwidth resource.

In the above embodiment of the present invention, as shown in fig. 2, the node adjacency identifier is an Algorithm field in a sub-extension format of the node adjacency identifier, and an independent node adjacency identifier (end.x SID) is allocated to each sub-link, and the sub-extension format (end.x SID sub-TLV) of each node adjacency identifier corresponds to the Algorithm field of the Algorithm field, which is consistent with the FA Algorithm (flexile Algorithm) used by the FA slice to which the corresponding Algorithm field belongs.

In the above embodiments of the present invention, the network device carries multiple node adjacency identification sub-extension formats in the same adjacency extension format, and is configured to advertise multiple sub-link node adjacency identifications.

For example, the SRv node advertises multiple sub-links end.x SIDs by carrying multiple SRv end.x SID sub-TLVs (node adjacency identification sub-extension formats) in the same adjacency TLV (extension format).

And the equipment locally stores the mapping relation between the end.X SID of each sublink and the corresponding sublink identifier.

An example mapping relationship is as follows:

End.X SID	Sub-Link Num of sublink identifier
		End.x1/FA1	1001
End.x2/FA2	2002
		End.x3/FA3	3003

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 sublink resources mapped by the multiple end.x SIDs, preferably, the load can be shared on average.

In the above embodiments of the present invention, in order to be compatible with various types of underlying resources, a sublink identifier is introduced: sub-Link Num; of course, vlan id/ChannelID/FlexEID/MTNID can be used directly to identify a specific sublink.

In the above embodiment of the present invention, the color type in the affinity attribute included in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least includes: the flexible algorithm FA slice to which each sub-link included in the physical link belongs requires the included color category in the computation constraint.

That is, the color included 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 at least includes the color required to be included in the computation path constraint by the FA slice to which each sub-link belongs.

In an alternative embodiment of the present invention, step 13 may include:

step 131, according to 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.

The predicted indication information may be an extended FADF (flexible algorithm definition flag) sub-sub-TLV of the FAD sub-TLV of the router capability TLV, and a Q-flag (i.e., preset indication information Q) is added to indicate the interface-based sub-link information to be calculated. The FADF sub-sub-TLV structure is shown in FIG. 3, and the expanded Flags structure is shown in FIG. 4.

In an alternative embodiment of the present invention, step 131 may include:

step 1311, determining, by a network device serving as a forwarding node in the network, a flexible algorithm FA slice identifier to which the network device belongs according to the prefix identifier SID;

step 1312, selecting a node adjacency identifier according to the FA slice identifier;

step 1313, determining an outgoing interface sublink corresponding to the prefix id SID according to the node adjacency id, and generating a forwarding table.

In an optional implementation manner, a SRv-BE manner is adopted, specifically, a forwarding device in a network knows an FA-ID (flexible Algorithm slice identifier) to which a prefix SID belongs according to the prefix SID (prefix identifier), then knows that a device corresponding to a slice supports a sublink-based computation circuit according to setting information of a Q-flag field in a FADF Sub-Sub-TLV of the device, and therefore, when locally computing a circuit, the slice information to which the sublink-x SID belongs is considered (a local end-x SID corresponding to Algorithm is selected and supported according to the FA-ID of the prefix SID, and then which sublink is walked according to the end-x SID fragment), an outgoing interface sublink corresponding to each prefix SID is calculated, and a local forwarding table is generated to guide traffic to enter a VLAN enhancer interface, a Channel channelization subinterface, and a FlexE/MTN interface corresponding to Sub-Link on an outgoing interface of the device for forwarding, so as to ensure that the sublink-SID belongs to a Sub-Link can share a sublink physical resource corresponding to a bottom layer FA.

An example forwarding table is as follows:

Prefix	nexthop (Next hop)	OutIf (output 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

It should be noted that, in order to be compatible with various types of underlying resources, a sublink identifier is introduced: sub-Link Num; it is also possible to directly associate to a physical resource of a specific sublink, such as vlan id/ChannelID/FlexEID/MTNID.

In an alternative embodiment of the present invention, step 131 may include:

step 1314, the network device serving as the head node in the network determines the flexible algorithm FA slice identifier to which the head node belongs according to the prefix identifier SID;

step 1315, according to preset indication information advertised by each device on the forwarding path, calculating, by using an FA algorithm corresponding to the prefix identifier SID, a path that meets constraint conditions to the destination prefix, and performing routing on each sub-link on the path;

1316, according to the FA slice identifier, selecting the node adjacent identifier of the current sublink;

step 1317, determining an outgoing interface sublink corresponding to the prefix id SID according to the node adjacency id, and generating a forwarding table.

In step 1315, the arranging the path for each sub-link on the path includes:

arranging paths for node identifications SID of nodes corresponding to flexible algorithm FA slices on the paths; or, performing path organization on the node adjacency identification of the sub-link on the path.

In an optional implementation manner, a SRv-Policy manner is adopted to perform path arrangement on the node identifiers SID of the nodes on the path corresponding to the flexible algorithm FA slices, that is, a loose path: the head node PE device knows the FA-ID to which the prefix SID belongs according to the prefix SID, and meanwhile, according to the setting information of the Q-flag field in the FADF sub-sub-TLV notified by each device, the device knows that the device supports calculating the path based on the sub-link, therefore, the FA Algorithm corresponding to the prefix SID is used for calculating the path meeting the constraint condition of the prefix, and the node SID corresponding to each node along the path is adopted for arranging the path.

In an alternative implementation, a SRv-Policy approach is used, performing path arrangement on the node adjacent identification of the sub-link on the path, wherein the strict path is as follows: the head node PE device knows the FA-ID to which the head node PE device belongs according to the prefix SID, and meanwhile, according to the setting information of the Q-flag field in the FADF sub-sub-TLV notified by each device, the head node PE device knows that the device supports calculation of the path based on the sub-link, so that the FA Algorithm corresponding to the prefix calculates the path meeting the constraint condition of the target prefix, and performs SRv6 Policy tunnel path arrangement on the end.X SID corresponding to the sub-link (namely, 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 flow carried in the SR Policy tunnel to be forwarded on the determined sub-link, and ensuring that the FA slice to which the prefix SID belongs has an exclusive sub-link bottom layer physical resource.

In an alternative embodiment of the present invention, the step 14 may include: and forwarding the message according to the physical resources corresponding to the sub-links in the forwarding table.

The following describes the implementation process of the above embodiment with reference to specific embodiments:

1) Description of networking:

the topology is shown in fig. 5: assuming that A, B, C, D, E, F, G, H devices operate an ISIS dynamic routing protocol and are all in the same ISIS (link state routing protocol) domain, all the devices support the FA function and advertise externally the Q-flag setting of the FADF sub-sub-TLV, if the Q-flag setting is the first preset bit, it indicates a calculation path based on a sub-link, where the first preset bit may be 1 or 0, and certainly may be a flag bit represented in other manners.

2) As shown in fig. 6, a schematic diagram of the End SID and the end.x SID of each device in the network is assigned.

The affinity attribute of each link in the network is configured as follows:

link (bidirectional)	Affinity Properties
		A-B、A-F、B-C、F-G、G-H、H-E、C-G	0x00000111 (Green, yellow, blue)
C-D，D-E	0x00000101 (Green, blue)
		B-F	0x00000110 (Green, yellow)
D-H	0x00000100 (Green)

Based on the basic configuration, the following 3 FA slice topologies can be formed, as shown in fig. 7, fig. 8, and fig. 9, where fig. 7 represents a green link topology, fig. 8 represents a yellow link topology, and fig. 9 represents a blue link topology.

Device sublink resource pre-configuration: and configuring a mapping relation from the end.X SID to the Sub-Link identifier Sub-Link Num for the logic Sub-Link of each physical Link on the forwarding equipment. Taking device a as an example, the mapping relationship is shown in the following table, and so on for other devices.

Configuring physical resources corresponding to Sub-Link Num of each Sub-Link identifier on forwarding equipment, taking VLAN resources as an example, the mapping relation on the equipment A is shown in the following table, and other equipment is similar:

Sub-Link Num	VLANID	Bandwidth	……
				1001	001	5G	……
2002	002	5G	……
				3003	003	5G	……

here, the physical resource corresponding to the logical sublink resource may also be a Channel channelization subinterface resource, a Flex/MTN subinterface resource, or the like, and here, only the VLAN enhancer interface resource is used for example. Other physical resources besides bandwidth may also be configured for VLAN enhancer interface/Channel channelized subinterface/Flex/MTN subinterface, which is only exemplified here by bandwidth resources.

3) Message forwarding procedure

(1) SRv6 BE tunnel, the forwarding device in the network generates local forwarding table for different Prefix-SID according to the above-mentioned operation mechanism. Taking device a as an example, the forwarding table is as follows:

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

when a message with the destination of E3:1 100 arrives at the device A, the device A searches a forwarding table, and knows that the outgoing interface of the message is GE0/1/0 and the corresponding Sub-Link identifier Sub-Link Num is 3003; and looking up a table according to Sub-Link Num to find a corresponding Vlan003 Sub-interface, and forwarding the E3:1 message by the Vlan003 Sub-interface, so as to ensure an exclusive 10G physical bandwidth resource.

The forwarding process of other devices is the same, and the physical resource guarantee corresponding to the FA130 slice can be obtained on each link until the device reaches the destination. As shown in fig. 10, a schematic diagram of forwarding tables of devices in FA130 slice packet SRv BE tunnel.

(2) SRv6-Policy tunnel

The head node PE device can calculate paths meeting slice constraint conditions for different Prefix-SIDs according to the operation mechanism, and performs SRv6 Policy tunnel path arrangement by adopting the Adj-SIDs of the corresponding sublinks.

With Prefix SID: the strict paths of E1: 1:/FA 128, E2: 1:/FA 129, E3: 1:/FA 130 and SRv6 Policy are taken as examples, and the paths of SRv6 Policy generated by the head node A device respectively are:

E1:1::/FA128，Segmentlist：<X1:1::100，X1:2:1::100，X1:3::100，X1:4::100>

E2:1::/FA129，Segmentlist：<X2:1::100，X2:2::100，X2:10::100，X2:7::100，X2:8::100>

E3:1::/FA130，Segmentlist：<X3:1::100，X3:2::100，X3:3::100，X3:4::100>

after the message is forwarded to each device along the path specified by SRv Policy, each device finds a corresponding egress interface and a corresponding Sub-Link identifier Sub-Link Num according to the next hop end.x SID; and looking up a table according to the Sub-Link Num, finding a corresponding VLAN enhancer interface, and forwarding the message through the VLAN enhancer interface so as to ensure the exclusive physical bandwidth resource.

The packet forwarding process taking SRv6 Policy tunnel (tunnel Endpoint is E3: 1.

The message reaches an entrance node A device, the A device iterates the message to a SRv6 Policy tunnel (the tunnel Endpoint is E3:1: 100) of a slice FA130 for bearing according to a VPN routing strategy, an IPv6 header of a SRv6 Policy tunnel is added outside the original message, the segmentlist of the SRH is < X3:1: 100, X3:2: 100, X3:3: 100, X3:4: 100, E3:1: B100> (wherein E3:1: B100 is the traffic corresponding to the VPN SID), and the current SL pointer points to X3:1: 100.

The device A checks a local mapping table according to X3:1: 100 of the DA field to know that an output interface of the message is GE0/1/0 and a corresponding Sub-Link identifier Sub-Link Num is 3003, checks the table according to the Sub-Link Num to know a corresponding Vlan003 Sub-interface, copies X3:2: 100 to an outer IPv6 header DA field, and forwards the message through the Vlan003 Sub-interface of the GE0/1/0 to the device B after SL-1.

B equipment checks a local mapping table according to X3:2: 100 of the DA field to know that an output interface of the message is GE0/1/0 and a corresponding Sub-Link identifier Sub-Link Num is 3003, then checks the table according to the Sub-Link Num to know a corresponding Vlan003 Sub-interface, then copies X3:3: 100 to an outer IPv6 header DA field, and forwards the message through the Vlan003 Sub-interface of GE0/1/0 to C equipment after SL-1.

Subsequent equipment searches a local mapping table according to the DA field in the node, and forwards the message by associating the local mapping table with the corresponding VLAN enhancer interface until reaching the tunnel tail node E equipment, and the message can obtain the physical resource guarantee of the VLAN enhancer interface corresponding to the FA130 slice on each link of a forwarding path.

In the embodiment of the invention, the FADF sub-sub-TLV is expanded, a Q-flag is added, and the sub-link information based on the interface is indicated to calculate the link; configuration rule of color of affinity attribute of each physical link: at least the color required to be included in the calculation path constraint by the FA slice to which each sub-link belongs is required to be included. The allocation rules of the sub-link identifiers, the slice identifiers and the planning principles and configuration strategies of the corresponding resources; allocating independent end.X SIDs for each sublink resource and announcing the same to the outside, and maintaining the mapping relation between the end.X SIDs and sublink identifiers, wherein each sublink end.X SID comprises the information of the FA algorithm to which the sublink resource belongs and advertises the same to the outside; the route calculation processing mechanism for identifying the FADF new identifier on the forwarding equipment, the association relation between the end.X SID of the sublink and the sublink identifier, and the whole processing mechanism and process of the sublink bottom resource can realize the independent sharing of each slice resource on the same physical link, and can solve the problems that each slice of the FlexAlgo can only share one physical link, the isolation granularity is coarse, and the hard isolation of the slice cannot be realized by large-scale deployment. The embodiment of the invention can well provide bottom layer physical resource guarantee for slicing, realize hard slicing and solve the problems of soft isolation and complete sharing of physical resources only through a tunnel.

As shown in fig. 13, an embodiment of the present invention further provides a message forwarding apparatus 130, where the apparatus 130 includes:

a processing module 131, configured to divide a physical link of the 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 the transmission module 132 is configured to forward the packet according to the forwarding table.

Optionally, the sub-link identifier includes: slice identification of a network slice to which the sublink belongs and bottom layer physical resource identification of the sublink.

network equipment serving as a forwarding node in a network determines a flexible algorithm FA slice identifier to which the network equipment belongs according to the prefix identifier SID;

selecting a node adjacency identifier according to the FA slice identifier;

Optionally, the indicating, according to the preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link, the calculation of the sub-link information based on the interface is performed, so as to generate a forwarding table, including:

Optionally, the arranging the path for each sub-link on the path includes:

arranging paths for node identifications SID of nodes corresponding to flexible algorithm FA slices on the paths; or, performing path organization on the node adjacency identifiers of the sub-links on the path.

Optionally, forwarding a packet according to the forwarding table includes:

and forwarding the message according to the physical resource corresponding to each sub-link in the forwarding table.

It should be noted that the apparatus is an apparatus corresponding to the above method, and all the implementations in the above method embodiment are applicable to the embodiment of the apparatus, and the same technical effects can be achieved.

Optionally, each of the plurality of sublinks is configured with a physical resource.

Optionally, the color category in the affinity attribute included in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least includes: the flexible algorithm FA slice to which each sub-link included in the physical link belongs requires the included color category in the computation constraint.

selecting a node adjacency identifier according to the FA slice identifier;

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

Optionally, the arranging the path for each sub-link on the path includes:

Optionally, forwarding the packet according to the forwarding table includes:

It should be noted that the network device is a network device corresponding to the method, and all implementation manners in the method embodiment are applicable to the embodiment of the network device, and the same technical effect can be achieved.

An embodiment of the present invention further provides a network device, including: a processor, a memory storing a computer program which, when executed by the processor, performs the method as described above. All the implementation manners in the above method embodiment are applicable to this embodiment, and the same technical effect can be achieved.

Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method as described above. All the implementation manners in the method embodiment are applicable to the embodiment, and the same technical effect can be achieved.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical functional division, and other divisions may be realized in practice, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U disk, a removable hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various media capable of storing program codes.

Furthermore, it should be noted that in the apparatus and method of the present invention, it is obvious that each component or each step may be decomposed and/or recombined. These decompositions and/or recombinations are to be regarded as equivalents of the present invention. Also, the steps of performing the series of processes described above may naturally be performed chronologically in the order described, but need not necessarily be performed chronologically, and some steps may be performed in parallel or independently of each other. It will be understood by those skilled in the art that all or any of the steps or elements of the method and apparatus of the present invention may be implemented in any computing device (including processor, storage medium, etc.) or network of computing devices, in hardware, firmware, software, or any combination thereof, which can be implemented by those skilled in the art using their basic programming skills after reading the description of the present invention.

Thus, the objects of the invention may also be achieved by running a program or a set of programs on any computing device. The computing device may be a general purpose device as is well known. The object of the invention is thus also achieved solely by providing a program product containing program code for implementing the method or device. That is, such a program product also constitutes the present invention, and a storage medium storing such a program product also constitutes the present invention. It is to be understood that the storage medium may be any known storage medium or any storage medium developed in the future. It is also noted that in the apparatus and method of the present invention, it is apparent that each component or step can be decomposed and/or recombined. These decompositions and/or recombinations are to be considered as equivalents of the present invention. Also, the steps of executing the series of processes described above may naturally be executed chronologically in the order described, but need not necessarily be executed chronologically. Some steps may be performed in parallel or independently of each other.

While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A message forwarding method is applied to a network device, and the method comprises the following steps:

dividing a physical link of the network device into a plurality of sub-links;

and forwarding the message according to the forwarding table.

2. The message forwarding method of claim 1, wherein each of the plurality of sublinks is configured with physical resources.

3. The message forwarding method according to claim 2, wherein the sub-link identifier comprises: the slice identifier of the network slice to which the sublink belongs and the bottom-layer physical resource identifier of the sublink.

4. The packet forwarding method according to claim 1, wherein the node adjacency identifier is in an algorithmic field in a sub-extension format of the node adjacency identifier.

5. The message forwarding method according to claim 1, wherein the network device carries multiple node adjacency identifier sub-extension formats in the same adjacency extension format, and is configured to advertise multiple sub-link node adjacency identifiers.

6. The message forwarding method according to claim 1, wherein the color type in the affinity attribute included in the sub-extended format of each adjacent extended format corresponding to the physical link of the network device at least includes: the flexible algorithm FA slice to which each sub-link included in the physical link belongs requires the included color category in the computation constraint.

7. The message forwarding method according to claim 1, wherein generating a forwarding table according to the sub-link identifier and the node adjacency identifier of the sub-link comprises:

and generating a forwarding table based on the calculation of the sub-link information of the interface according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link.

8. The message forwarding method according to claim 7, wherein generating a forwarding table based on calculation of the sub-link information of the interface according to preset indication information and the sub-link identifier and the node adjacency identifier of the sub-link comprises:

selecting a node adjacency identifier according to the FA slice identifier;

9. The message forwarding method according to claim 7, wherein a forwarding table is generated based on calculation of sub-link information of an interface according to preset indication information and sub-link identifiers and node adjacency identifiers of the sub-links, and the method comprises:

10. The message forwarding method according to claim 9, wherein the arranging the path for each sub-link on the path comprises:

11. The message forwarding method according to claim 1, wherein the message forwarding according to the forwarding table comprises:

12. A message forwarding apparatus, the apparatus comprising:

13. A network device, comprising:

14. A network device, comprising: a processor, a memory storing a computer program which, when executed by the processor, performs the method of any of claims 1 to 11.

15. A computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method of any one of claims 1 to 11.