WO2021129085A1 - 网络切片创建方法、报文转发方法及其装置 - Google Patents

网络切片创建方法、报文转发方法及其装置 Download PDF

Info

Publication number
WO2021129085A1
WO2021129085A1 PCT/CN2020/122492 CN2020122492W WO2021129085A1 WO 2021129085 A1 WO2021129085 A1 WO 2021129085A1 CN 2020122492 W CN2020122492 W CN 2020122492W WO 2021129085 A1 WO2021129085 A1 WO 2021129085A1
Authority
WO
WIPO (PCT)
Prior art keywords
layer
link
network slice
node
affinity
Prior art date
Application number
PCT/CN2020/122492
Other languages
English (en)
French (fr)
Inventor
彭少富
金飞蔡
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP20908342.7A priority Critical patent/EP4084407A4/en
Priority to US17/786,339 priority patent/US20230032778A1/en
Publication of WO2021129085A1 publication Critical patent/WO2021129085A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0806—Configuration setting for initial configuration or provisioning, e.g. plug-and-play
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/40—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/508—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement
    • H04L41/5096—Network service management, e.g. ensuring proper service fulfilment according to agreements based on type of value added network service under agreement wherein the managed service relates to distributed or central networked applications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation

Definitions

  • the embodiments of the present disclosure relate to, but are not limited to, the field of communication technologies, and in particular to a method for creating a network slice, a method for forwarding a message, and a device thereof.
  • the core requirement of 5G network slices for the bearer network is that different network slices need to have their own dedicated bearer sub-networks. Different dedicated bearer sub-networks can have strict hard resource isolation or close to hard isolation. The effect of soft isolation. Since the packet network cannot support hard isolation, in order to support the 5G network slicing requirements, the packet network needs to be sliced on the underlying network resources to meet the needs of different upper-layer services.
  • the existing method is to use the Interior Gateway Protocol (IGP) flexible algorithm (Flex Algorithm, FA) technology to run multiple IGP algorithms in the same topology to calculate multiple FA planes, and each FA plane can represent one A network slice can carry different upper-layer service traffic on different FA planes.
  • IGP Interior Gateway Protocol
  • FA Flexible Algorithm
  • the current method is to establish a three-layer binding link between two adjacent nodes in the IGP protocol domain.
  • the bundled link contains at least two layer 2 member links dedicated to a specific network slice.
  • each layer 3 bundled link can only be applied to one network slice, that is, each layer 2 member link under the layer 3 bundled link corresponds to the same network slice, thus This affects the flexibility of network slice division between adjacent nodes, and cannot support scenarios where each layer 2 member link belongs to different network slices.
  • the embodiments of the present disclosure provide a method for creating a network slice, a method for forwarding a message, and a device thereof, which can support a scenario where each layer 2 member link under a layer 3 bundle link belongs to a different network slice.
  • the flexibility of network slicing can be improved.
  • the embodiments of the present disclosure provide a method for creating a network slice, including: configuring traffic engineering (TE) affinity attributes for each layer 2 member link in the layer 3 bundle link, and using the IGP protocol Flooding the TE affinity attributes of each of the layer 2 member links; according to the TE affinity attributes of the layer 2 member links, the FA algorithm is used to create a network slice containing the layer 2 member links.
  • TE traffic engineering
  • the embodiments of the present disclosure also provide a method for forwarding packets, including: configuring TE affinity attributes for each layer 2 member link in the layer 3 bundled link, and flooding each of the two layers through the IGP protocol.
  • the TE affinity attribute of the layer member link according to the TE affinity attribute of the layer 2 member link, the FA algorithm is used to create a network slice containing the layer 2 member link; the forwarding path to the destination node is established according to the network slice , And forward the message based on the forwarding path.
  • an embodiment of the present disclosure also provides a network slice creation device, including a memory, a processor, and a computer program stored in the memory and capable of running on the processor.
  • a network slice creation device including a memory, a processor, and a computer program stored in the memory and capable of running on the processor.
  • the processor executes the computer program, The network slice creation method of the second aspect described above is implemented.
  • embodiments of the present disclosure also provide a message forwarding device, including: a memory, a processor, and a computer program stored in the memory and capable of running on the processor.
  • a message forwarding device including: a memory, a processor, and a computer program stored in the memory and capable of running on the processor.
  • the processor executes the computer program, Realize the message forwarding method of the third aspect as described above.
  • embodiments of the present disclosure also provide a computer-readable storage medium that stores computer-executable instructions.
  • the computer-executable instructions are used to execute the network slice creation method as described above or to execute the network slice creation method as described above. Message forwarding method.
  • the embodiments of the present disclosure include: configuring TE affinity attributes for each layer 2 member link in the layer 3 bundled link, and flooding the TE affinity attributes of each layer 2 member link through the IGP protocol, and then according to the layer 2 member link
  • the TE affinity property of the FA algorithm is used to create a network slice containing Layer 2 member links.
  • the current Each node in the IGP protocol domain saves the layer 3 binding link information of all nodes in the current IGP protocol domain, and the layer 3 binding link information contains the specific TE affinity attributes of each layer 2 member link;
  • the TE affinity properties of the Layer 2 member links are used to create network slices containing Layer 2 member links using the FA algorithm.
  • different network slices can be made to correspond to different Layer 2 member links, so that each network slice can have The TE affinity properties of the corresponding layer 2 member links, that is, the layer 2 member links with the same TE affinity properties can form a network slice, which can support each layer 2 member link under the layer 3 bundle link. Scenarios belonging to different network slices improve the flexibility of network slice division, so as to realize the distinction and isolation of traffic between network slices.
  • FIG. 1 is a schematic diagram of a network topology for executing a network slice creation method or for executing a message forwarding method according to an embodiment of the present disclosure
  • FIG. 2A is a schematic diagram of an embodiment of a link structure between two adjacent nodes in the network topology shown in FIG. 1;
  • FIG. 2B is a schematic diagram of another embodiment of a link structure between two adjacent nodes in the network topology shown in FIG. 1;
  • FIG. 2C is a schematic diagram of another embodiment of a link structure between two adjacent nodes in the network topology shown in FIG. 1;
  • FIG. 3 is a flowchart of a method for creating a network slice according to an embodiment of the present disclosure
  • FIG. 4 is a schematic diagram of a message structure of a field used to indicate a TE affinity attribute provided by an embodiment of the present disclosure
  • FIG. 5 is a flowchart of a message forwarding method provided by an embodiment of the present disclosure.
  • FIG. 6 is a flowchart of a message forwarding method provided by another embodiment of the present disclosure.
  • FIG. 7 is a flowchart of a message forwarding method provided by another embodiment of the present disclosure.
  • FIG. 8 is a schematic diagram of a network topology for executing a message forwarding method provided by an embodiment of the present disclosure
  • FIG. 9 is a schematic diagram of a network topology for executing a method for forwarding a message according to another embodiment of the present disclosure.
  • the present disclosure provides a method for creating a network slice, a method for forwarding a message, and a device thereof.
  • Each layer 2 member link in the layer 3 bundle link is configured with TE affinity attributes, and each layer 2 member is flooded through the IGP protocol.
  • the TE affinity attribute of the link enables each node in the current IGP protocol domain to save the Layer 3 binding link information of all nodes in the current IGP protocol domain, and the Layer 3 binding link information contains specific Layer 2
  • the TE affinity attribute of the member link in addition, the FA algorithm is used to create a network slice containing the layer 2 member link according to the TE affinity attribute of the layer 2 member link, so that different network slices can be associated with different layer 2 member links.
  • each network slice can have the TE affinity attribute of its corresponding Layer 2 member link, that is, Layer 2 member links with the same TE affinity attribute can form a network slice, thereby being able to support the Layer 3 binding chain
  • Each layer 2 member link under the road belongs to different network slice scenarios, which improves the flexibility of network slice division; in addition, when business packets in different network slices are being forwarded, the specificity can be specified according to the TE affinity attribute.
  • the second-tier member link of the network is used as a forwarding outbound interface, which can realize traffic differentiation and isolation between network slices.
  • FIG. 1 is a schematic diagram of a network topology that can be used to perform a network slice creation method or a method for forwarding a message according to an embodiment of the present disclosure.
  • the network topology includes a first node 110, a second node 120, a third node 130, and a fourth node 140, where the first node 110, the second node 120, and the third node 130 are connected in sequence, The fourth node 140 is connected to the first node 110 and the third node 130 respectively.
  • the first node 110, the second node 120, the third node 130, and the fourth node 140 may be network devices such as routers or switches, which can forward packets.
  • the network topology may also include a network controller (not shown in FIG. 1), such as a software defined network (Software Defined Network, SDN) controller, etc.
  • the network controller is connected to the first node 110 and the second node 110, respectively.
  • the node 120, the third node 130, and the fourth node 140 are connected, and can respectively control the first node 110, the second node 120, the third node 130, and the fourth node 140.
  • the first node 110, the second node 120, the third node 130, the fourth node 140, and the network controller respectively include a memory and a processor, where the memory and the processor may be connected by a bus or in other ways.
  • the memory can be configured to store non-transitory software programs and non-transitory computer-executable programs.
  • the memory may include a high-speed random access memory, and may also include a non-transitory memory, such as at least one magnetic disk storage device, a flash memory device, or other non-transitory solid-state storage devices.
  • the memory may optionally include a memory remotely arranged with respect to the processor, and these remote memories may be connected to the processor through a network. Examples of the aforementioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the first node 110, the second node 120, the third node 130, and the fourth node 140 may each have one or more main interfaces for forwarding packets, and each node is connected to neighboring nodes through the main interface.
  • the main interface may include multiple sub-interfaces, and the sub-interfaces may be physical interfaces or logical interfaces.
  • the main interface may also be physical interfaces or logical interfaces.
  • the connection mode between two adjacent nodes may include the following connection modes:
  • connection link is formed between two adjacent nodes through at least one main interface, and the main interface does not have sub-interfaces, then the connection link can be a Layer 3 link, or It can be a Layer 2 link.
  • a main connection link is formed between two adjacent nodes through a main interface, and the main interface has at least two sub-interfaces, that is, there are at least two sub-connection links between two adjacent nodes ,
  • each sub-connection link is a layer 2 member link that constitutes the layer 3 bundle link.
  • At least two main connection links are formed between two adjacent nodes through at least two main interfaces, and the main interface has at least two sub-interfaces, that is, corresponding to each main connection link , There are at least two sub-connection links between two adjacent nodes.
  • the main connection link is a three-layer bundled link, it corresponds to each sub-connection link in each main connection link, which is The Layer 2 member link that constitutes the Layer 3 bundled link.
  • connection link when a connection link can be configured with an IP (Internet Protocol) address, support the sending and receiving of IP packets, and enable the IGP routing protocol, then the connection link can be called a three-layer chain Otherwise, the connection link is called a Layer 2 link; when the Layer 3 link is a bundled link, that is, when at least two Layer 2 links are bundled together to form a Layer 3 link, The layer 3 link is a layer 3 bundle link, and each layer 2 link forming the layer 3 bundle link is a layer 2 member link of the layer 3 bundle link.
  • IP Internet Protocol
  • each node shown in FIG. 1 does not constitute a limitation to the embodiment of the present disclosure, and may include more or less components than those shown in the figure, or combine certain components, or be different.
  • the layout of the components does not constitute a limitation to the embodiment of the present disclosure, and may include more or less components than those shown in the figure, or combine certain components, or be different. The layout of the components.
  • each node can respectively call its stored network slice creation program or message forwarding program, and the network controller can also call its stored network slice creation program or message forwarding program, both Cooperate with each other to execute the network slice creation method or the message forwarding method.
  • FIG. 3 is a flowchart of a network slice creation method provided by an embodiment of the present disclosure.
  • the network slice creation method includes but is not limited to the following steps:
  • each layer 2 member link in the layer 3 bundled link is configured with a TE affinity attribute, and the TE affinity attribute of each layer 2 member link is flooded through the IGP protocol.
  • the TE affinity attribute is a 32-bit (or more than 32-bit) vector and a 32-bit (or more than 32-bit) mask describing the link attributes required by the newly-built TE tunnel.
  • Each bit in the 32-bit vector represents an attribute, which can be used for path selection for a TE tunnel.
  • Affinity attributes to choose a suitable path to continue transmission to the destination node.
  • the method of selection is to compare the TE affinity attributes carried in the message with the link attributes configured on each TE-enabled link on the current node.
  • the path selected by matching is the path selected by the TE tunnel at the current node.
  • a link state database can be established and maintained in each node.
  • the link state database can contain the capability information of all nodes in the IGP protocol domain, the three-layer link information connecting these nodes, and The prefix information advertised by each node, etc., therefore, the TE affinity attribute of each layer 3 link in the IGP protocol domain will be stored in the corresponding layer 3 link information in the link state database.
  • each layer 2 member link in the layer 3 bundle link is configured with its unique TE affinity attribute, and the TE of each layer 2 member link is flooded through the IGP protocol
  • the affinity attribute can make the layer 3 bundled link information in the link state database of each node in the IGP protocol domain contain the specific TE affinity attribute of each layer 2 member link.
  • the TE affinity attribute of the layer 3 bundled link itself includes the TE affinity of all its layer 2 member links. Attributes. Take an illustrative example to illustrate. Assume that a three-layer bundle link contains three two-layer member links, and the TE affinity attributes of the three two-layer member links are configured as "red” and "green” respectively. , "Blue" three colors, then the TE affinity attribute of the three-layer bundled link has these three colors at the same time.
  • each layer 2 member link in the layer 3 bundled link is configured with a TE affinity attribute, and the TE affinity attribute of each layer 2 member link is flooded through the IGP protocol.
  • ISIS Intermediate System to Intermediate System
  • OSPF Open Shortest Path First
  • the TE affinity attributes can be configured by adding new fields in the ISIS protocol message, and the TE affinity attributes can be configured. Attribute ISIS protocol packets are flooded; when the OSPF protocol is extended to advertise the TE affinity attributes of each Layer 2 member link in the Layer 3 bundled link, the TE affinity attributes can be configured through the provisions of the existing protocol , And flood the OSPF protocol packets configured with TE affinity attributes.
  • step S120 the FA algorithm is used to create a network slice containing the layer 2 member link according to the TE affinity attribute of the layer 2 member link.
  • the FA algorithm is an algorithm applied to the IGP protocol.
  • a set of algorithm constraints can be defined as needed, and a forwarding path that satisfies the algorithm constraints can be generated based on the algorithm constraints.
  • These forwarding paths generate network slices dedicated to specific business traffic.
  • This embodiment can take advantage of the feature that the algorithm constraint conditions of the FA algorithm can be flexibly defined to define different algorithm constraint conditions for different network slices. For example, it needs to correspond to the TE affinity attribute of the layer 2 member link in this embodiment, so that Layer 2 member links that meet different algorithm constraints can form different network slices.
  • TE affinity attributes are generally configured only on Layer 3 links or Layer 3 bundled links, so that each node of the Layer 3 link with the same TE affinity attributes in the network can be divided into the same network slice, which can be realized Specific dedicated service traffic is forwarded, but the current network slicing method restricts each layer 3 link or layer 3 bundled link can only be applied to one network slice, that is, every second layer under the layer 3 bundled link
  • the layer member links all correspond to the same network slice, which affects the flexibility of network slice division between adjacent nodes, and cannot support the scenario where each layer 2 member link belongs to different network slices.
  • this embodiment adopts the above steps S100 and S200 to configure TE affinity attributes for each layer 2 member link in the layer 3 bundle link, and flood the TE of each layer 2 member link through the IGP protocol.
  • Affinity attribute so that each node in the current IGP protocol domain can save the layer-3 bundled link information of all nodes in the current IGP protocol domain, and the layer-3 bundled link information contains specific information about each layer-2 member link TE affinity attributes;
  • the FA algorithm is used to create network slices containing Layer 2 member links according to the TE affinity attributes of Layer 2 member links, so that different network slices can correspond to different Layer 2 member links, so that each Each network slice can have the TE affinity attribute of its corresponding Layer 2 member link, that is, Layer 2 member links with the same TE affinity attribute can form a network slice, which can support each of the Layer 3 bundled links.
  • Layer 2 member links belong to different network slice scenarios, which improves the flexibility of network slice division, so that traffic distinction and isolation between network slices can be realized.
  • a field indicating the TE affinity attribute of the layer 2 member link is set in the ISIS message.
  • the ISIS message is set to indicate the layer 2 member link.
  • the TE affinity attribute field enables the ISIS message to advertise the TE affinity attribute of the Layer 2 member link to each node during flooding, so that the link state database in each node can be stored corresponding to different Layer 2
  • the TE affinity properties of the member links Therefore, based on the Layer 2 member links with the same TE affinity attributes between different nodes, network slicing for different dedicated service traffic can be realized, so as to support each layer under the Layer 3 bundled link.
  • Layer 2 member links belong to different network slice scenarios, which improves the flexibility of network slice division, so that traffic distinction and isolation between network slices can be realized.
  • the ISIS message structure provided with a field indicating the TE affinity attribute of the layer 2 member link can refer to the message structure shown in FIG. 4.
  • the message structure shown in Figure 4 there are newly added multiple attribute fields representing the TE affinity attributes of different Layer 2 member links.
  • the explanation of each field is as follows:
  • Type occupies 1 byte, used to indicate that this field is set to indicate the TE affinity attribute of the layer 2 member link;
  • Lengh occupies 1 byte, which can indicate the number of Layer 2 member links
  • Flags 1 byte, identification field
  • Administrative group (color) of L2 Bundle Member 1 occupies 4 bytes, indicating the value of the TE affinity attribute of the first layer 2 member link;
  • Administrative group (color) of L2 Bundle Member 2 occupies 4 bytes, indicating the value of the TE affinity attribute of the second Layer 2 member link;
  • Administrative group (color) of L2 Bundle Member N occupies 4 bytes, indicating the value of the TE affinity attribute of the Nth Layer 2 member link.
  • each network slice corresponds to a link resource selection rule, and the link resource selection rule is used to select a Layer 2 member link with a corresponding TE affinity attribute.
  • each network slice can correspond to a link resource selection rule.
  • Resource selection rules are used to select Layer 2 member links with corresponding TE affinity attributes. Therefore, you only need to configure TE affinity attributes for each Layer 2 member link, and flood each Layer 2 member link through the IGP protocol.
  • the TE affinity attribute can make the corresponding Layer 2 member links form a network slice based on the same TE affinity attribute.
  • a Layer 3 bundle link contains multiple Layer 2 member links, and each Layer 2 member The TE affinity properties of the links are not the same, so a three-layer bundle link can be divided into multiple different network slices, which can support that each layer-2 member link under the three-layer bundle link belongs to different network slices. Therefore, the flexibility of network slice division can be improved, and the traffic separation and isolation between network slices can be realized.
  • FIG. 5 is a flowchart of a message forwarding method provided by an embodiment of the present disclosure.
  • the message forwarding method includes but is not limited to the following steps:
  • Step S210 Configure TE affinity attributes for each layer 2 member link in the layer 3 bundle link, and flood the TE affinity attributes of each layer 2 member link through the IGP protocol;
  • Step S220 according to the TE affinity attribute of the layer 2 member link, use the FA algorithm to create a network slice containing the layer 2 member link;
  • Step S230 Establish a forwarding path to the destination node according to the network slice, and forward the message based on the forwarding path.
  • Both the message forwarding method in this embodiment and the network slice creation method in the foregoing embodiment can be applied to the network topology in the embodiment shown in FIG. 1.
  • the message forwarding method in this embodiment may be a further application based on the network slice creation method in the above embodiment.
  • the message forwarding method in this embodiment is based on the network slice creation method in the above embodiment.
  • the forwarding path to the destination node can be established according to the network slice, and can be based on The forwarding path forwards the packet.
  • this embodiment adopts the above steps S210, S220, and S230 to configure TE affinity attributes for each layer 2 member link in the layer 3 bundle link, and flood each layer 2 member chain through the IGP protocol.
  • the TE affinity attribute of the road allows each node in the current IGP protocol domain to store the Layer 3 binding link information of all nodes in the current IGP protocol domain, and the Layer 3 binding link information contains specific Layer 2 members.
  • the TE affinity attribute of the link in addition, the FA algorithm is used to create a network slice containing the layer 2 member link according to the TE affinity attribute of the layer 2 member link, so that different network slices can correspond to different layer 2 member links , So that each network slice can have the TE affinity attribute of its corresponding Layer 2 member link, that is, Layer 2 member links with the same TE affinity attribute can form a network slice, so as to support the Layer 3 bundled chain
  • Each layer 2 member link under the road belongs to different network slice scenarios, which improves the flexibility of network slice division; in addition, the forwarding path to the destination node is established according to the network slice, and packets are forwarded based on the forwarding path.
  • the specific layer-2 member link can be designated as the forwarding outgoing interface according to the TE affinity attribute of the layer-2 member link that constitutes the network slice, which can not only realize the inter-network slice Traffic differentiation and isolation can also determine the specific path for service packets to be forwarded in the Layer 2 member link, which can facilitate the analysis and management of service packets in different network slices.
  • step S230 includes but is not limited to the following steps:
  • Step S231 Establish a shortest path tree to the destination node according to the network slice;
  • Step S232 establishing a routing and forwarding entry containing the link information of the layer 2 member link according to the layer 2 member link included in the network slice;
  • Step S233 forward the message according to the shortest path tree and routing and forwarding entries.
  • each node in the network slice uses itself as the root node to create the shortest path tree in the network slice , According to the shortest path tree corresponding to different root nodes, the nodes in the network slice can obtain their paths to other destination nodes; according to the TE affinity attribute of the layer 2 member link corresponding to the network slice, each node can be identified
  • the message forwarding method further includes the following steps:
  • Step S240 For the same destination node, different segment identifiers are allocated in different network slices;
  • step S250 different label forwarding entries are established according to different segment identifiers, and the message is forwarded based on the label forwarding entries, where the label forwarding entries include link information of the layer 2 member link.
  • different network slices can be assigned different segment identifiers to distinguish different network slices. Then, according to different network slices Segment identifiers create different label forwarding entries.
  • the label forwarding entries contain link information of Layer 2 member links. Therefore, when packet forwarding is required, packets can be forwarded based on different label forwarding entries. It can realize traffic differentiation and isolation between network slices.
  • a field indicating the TE affinity attribute of the layer 2 member link is set in the ISIS message.
  • the ISIS message can be The text sets the field representing the TE affinity attribute of the layer 2 member link. Therefore, when the ISIS message is flooded, the TE affinity attribute of the layer 2 member link can be notified to each node, so that the chain in each node
  • the road state database can store TE affinity attributes corresponding to different Layer 2 member links. Therefore, different nodes can realize network slicing for different dedicated service traffic based on Layer 2 member links with the same TE affinity attributes. In this way, it is possible to support the scenario where each layer 2 member link under the layer 3 bundle link belongs to different network slices, which improves the flexibility of network slice division, thereby realizing traffic differentiation and isolation between network slices.
  • each network slice corresponds to a link resource selection rule, and the link resource selection rule is used to select a Layer 2 member link with a corresponding TE affinity attribute.
  • each network slice can correspond to a link resource selection rule.
  • Resource selection rules are used to select Layer 2 member links with corresponding TE affinity attributes. Therefore, you only need to configure TE affinity attributes for each Layer 2 member link, and flood each Layer 2 member link through the IGP protocol.
  • the TE affinity attribute can make the corresponding Layer 2 member links form a network slice based on the same TE affinity attribute.
  • a Layer 3 bundle link contains multiple Layer 2 member links, and each Layer 2 member The TE affinity properties of the links are not the same, so a three-layer bundle link can be divided into multiple different network slices, which can support that each layer-2 member link under the three-layer bundle link belongs to different network slices. Therefore, the flexibility of network slice division can be improved. Moreover, since each network slice selects the layer 2 member link with the corresponding TE affinity attribute according to the link resource selection rule, when the services in different network slices When packets are being forwarded, a specific Layer 2 member link can be designated as the forwarding outbound interface according to the TE affinity attribute, so that traffic differentiation and isolation between network slices can be realized.
  • Figure 8 is a schematic diagram of a network topology in which all network slices are homogeneous networks.
  • a homogeneous network means that the virtual network topology corresponding to each network slice is the same, that is, all network slices share the bottom layer synchronously. The resources in each node and each link resource in the physical network.
  • the first node 110, the second node 120, and the third node 130 are connected in sequence, and the first node 110, the second node 120, and the third node 130 form an IGP protocol domain. (Such as the ISIS protocol domain).
  • a first flexible Ethernet link 201, a second flexible Ethernet link 202, and a third flexible Ethernet link are arranged in parallel between the first node 110 and the second node 120.
  • a fourth flexible Ethernet link 204, a fifth flexible Ethernet link 205, and a sixth flexible Ethernet link 206 are arranged in parallel between the second node 120 and the third node 130.
  • first flexible Ethernet link 201 belongs to the first three-layer bundled link 310 as a two-layer member link, and configures specific configurations for the first flexible Ethernet link 201, the second flexible Ethernet link 202, and the third flexible Ethernet link 203 respectively.
  • the TE affinity attribute for example, the TE affinity attribute of the first flexible Ethernet link 201 is configured as "red”, the TE affinity attribute of the second flexible Ethernet link 202 is configured as "blue", and the third flexible Ethernet link
  • the TE affinity attribute of the road 203 is configured as "green”.
  • a second layer three bundle link 320 is created between the second node 120 and the third node 130, and the fourth flexible Ethernet link 204, the fifth flexible Ethernet link 205, and the sixth flexible Ethernet link are combined.
  • the road 206 belongs to the second and third layer bundle link 320 as a two-layer member link, and configures specific configurations for the fourth flexible Ethernet link 204, the fifth flexible Ethernet link 205, and the sixth flexible Ethernet link 206 respectively.
  • the TE affinity attribute of the fourth flexible Ethernet link 204 is configured as "red”
  • the TE affinity attribute of the fifth flexible Ethernet link 205 is configured as "blue”
  • the sixth flexible Ethernet The TE affinity attribute of the link 206 is configured as "green”.
  • the first node 110, the second node 120, and the third node 130 respectively flood the link state data through the IGP protocol, that is, the first node 110, the second node 120, and the third node 130 respectively correspond to the first and third layers.
  • Bundled link 310, second layer three bundled link 320, first flexible Ethernet link 201, second flexible Ethernet link 202, third flexible Ethernet link 203, fourth flexible Ethernet link 204, The link state data of the fifth flexible Ethernet link 205 and the sixth flexible Ethernet link 206 are flooded.
  • first node 110, the second node 120, and the third node 130 will all maintain a consistent link state database, which records the TE affinity attribute of each link, for example, the link state
  • the TE affinity attributes of the first three-layer bundled link 310 and the second three-layer bundled link 320 recorded in the database include “red”, “blue”, and “green”.
  • the TE affinity attributes of the flexible Ethernet link 201 and the fourth flexible Ethernet link 204 are both "red”
  • the second flexible Ethernet link 202 and the fifth flexible Ethernet link 205 are recorded in the link state database
  • the TE affinity attributes of both are "blue”
  • the TE affinity attributes of the third flexible Ethernet link 203 and the sixth flexible Ethernet link 206 recorded in the link state database are both "green".
  • the FA algorithm is used to create a network slice corresponding to the layer 2 member link, for example, the enablement is configured on the first node 110, the second node 120, and the third node 130, respectively.
  • FA-id 128, FA-id 129, and FA-id 130 to create the first network slice, the second network slice, and the third network slice.
  • the first network slice contains the first flexible TE affinity attribute of "red".
  • the link resources of the Ethernet link 201 and the fourth flexible Ethernet link 204, the second network slice contains the second flexible Ethernet link 202 and the fifth flexible Ethernet link 205 whose TE affinity attribute is "blue" Link resources, the third network slice includes link resources of the third flexible Ethernet link 203 and the sixth flexible Ethernet link 206 whose TE affinity attribute is "green".
  • the first network slice includes the first node 110, the second node 120, the third node 130, the first flexible Ethernet link 201, and the fourth flexible Ethernet link 204, and the second network slice includes the first node.
  • the node 110, the second node 120, the third node 130, the second flexible Ethernet link 202, and the fifth flexible Ethernet link 205, the third network slice includes the first node 110, the second node 120, and the third node 130.
  • the first node 110, the second node 120, and the third node 130 will all use themselves as the root node to establish a routing and forwarding entry with the destination node, so as to realize packet forwarding.
  • the third node 130 is the destination node of the first node 110
  • the first node 110 will use itself as the root node to establish a forwarding path and a routing forwarding entry with the third node 130, and in the routing forwarding entry Configure the first three-layer bundle link 310 as the forwarding outbound interface in, and select the first flexible Ethernet link 201 as the actual forwarding outbound interface, so as to realize packet forwarding.
  • the message forwarding in the second network slice and the third network slice is similar to the above-mentioned message forwarding process in the first network slice. In order to avoid redundancy, details are not described herein again.
  • the use of network slices with TE affinity attributes for message forwarding can not only designate a specific layer 2 member link as the forwarding outgoing interface during the message forwarding process, but also realize the traffic differentiation and separation between network slices. isolation.
  • Figure 9 is a schematic diagram of a network topology in which network slices are heterogeneous networks.
  • a heterogeneous network means that the virtual network topology diagrams corresponding to each network slice are not the same, that is, some network resources are only shared by some network slices. Another part of the network resources are shared by another part of the network slice.
  • first node 110 In the network topology shown in FIG. 9, there are a first node 110, a second node 120, a third node 130, and a fourth node 140 that are connected in sequence, and the first node 110, the second node 120, and the third node 130 are connected in sequence. It forms an IGP protocol domain (such as the ISIS protocol domain) with the fourth node 140.
  • IGP protocol domain such as the ISIS protocol domain
  • a first flexible Ethernet link 201, a second node 120 and a third node 130 are provided between the first node 110 and the second node 120.
  • a second flexible Ethernet link 202 is provided between the first node 110 and the fourth node 140, a third flexible Ethernet link 203 is provided between the fourth node 140 and the third node 130, and a fourth node is provided between the fourth node 140 and the third node 130.
  • the first three-layer bundle can be created correspondingly Link 310 and the second three-layer bundle link 320, where the first flexible Ethernet link 201 is a layer two member link of the first three-layer bundle link 310, and the second flexible Ethernet link 202 is the second The two-layer member link of the three-layer bundle link 320; since the link bandwidth resources between the first node 110 and the fourth node 140, and the link between the fourth node 140 and the third node 130 are limited, no correspondence is created The three-layer bundled link.
  • the specific steps are as follows:
  • first flexible Ethernet link 201 is created between the first node 110 and the second node 120, and regard the first flexible Ethernet link 201 as a two-layer member link to the first three-layer bundling link 310.
  • a specific TE affinity attribute is configured for the first flexible Ethernet link 201.
  • the TE affinity attribute of the first flexible Ethernet link 201 is configured as "red”.
  • a second layer three bundle link 320 is created between the second node 120 and the third node 130, and the second flexible Ethernet link 202 is used as a layer two member link to belong to the second layer three bundle link 320 , And configure a specific TE affinity attribute for the second flexible Ethernet link 202, for example, the TE affinity attribute of the second flexible Ethernet link 202 is configured as "red”.
  • the third flexible Ethernet link 203 and the fourth flexible Ethernet link 204 are configured with specific TE affinity attributes, for example, the third flexible Ethernet link 203 and the fourth flexible Ethernet link 204 are respectively configured with specific TE affinity attributes.
  • the TE affinity attribute is configured as "blue”.
  • the third flexible Ethernet link 203 and the fourth flexible Ethernet link 204 are configured with an IP address, and the IP address is added to the configured ISIS protocol message.
  • the first node 110, the second node 120, the third node 130, and the fourth node 140 respectively flood the link state data through the IGP protocol, that is, the first node 110, the second node 120, the third node 130, and the fourth node.
  • the node 140 corresponds to the first three-layer bundle link 310, the second three-layer bundle link 320, the first flexible Ethernet link 201, the second flexible Ethernet link 202, and the third flexible Ethernet link 203 respectively.
  • the link state data of the fourth flexible Ethernet link 204 are flooded.
  • first node 110, the second node 120, the third node 130, and the fourth node 140 will all maintain a consistent link state database, which records the TE affinity attributes of each link, such as ,
  • the TE affinity attributes of the first three-layer bundled link 310 and the second three-layer bundled link 320 recorded in the link state database are both "red", and the first flexible Ethernet link recorded in the link state database
  • the TE affinity attributes of the second flexible Ethernet link 201 and the second flexible Ethernet link 202 are both "red"
  • the TE affinity attributes of the third flexible Ethernet link 203 and the fourth flexible Ethernet link 204 recorded in the link state database All are "blue”.
  • the FA algorithm is used to create a network slice corresponding to the layer 2 member link, for example, the enablement is configured on the first node 110, the second node 120, and the third node 130, respectively.
  • FA-id 128, configure and enable FA-id 129 on the first node 110, the fourth node 140, and the third node 130 to create the first network slice and the second network slice, where the first network slice includes TE Link resources of the first flexible Ethernet link 201 and the second flexible Ethernet link 202 with the affinity attribute of "red", and the second network slice contains the third flexible Ethernet link 203 with the TE affinity attribute of "blue” And the link resource of the fourth flexible Ethernet link 204.
  • the first network slice includes the first node 110, the second node 120, the third node 130, the first flexible Ethernet link 201 and the second flexible Ethernet link 202, and the second network slice includes the first node.
  • the first node 110, the second node 120, and the third node 130 will all use themselves as the root node to establish a routing and forwarding entry with the destination node, so as to realize packet forwarding.
  • the third node 130 is the destination node of the first node 110
  • the first node 110 will use itself as the root node to establish a forwarding path and a routing forwarding entry with the third node 130, and in the routing forwarding entry Configure the first three-layer bundle link 310 as the forwarding outbound interface in, and select the first flexible Ethernet link 201 as the actual forwarding outbound interface, so as to realize packet forwarding.
  • the message forwarding in the second network slice is similar to the above-mentioned message forwarding process in the first network slice. In order to avoid redundancy, details are not described herein again.
  • the use of network slices with TE affinity attributes for message forwarding can not only designate a specific layer 2 member link as the forwarding outgoing interface during the message forwarding process, but also realize the traffic differentiation and separation between network slices. isolation.
  • an embodiment of the present disclosure provides a network slice creation device, which includes a memory, a processor, and a computer program that is stored in the memory and can run on the processor.
  • the processor and the memory can be connected by a bus or in other ways.
  • the network slice creation apparatus in this embodiment can be applied to different nodes or network controllers in the embodiment shown in FIG. 1, including the nodes or network controllers of the network slice creation apparatus in this embodiment.
  • the device can form a part of the network topology in the embodiment shown in FIG. 1, and both belong to the same inventive concept. Therefore, the two have the same implementation principle and beneficial effects, and will not be described in detail here.
  • the non-transitory software programs and instructions required to implement the network slice creation method of the above embodiment are stored in the memory.
  • the network slice creation method of the above embodiment is executed, for example, the network slice creation method of the above embodiment is executed.
  • the message forwarding device includes a memory, a processor, and a computer program stored in the memory and running on the processor.
  • the processor and the memory can be connected by a bus or in other ways.
  • the message forwarding apparatus in this embodiment can be applied to different nodes in the embodiment shown in FIG. 1, including nodes that include the message forwarding apparatus in this embodiment, which can form the message forwarding apparatus shown in FIG.
  • the two belong to the same inventive concept, so the two have the same implementation principle and beneficial effects, and will not be described in detail here.
  • the non-transitory software programs and instructions required to implement the message forwarding method of the above embodiment are stored in the memory.
  • the message forwarding method of the above embodiment is executed, for example, the above-described message forwarding method in FIG. 5 is executed.
  • the device embodiments described above are merely illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules can be selected according to actual needs to achieve the objectives of the solutions of the embodiments.
  • an embodiment of the present disclosure also provides a computer-readable storage medium, the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are executed by a processor or a controller, for example, by the aforementioned
  • the execution of a processor in the embodiment of the apparatus for creating a network slice can make the above-mentioned processor execute the method for creating a network slice in the above-mentioned embodiment, for example, execute the above-described method steps S110 to S120 in FIG. 3.
  • being executed by a processor in the foregoing embodiment of the message forwarding apparatus may cause the foregoing processor to execute the message forwarding method in the foregoing embodiment, for example, performing the method steps S210 to S230, and S230 in FIG. 5 described above.
  • computer storage medium includes volatile and non-volatile data implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data).
  • Information such as computer-readable instructions, data structures, program modules, or other data.
  • Computer storage media include but are not limited to RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or Any other medium used to store desired information and that can be accessed by a computer.
  • communication media usually contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as carrier waves or other transmission mechanisms, and may include any information delivery media. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本公开提供了一种网络切片创建方法、报文转发方法及其装置。其中，所述网络切片创建方法包括：对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，接着根据二层成员链路的TE亲和力属性，利用FA算法创建包含二层成员链路的网络切片。本公开实施例中，根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，可以使具有相同的TE亲和力属性的二层成员链路构成一个网络切片，从而能够支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提高网络切片划分的灵活性。

Description

网络切片创建方法、报文转发方法及其装置 技术领域
本公开实施例涉及但不限于通信技术领域，尤其涉及一种网络切片创建方法、报文转发方法及其装置。
背景技术
5G网络切片(slice)对承载网的核心需求，就是不同的网络切片需要有其专属的承载子网络，不同的专属承载子网络之间可以是严格的资源硬隔离，也可以是达到近似硬隔离效果的软隔离。由于分组网络并不能支持硬隔离，为了支持5G网络切片的需求，分组网络需要在底层网络资源上做切片划分，以满足不同的上层业务的需求。现有的方式是采用内部网关协议(Interior Gateway Protocol，IGP)灵活算法(Flex Algorithm，FA)技术，在同一拓扑内运行多种IGP算法而计算得到多种FA平面，每个FA平面可表示一张网络切片，可将不同的上层业务流量承载在不同的FA平面上。
为了更简单和灵活的支持网络切片的创建和删除，使得切片业务对承载网络的影响最小，目前采用的方法是在IGP协议域内两相邻节点之间建立一条三层捆绑链路，该三层捆绑链路中包含至少两条专属于特定网络切片的二层成员链路，通过在转发报文中携带特定二层成员链路对应的邻接段标识，即可引导报文向该二层成员链路转发。然而，由于目前的网络切片方法限制了每一个三层捆绑链路仅能应用于一个网络切片，即三层捆绑链路下的每一个二层成员链路都是对应于同一个网络切片，从而影响了相邻节点间网络切片划分的灵活性，无法支持各个二层成员链路分别属于不同的网络切片的场景。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
第一方面，本公开实施例提供了一种网络切片创建方法、报文转发方法及其装置，能够支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，从而可以提高网络切片划分的灵活性。
第二方面，本公开实施例提供了一种网络切片创建方法，包括：对三层捆绑链路中的各个二层成员链路分别配置流量工程(Traffic Engineering，TE)亲和力属性，并通过IGP协议泛洪各个所述二层成员链路的TE亲和力属性；根据所述二层成员链路的TE亲和力属性，利用FA算法创建包含所述二层成员链路的网络切片。
第三方面，本公开实施例还提供了一种报文转发方法，包括：对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个所述二层成员链路的TE亲和力属性；根据所述二层成员链路的TE亲和力属性，利用FA算法创建包含所述二层成员链路的网络切片；根据所述网络切片建立至目的节点的转发路径，并基于所述转发路径转发报文。
第四方面，本公开实施例还提供了一种网络切片创建装置，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如上所述第二方面的网络切片创建方法。
第五方面，本公开实施例还提供了一种报文转发装置，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如上所述第三方面的报文转发方法。
第六方面，本公开实施例还提供一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行如上所述的网络切片创建方法或用于执行如上所述的报文转发方法。
本公开实施例包括：对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，接着根据二层成员链路的TE亲和力属性，利用FA算法创建包含二层成员链路的网络切片。根据本公开实施例提供的方案，通过对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，可以使得当前IGP协议域内的每个节点均保存有当前IGP协议域内所有节点的三层捆绑链路信息，并且该三层捆绑链路信息中包含有具体的各个二层成员链路的TE亲和力属性；由于根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，因此可以使得不同的网络切片与不同的二层成员链路相对应，使得每个网络切片都可以具有与其对应的二层成员链路的TE亲和力属性，即，具有相同的TE亲和力属性的二层成员链路可以构成一个网络切片，从而能够支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提高网络切片划分的灵活性，从而可以实现网络切片间的流量区分与隔离。
本公开的其它特征和优点将在随后的说明书中阐述，并且，部分地从说明书中变得显而易见，或者通过实施本公开而了解。本公开的目的和其他优点可通过在说明书、权利要求书以及附图中所特别指出的结构来实现和获得。
附图说明
附图用来提供对本公开技术方案的进一步理解，并且构成说明书的一部分，与本公开的实施例一起用于解释本公开的技术方案，并不构成对本公开技术方案的限制。
图1是本公开一个实施例提供的用于执行网络切片创建方法或者用于执行报文转发方法的网络拓扑的示意图；
图2A是图1所示网络拓扑中相邻两个节点之间的链路结构的一个实施例的示意图；
图2B是图1所示网络拓扑中相邻两个节点之间的链路结构的另一实施例的示意图；
图2C是图1所示网络拓扑中相邻两个节点之间的链路结构的另一实施例的示意图；
图3是本公开一个实施例提供的网络切片创建方法的流程图；
图4是本公开一个实施例提供的用于表示TE亲和力属性的字段的报文结构的示意图；
图5是本公开一个实施例提供的报文转发方法的流程图；
图6是本公开另一实施例提供的报文转发方法的流程图；
图7是本公开另一实施例提供的报文转发方法的流程图；
图8是本公开一个实施例提供的用于执行报文转发方法的网络拓扑的示意图；
图9是本公开另一实施例提供的用于执行报文转发方法的网络拓扑的示意图。
具体实施方式
为了使本公开的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本公开进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本公开，并不用于限定本公开。
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本公开提供了一种网络切片创建方法、报文转发方法及其装置，通过对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，使得当前IGP协议域 内的每个节点均可以保存有当前IGP协议域内所有节点的三层捆绑链路信息，并且该三层捆绑链路信息中包含有具体的各个二层成员链路的TE亲和力属性；另外，根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，使得不同的网络切片可以与不同的二层成员链路相对应，使得每个网络切片都可以具有与其对应的二层成员链路的TE亲和力属性，即，具有相同的TE亲和力属性的二层成员链路可以构成一个网络切片，从而能够支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提高网络切片划分的灵活性；此外，当不同网络切片中的业务报文在进行转发时，根据TE亲和力属性即可指定具体的二层成员链路作为转发出接口，从而可以实现网络切片间的流量区分与隔离。
下面结合附图，对本公开实施例作进一步阐述。
如图1所示，图1是本公开一个实施例提供的可以用于执行网络切片创建方法或者用于执行报文转发方法的网络拓扑的示意图。在图1的示例中，该网络拓扑包括第一节点110、第二节点120、第三节点130和第四节点140，其中，第一节点110、第二节点120和第三节点130依次连接，第四节点140分别连接于第一节点110和第三节点130。第一节点110、第二节点120、第三节点130和第四节点140可以是路由器或者交换机等网络设备，能够对报文进行转发。另外，该网络拓扑中还可以包括有网络控制器(图1中未示出)，例如软件定义网络(Software Defined Network，SDN)控制器等，该网络控制器分别与第一节点110、第二节点120、第三节点130和第四节点140连接，能够分别对第一节点110、第二节点120、第三节点130和第四节点140进行控制。
第一节点110、第二节点120、第三节点130、第四节点140和网络控制器，分别包括有存储器和处理器，其中，存储器和处理器可以通过总线或者其他方式连接。
存储器作为一种非暂态计算机可读存储介质，可设置为存储非暂态软 件程序以及非暂态性计算机可执行程序。此外，存储器可以包括高速随机存取存储器，还可以包括非暂态存储器，例如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。在一些实施方式中，存储器可选包括相对于处理器远程设置的存储器，这些远程存储器可以通过网络连接至该处理器。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
第一节点110、第二节点120、第三节点130和第四节点140均可以具有一个或多个用于转发报文的主接口，每个节点均通过该主接口和邻节点进行连接。在一些实施例中，该主接口可以包括多个子接口，该子接口可以是物理接口，也可以是逻辑接口，对应地，主接口也可以是物理接口或逻辑接口。根据上述结构描述，相邻两个节点之间的连接方式，可以包括有如下连接方式：
1、如图2A所示，相邻两个节点之间通过至少一个主接口形成至少一个连接链路，并且该主接口不具有子接口，那么，该连接链路可以为三层链路，也可以为二层链路。
2、如图2B所示，相邻两个节点之间通过一个主接口形成主连接链路，并且该主接口具有至少两个子接口，即相邻两个节点之间具有至少两个子连接链路，当该主连接链路为三层捆绑链路时，每一个子连接链路均为构成该三层捆绑链路的二层成员链路。
3、如图2C所示，相邻两个节点之间通过至少两个主接口形成至少两个主连接链路，并且该主接口具有至少两个子接口，即，对应于每一个主连接链路，相邻两个节点之间都具有至少两个子连接链路，当该主连接链路为三层捆绑链路时，对应于每一个主连接链路中的每一个子连接链路，均为构成该三层捆绑链路的二层成员链路。
值得注意的是，当一个连接链路中可以配置IP(Internet Protocol，网际互连协议)地址、支持IP报文的收发、使能IGP路由协议，那么该连接链路可被称为三层链路，否则，该连接链路被称为二层链路；当该三层 链路为捆绑链路的情况下，即至少两个二层链路捆绑在一起形成三层链路的情况下，该三层链路为三层捆绑链路，而形成该三层捆绑链路的每一个二层链路均为该三层捆绑链路的二层成员链路。
本公开实施例描述的网络拓扑以及应用场景是为了更加清楚的说明本公开实施例的技术方案，并不构成对于本公开实施例提供的技术方案的限定，本领域技术人员可知，随着网络拓扑的演变和新应用场景的出现，本公开实施例提供的技术方案对于类似的技术问题，同样适用。
本领域技术人员可以理解的是，图1中示出的各个节点的结构并不构成对本公开实施例的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
在图1所示的网络拓扑中，各个节点可以分别调用其储存的网络切片创建程序或者报文转发程序，而网络控制器也可以调用其储存的网络切片创建程序或者报文转发程序，两者相互配合以执行网络切片创建方法或者报文转发方法。
基于上述网络拓扑以及上述网络拓扑中各个节点和网络控制器的结构，提出本公开的网络切片创建方法的各个实施例以及报文转发方法的各个实施例。
如图3所示，图3是本公开一个实施例提供的网络切片创建方法的流程图，该网络切片创建方法包括但不限于以下步骤：
步骤S110，对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性。
本领域技术人员可以理解的是，TE亲和力属性是描述新建的TE隧道所需链路属性的32位(或32位以上)向量以及一个32位(或32位以上)的掩码。32位向量中的每一位代表一种属性，可以用于为TE隧道进行路径选择，具体地，当报文在网络中进行泛洪扩散时，每经过一个节点都要根据该TE隧道配置的亲和力属性而选择一条继续向目的节点传输的适合路径，选择的方法是把报文中携带的TE亲和力属性与当前节点上各条使 能了TE能力的链路上配置的链路属性进行比较，通过匹配选择的即作为该TE隧道在当前节点所选择的路径。
在一实施例中，可以在每个节点中建立并维护一个链路状态数据库，该链路状态数据库中可以包含有本IGP协议域内所有节点的能力信息、连接这些节点的三层链路信息以及由各节点通告的前缀信息等，因此，本IGP协议域内的每一个三层链路的TE亲和力属性都会被保存在该链路状态数据库中对应的三层链路信息中，特别地，当三层链路为三层捆绑链路时，通过对该三层捆绑链路中的各个二层成员链路分别配置其特有的TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，可以使得在本IGP协议域内的各个节点中的链路状态数据库中的三层捆绑链路信息中，均包含有具体的各个二层成员链路的TE亲和力属性。
在一实施例中，当为三层捆绑链路中的各个二层成员链路配置TE亲和力属性后，该三层捆绑链路自身的TE亲和力属性包括其所有的二层成员链路的TE亲和力属性。以一个示例性的例子来说明，假设某个三层捆绑链路中包含有三个二层成员链路，这三个二层成员链路的TE亲和力属性分别被配置为“红”、“绿”、“蓝”三种颜色，则该三层捆绑链路的TE亲和力属性同时具有这三种颜色。
在一实施例中，对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，可以有不同的实施方式。例如，可以通过扩展中间系统到中间系统(Intermediate System to Intermediate System，ISIS)协议以通告三层捆绑链路中的各个二层成员链路的TE亲和力属性，或者可以通过扩展开放式最短路径优先(Open Shortest Path First，OSPF)协议以通告三层捆绑链路中的各个二层成员链路的TE亲和力属性，本实施例对此不作具体限定。当通过扩展ISIS协议以通告三层捆绑链路中的各个二层成员链路的TE亲和力属性时，可以在ISIS协议报文中通过新增字段的方式配置TE亲和力属性，并对配置了TE亲和力属性的ISIS协议报文进行泛洪扩散；当通过扩展OSPF协议以通告三层捆绑链路中的各个二层成员链路的TE亲和力 属性时，可以通过现有协议的规定进行TE亲和力属性的配置，并对配置了TE亲和力属性的OSPF协议报文进行泛洪扩散。
步骤S120，根据二层成员链路的TE亲和力属性，利用FA算法创建包含二层成员链路的网络切片。
本领域技术人员可以理解的是，FA算法是应用于IGP协议的一种算法，可以根据需要定义一组算法约束条件，并基于该算法约束条件生成满足该算法约束条件的转发路径，从而可以根据这些转发路径生成专属于特定业务流量的网络切片。本实施例可以利用FA算法的算法约束条件能够灵活定义的特点，为不同的网络切片定义不同的算法约束条件，例如需要和本实施例中的二层成员链路的TE亲和力属性相对应，使得满足不同算法约束条件的二层成员链路可以形成不同的网络切片。
当前，TE亲和力属性一般仅在三层链路或三层捆绑链路上进行配置，可以使得网络中具有相同TE亲和力属性的三层链路的各个节点被划分为同一个网络切片，从而可以实现特定的专属业务流量的转发，但是，当前的这种网络切片方法限制了每一个三层链路或三层捆绑链路仅能应用于一个网络切片，即三层捆绑链路下的每一个二层成员链路都是对应于同一个网络切片，从而影响了相邻节点间网络切片划分的灵活性，无法支持各个二层成员链路分别属于不同的网络切片的场景。针对这个问题，本实施例采用上述步骤S100和步骤S200，通过对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，使得当前IGP协议域内的每个节点均可以保存有当前IGP协议域内所有节点的三层捆绑链路信息，并且该三层捆绑链路信息中包含有具体的各个二层成员链路的TE亲和力属性；另外，根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，使得不同的网络切片可以与不同的二层成员链路相对应，使得每个网络切片都可以具有与其对应的二层成员链路的TE亲和力属性，即，具有相同的TE亲和力属性的二层成员链路可以构成一个网络切片，从而能够支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提 高网络切片划分的灵活性，从而可以实现网络切片间的流量区分与隔离。
如图4所示，在一实施例中，当IGP协议为ISIS协议，在ISIS报文中设置表示二层成员链路的TE亲和力属性的字段。
在一实施例中，在对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性后，当IGP协议为ISIS协议时，通过在ISIS报文中设置表示二层成员链路的TE亲和力属性的字段，可以使得ISIS报文在泛洪时能够把二层成员链路的TE亲和力属性向各个节点进行通告，使得各个节点中的链路状态数据库均可保存有对应于不同二层成员链路的TE亲和力属性，因此，不同节点之间根据具有相同TE亲和力属性的二层成员链路，即可实现针对不同专属业务流量的网络切片，从而可以支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提高网络切片划分的灵活性，从而可以实现网络切片间的流量区分与隔离。
下面以一个具体示例进行说明：
在一实施例中，设置有表示二层成员链路的TE亲和力属性的字段的ISIS报文结构，可以参照如图4所示的报文结构。在图4所示的报文结构中，新增有多个分别表示不同二层成员链路的TE亲和力属性的属性字段，在该报文结构中，各字段的解释如下：
Type：占1字节，用于表示本字段是设置有表示二层成员链路的TE亲和力属性的字段；
Lengh：占1字节，能够表示二层成员链路的个数；
Flags：占1字节，标识字段；
Reserved：占1字节，保留字段，待将来使用；
Administrative group(color)of L2 Bundle Member 1：占4个字节，表示第一个二层成员链路的TE亲和力属性取值；
Administrative group(color)of L2 Bundle Member 2：占4个字节，表示第二个二层成员链路的TE亲和力属性取值；
Administrative group(color)of L2 Bundle Member N：占4个字节，表示第N个二层成员链路的TE亲和力属性取值。
值得注意的是，现有ISIS协议中规定的L2 Bundle Member Attributes sub-TLV中，明确了需要给出包含的二层成员链路的数量，以及需要按序罗列各个二层成员链路的标识，因此，本实施例中新增的表示二层成员链路的TE亲和力属性的字段中，也需要按同样的顺序列明每一个二层成员链路的TE亲和力属性。
另外，在一实施例中，每个网络切片对应具有一个链路资源选择规则，该链路资源选择规则用于选择具有对应的TE亲和力属性的二层成员链路。
在本实施例中，由于根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，因此每个网络切片可以对应具有一个链路资源选择规则，该链路资源选择规则用于选择具有对应的TE亲和力属性的二层成员链路，所以，只需通过对各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，即可根据相同的TE亲和力属性而使对应的二层成员链路构成一个网络切片，由于一个三层捆绑链路中包含有多个二层成员链路，而且每个二层成员链路的TE亲和力属性都不相同，因此可以对一个三层捆绑链路划分能够多个不同的网络切片，从而可以支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，从而可以提高网络切片划分的灵活性，实现网络切片间的流量区分与隔离。
另外，如图5所示，图5是本公开一个实施例提供的报文转发方法的流程图，该报文转发方法包括但不限于以下步骤：
步骤S210，对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性；
步骤S220，根据二层成员链路的TE亲和力属性，利用FA算法创建包含二层成员链路的网络切片；
步骤S230，根据网络切片建立至目的节点的转发路径，并基于转发 路径转发报文。
本实施例中的报文转发方法和上述实施例中的网络切片创建方法，均可应用于如图1所示实施例中的网络拓扑。特别地，本实施例中的报文转发方法可以为基于上述实施例中的网络切片创建方法的进一步应用，本实施例中的报文转发方法在上述实施例中的网络切片创建方法的基础上，利用包含有对应的TE亲和力属性的二层成员链路的网络切片进行报文转发，不仅能够在报文转发的过程中指定具体的二层成员链路作为转发出接口，还能够实现网络切片间的流量区分与隔离。
下面仅针对本实施例中的报文转发方法和上述实施例中的网络切片创建方法之间的区别进行详细说明，而两者之间的相同内容，可以参照上述实施例中对网络切片创建方法的详细描述，因此此处不再赘述。
在一实施例中，当根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片后，可以根据网络切片建立至目的节点之间的转发路径，并可以基于该转发路径转发报文。
目前常用的FA技术无法支持各二层成员链路分别属于不同网络切片的场景。虽然目前的FA技术可定义一个网络切片所包含的三层链路(包括三层捆绑链路)资源，但无法更精确的识别三层捆绑链路中的哪个二层成员链路作为实际的转发出接口，这将导致多个网络切片在共享相同的三层捆绑链路时，无法进一步指定不同的二层成员链路承载不同的网络切片的流量，即无法做到网络切片间的流量区分与隔离。针对这个问题，本实施例采用上述步骤S210、步骤S220和步骤S230，通过对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，使得当前IGP协议域内的每个节点均可以保存有当前IGP协议域内所有节点的三层捆绑链路信息，并且该三层捆绑链路信息中包含有具体的各个二层成员链路的TE亲和力属性；另外，根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，使得不同的网络切片可以与不同的二层成员链路相对应， 从而使得每个网络切片都可以具有与其对应的二层成员链路的TE亲和力属性，即，具有相同的TE亲和力属性的二层成员链路可以构成一个网络切片，从而能够支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提高网络切片划分的灵活性；此外，根据网络切片建立至目的节点的转发路径，并基于该转发路径转发报文，可以在当网络切片中的业务报文在进行转发时，根据构成该网络切片的二层成员链路的TE亲和力属性即可指定具体的二层成员链路作为转发出接口，不仅可以实现网络切片间的流量区分与隔离，还可以确定业务报文在二层成员链路中进行转发的具体路径，从而可以便于对不同网络切片中的业务报文进行分析管理。
如图6所示，在一实施例中，步骤S230包括但不限于以下步骤：
步骤S231，根据网络切片建立至目的节点的最短路径树；
步骤S232，根据网络切片中包含的二层成员链路，建立包含有二层成员链路的链路信息的路由转发表项；
步骤S233，根据最短路径树和路由转发表项转发报文。
在一实施例中，当根据TE亲和力属性创建包含有对应的二层成员链路的网络切片后，网络切片内的每个节点均以自己作为根节点而创建在该网络切片内的最短路径树，根据对应于不同根节点的最短路径树，网络切片内的节点均可获得其至其它目的节点的路径；根据与网络切片对应的二层成员链路的TE亲和力属性，每一个节点均可识别出三层捆绑链路中的二层成员链路的网络切片归属，所以，由此建立的路由转发表项中，可以包括有对应于不同网络切片的具体的三层捆绑链路信息以及二层成员链路信息；当根据最短路径树和路由转发表项转发报文时，如果路由转发表项中指定的转发出接口为三层捆绑链路，那么，根据该三层捆绑链路下的二层成员链路的TE亲和力属性，以及包含有该二层成员链路的网络切片，可以选择具体的二层成员链路作为路由转发表项的实际转发出接口，不仅可以实现网络切片间的流量区分与隔离，还可以确定业务报文在二层成员 链路中进行转发的具体路径，从而可以便于对不同网络切片中的业务报文进行分析管理。
如图7所示，在一实施例中，该报文转发方法还包括以下步骤：
步骤S240，对于同一目的节点，不同的网络切片内分别分配有不同的段标识；
步骤S250，根据不同的段标识建立不同的标签转发表项，基于标签转发表项转发报文，其中，标签转发表项包含有二层成员链路的链路信息。
在一实施例中，针对当前节点与同一目的节点之间存在不同的网络切片的情况，可以对不同的网络切片分别分配不同的段标识，以对不同的网络切片进行区分，接着，根据不同的段标识建立不同的标签转发表项，该标签转发表项包含有二层成员链路的链路信息，因此，当需要进行报文转发时，可以基于不同的标签转发表项转发报文，从而可以实现网络切片间的流量区分与隔离。
另外，在一实施例中，当IGP协议为ISIS协议，在ISIS报文中设置表示二层成员链路的TE亲和力属性的字段。
在一实施例中，在对三层捆绑链路中的各个二层成员链路分别配置TE亲和力属性后，当IGP协议为ISIS协议时，参照图4所示的报文结构，可以在ISIS报文中设置表示二层成员链路的TE亲和力属性的字段，因此，当ISIS报文在泛洪时，能够把二层成员链路的TE亲和力属性向各个节点进行通告，使得各个节点中的链路状态数据库均可保存有对应于不同二层成员链路的TE亲和力属性，所以，不同节点之间根据具有相同TE亲和力属性的二层成员链路，即可实现针对不同专属业务流量的网络切片，从而可以支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，提高网络切片划分的灵活性，从而可以实现网络切片间的流量区分与隔离。
另外，在一实施例中，每个网络切片对应具有一个链路资源选择规则，该链路资源选择规则用于选择具有对应的TE亲和力属性的二层成员链路。
在本实施例中，由于根据二层成员链路的TE亲和力属性而利用FA算法创建包含二层成员链路的网络切片，因此每个网络切片可以对应具有一个链路资源选择规则，该链路资源选择规则用于选择具有对应的TE亲和力属性的二层成员链路，所以，只需通过对各个二层成员链路分别配置TE亲和力属性，并通过IGP协议泛洪各个二层成员链路的TE亲和力属性，即可根据相同的TE亲和力属性而使对应的二层成员链路构成一个网络切片，由于一个三层捆绑链路中包含有多个二层成员链路，而且每个二层成员链路的TE亲和力属性都不相同，因此可以对一个三层捆绑链路划分能够多个不同的网络切片，从而可以支持三层捆绑链路下的各个二层成员链路分别属于不同的网络切片的场景，从而可以提高网络切片划分的灵活性；而且，由于每个网络切片均根据链路资源选择规则选择具有对应的TE亲和力属性的二层成员链路，因此，当不同网络切片中的业务报文在进行转发时，根据TE亲和力属性即可指定具体的二层成员链路作为转发出接口，从而可以实现网络切片间的流量区分与隔离。
针对本公开实施例所提供的报文转发方法，下面以具体的示例进行详细的描述：
示例一：
如图8所示，图8为所有网络切片均为同构网络的网络拓扑的示意图，同构网络是指各网络切片对应的虚拟网络拓扑图是相同的，即所有网络切片均一起同步共享底层物理网络中每个节点内的资源以及每个链路资源。
在如图8所示的网络拓扑中，包括有依次连接的第一节点110、第二节点120和第三节点130，第一节点110、第二节点120和第三节点130组成一个IGP协议域(如ISIS协议域)，另外，第一节点110和第二节点120之间设置有并列布置的第一灵活以太网链路201、第二灵活以太网链路202和第三灵活以太网链路203，第二节点120和第三节点130之间设置有并列布置的第四灵活以太网链路204、第五灵活以太网链路205和第六灵活以太网链路206。基于如图8所示的网络拓扑执行报文转发方法时， 具体步骤过程如下：
首先，在第一节点110和第二节点120之间创建第一三层捆绑链路310，把第一灵活以太网链路201、第二灵活以太网链路202和第三灵活以太网链路203作为二层成员链路归属于第一三层捆绑链路310，并且分别为第一灵活以太网链路201、第二灵活以太网链路202和第三灵活以太网链路203配置特定的TE亲和力属性，例如，第一灵活以太网链路201的TE亲和力属性被配置为“红”，第二灵活以太网链路202的TE亲和力属性被配置为“蓝”，第三灵活以太网链路203的TE亲和力属性被配置为“绿”。类似的，在第二节点120和第三节点130之间创建第二三层捆绑链路320，把第四灵活以太网链路204、第五灵活以太网链路205和第六灵活以太网链路206作为二层成员链路归属于第二三层捆绑链路320，并且分别为第四灵活以太网链路204、第五灵活以太网链路205和第六灵活以太网链路206配置特定的TE亲和力属性，例如，第四灵活以太网链路204的TE亲和力属性被配置为“红”，第五灵活以太网链路205的TE亲和力属性被配置为“蓝”，第六灵活以太网链路206的TE亲和力属性被配置为“绿”。
接着，分别在第一节点110、第二节点120和第三节点130中配置ISIS协议报文，并且分别对第一三层捆绑链路310和第二三层捆绑链路320配置IP地址，将该IP地址加入到所配置的ISIS协议报文中。
然后，第一节点110、第二节点120和第三节点130分别通过IGP协议泛洪链路状态数据，即第一节点110、第二节点120和第三节点130分别对应地把第一三层捆绑链路310、第二三层捆绑链路320、第一灵活以太网链路201、第二灵活以太网链路202、第三灵活以太网链路203、第四灵活以太网链路204、第五灵活以太网链路205和第六灵活以太网链路206的链路状态数据进行泛洪。另外，第一节点110、第二节点120和第三节点130上均会维护有一致的链路状态数据库，该链路状态数据库记录有每条链路的TE亲和力属性，例如，该链路状态数据库中记录的第一三层捆绑链路310和第二三层捆绑链路320的TE亲和力属性均包括有“红”、“蓝”和“绿”，该链路状态数据库中记录的第一灵活以太网链路201和第四灵 活以太网链路204的TE亲和力属性均为“红”，该链路状态数据库中记录的第二灵活以太网链路202和第五灵活以太网链路205的TE亲和力属性均为“蓝”，该链路状态数据库中记录的第三灵活以太网链路203和第六灵活以太网链路206的TE亲和力属性均为“绿”。
接着，根据二层成员链路的TE亲和力属性，利用FA算法创建与二层成员链路对应的网络切片，例如，分别在第一节点110、第二节点120和第三节点130上配置使能FA-id 128、FA-id 129和FA-id 130，以创建第一网络切片、第二网络切片和第三网络切片，其中，第一网络切片包含TE亲和力属性为“红”的第一灵活以太网链路201和第四灵活以太网链路204的链路资源，第二网络切片包含TE亲和力属性为“蓝”的第二灵活以太网链路202和第五灵活以太网链路205的链路资源，第三网络切片包含TE亲和力属性为“绿”的第三灵活以太网链路203和第六灵活以太网链路206的链路资源。此时，第一网络切片包含有第一节点110、第二节点120、第三节点130、第一灵活以太网链路201和第四灵活以太网链路204，第二网络切片包含有第一节点110、第二节点120、第三节点130、第二灵活以太网链路202和第五灵活以太网链路205，第三网络切片包含有第一节点110、第二节点120、第三节点130、第三灵活以太网链路203和第六灵活以太网链路206。
然后，对于第一网络切片，第一节点110、第二节点120和第三节点130均会以自身作为根节点而建立与目的节点的路由转发表项，从而实现报文的转发。具体地，假设第三节点130为第一节点110的目的节点，那么第一节点110会以自身作为根节点而建立与第三节点130的转发路径和路由转发表项，并在路由转发表项中配置第一三层捆绑链路310为转发出接口，并且选择第一灵活以太网链路201作为实际转发出接口，从而实现报文的转发。对于第二网络切片和第三网络切片中的报文转发，和上述第一网络切片中的报文转发的过程类似，为了避免冗余，此处不再进行赘述。在本示例中，利用具有TE亲和力属性的网络切片进行报文转发，不仅能够在报文转发的过程中指定具体的二层成员链路作为转发出接口，还能够 实现网络切片间的流量区分与隔离。
示例二：
如图9所示，图9为网络切片为异构网络的网络拓扑的示意图，异构网络是指各网络切片对应的虚拟网络拓扑图不相同，即一部分网络资源仅被一部分网络切片共享，而另一部分网络资源则被另一部分网络切片共享。
在如图9所示的网络拓扑中，包括有依次连接的第一节点110、第二节点120、第三节点130和第四节点140，第一节点110、第二节点120、第三节点130和第四节点140组成一个IGP协议域(如ISIS协议域)，另外，第一节点110和第二节点120之间设置有第一灵活以太网链路201，第二节点120和第三节点130之间设置有第二灵活以太网链路202，第一节点110和第四节点140之间设置有第三灵活以太网链路203，第四节点140和第三节点130之间设置有第四灵活以太网链路204，为了便于以后在第一节点110和第二节点120之间以及在第二节点120和第三节点130之间均新增链路，可以对应地创建第一三层捆绑链路310和第二三层捆绑链路320，其中，第一灵活以太网链路201为第一三层捆绑链路310的二层成员链路，第二灵活以太网链路202为第二三层捆绑链路320的二层成员链路；由于第一节点110和第四节点140之间，以及第四节点140和第三节点130之间的链路带宽资源有限，因此并不创建对应的三层捆绑链路。基于如图9所示的网络拓扑执行报文转发方法时，具体步骤过程如下：
首先，在第一节点110和第二节点120之间创建第一三层捆绑链路310，把第一灵活以太网链路201作为二层成员链路归属于第一三层捆绑链路310，并且为第一灵活以太网链路201配置特定的TE亲和力属性，例如，第一灵活以太网链路201的TE亲和力属性被配置为“红”。类似的，在第二节点120和第三节点130之间创建第二三层捆绑链路320，把第二灵活以太网链路202作为二层成员链路归属于第二三层捆绑链路320，并且为第二灵活以太网链路202配置特定的TE亲和力属性，例如，第二灵活以太网链路202的TE亲和力属性被配置为“红”。另外，分别为第三灵活以 太网链路203和第四灵活以太网链路204配置特定的TE亲和力属性，例如，分别把第三灵活以太网链路203和第四灵活以太网链路204的TE亲和力属性配置为“蓝”。
接着，分别在第一节点110、第二节点120、第三节点130和第四节点140中配置ISIS协议报文，并且分别对第一三层捆绑链路310、第二三层捆绑链路320、第三灵活以太网链路203和第四灵活以太网链路204配置IP地址，将该IP地址加入到所配置的ISIS协议报文中。
然后，第一节点110、第二节点120、第三节点130和第四节点140分别通过IGP协议泛洪链路状态数据，即第一节点110、第二节点120、第三节点130和第四节点140分别对应地把第一三层捆绑链路310、第二三层捆绑链路320、第一灵活以太网链路201、第二灵活以太网链路202、第三灵活以太网链路203和第四灵活以太网链路204的链路状态数据进行泛洪。另外，第一节点110、第二节点120、第三节点130和第四节点140上均会维护有一致的链路状态数据库，该链路状态数据库记录有每条链路的TE亲和力属性，例如，该链路状态数据库中记录的第一三层捆绑链路310和第二三层捆绑链路320的TE亲和力属性均为“红”，该链路状态数据库中记录的第一灵活以太网链路201和第二灵活以太网链路202的TE亲和力属性均为“红”，该链路状态数据库中记录的第三灵活以太网链路203和第四灵活以太网链路204的TE亲和力属性均为“蓝”。
接着，根据二层成员链路的TE亲和力属性，利用FA算法创建与二层成员链路对应的网络切片，例如，分别在第一节点110、第二节点120和第三节点130上配置使能FA-id 128，分别在第一节点110、第四节点140和第三节点130上配置使能FA-id 129，以创建第一网络切片和第二网络切片，其中，第一网络切片包含TE亲和力属性为“红”的第一灵活以太网链路201和第二灵活以太网链路202的链路资源，第二网络切片包含TE亲和力属性为“蓝”的第三灵活以太网链路203和第四灵活以太网链路204的链路资源。此时，第一网络切片包含有第一节点110、第二节点120、第三节点130、第一灵活以太网链路201和第二灵活以太网链路202， 第二网络切片包含有第一节点110、第四节点140、第三节点130、第三灵活以太网链路203和第四灵活以太网链路204。
然后，对于第一网络切片，第一节点110、第二节点120和第三节点130均会以自身作为根节点而建立与目的节点的路由转发表项，从而实现报文的转发。具体地，假设第三节点130为第一节点110的目的节点，那么第一节点110会以自身作为根节点而建立与第三节点130的转发路径和路由转发表项，并在路由转发表项中配置第一三层捆绑链路310为转发出接口，并且选择第一灵活以太网链路201作为实际转发出接口，从而实现报文的转发。对于第二网络切片中的报文转发，和上述第一网络切片中的报文转发的过程类似，为了避免冗余，此处不再进行赘述。在本示例中，利用具有TE亲和力属性的网络切片进行报文转发，不仅能够在报文转发的过程中指定具体的二层成员链路作为转发出接口，还能够实现网络切片间的流量区分与隔离。
另外，本公开的一个实施例提供了一种网络切片创建装置，该网络切片创建装置包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序。
处理器和存储器可以通过总线或者其他方式连接。
需要说明的是，本实施例中的网络切片创建装置，可以应用于如图1所示实施例中的不同节点或者网络控制器，包括有本实施例中的网络切片创建装置的节点或者网络控制器，能够构成图1所示实施例中的网络拓扑的一部分，两者属于相同的发明构思，因此两者具有相同的实现原理以及有益效果，此处不再详述。
实现上述实施例的网络切片创建方法所需的非暂态软件程序以及指令存储在存储器中，当被处理器执行时，执行上述实施例的网络切片创建方法，例如，执行以上描述的图3中的方法步骤S110至S120。
此外，本公开的另一个实施例还提供了一种报文转发装置，该报文转发装置包括：存储器、处理器及存储在存储器上并可在处理器上运行的计 算机程序。
处理器和存储器可以通过总线或者其他方式连接。
需要说明的是，本实施例中的报文转发装置，可以应用于如图1所示实施例中的不同节点，包括有本实施例中的报文转发装置的节点，能够构成图1所示实施例中的网络拓扑的一部分，两者属于相同的发明构思，因此两者具有相同的实现原理以及有益效果，此处不再详述。
实现上述实施例的报文转发方法所需的非暂态软件程序以及指令存储在存储器中，当被处理器执行时，执行上述实施例的报文转发方法，例如，执行以上描述的图5中的方法步骤S210至S230、图6中的方法步骤S231至S233、图7中的方法步骤S240至S250。
以上所描述的装置实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
此外，本公开的一个实施例还提供了一种计算机可读存储介质，该计算机可读存储介质存储有计算机可执行指令，该计算机可执行指令被一个处理器或控制器执行，例如，被上述网络切片创建装置实施例中的一个处理器执行，可使得上述处理器执行上述实施例中的网络切片创建方法，例如，执行以上描述的图3中的方法步骤S110至S120。又如，被上述报文转发装置实施例中的一个处理器执行，可使得上述处理器执行上述实施例中的报文转发方法，例如，执行以上描述的图5中的方法步骤S210至S230、图6中的方法步骤S231至S233、图7中的方法步骤S240至S250。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介 质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
以上是对本公开的较佳实施进行了具体说明，但本公开并不局限于上述实施方式，熟悉本领域的技术人员在不违背本公开精神的前提下还可作出种种的等同变形或替换，这些等同的变形或替换均包含在本公开权利要求所限定的范围内。

Claims (10)

  1. 一种网络切片创建方法，包括，
    对三层捆绑链路中的各个二层成员链路分别配置流量工程TE亲和力属性，并通过内部网关协议IGP协议泛洪各个所述二层成员链路的TE亲和力属性；
    根据所述二层成员链路的TE亲和力属性，利用灵活算法FA算法创建包含所述二层成员链路的网络切片。
  2. 根据权利要求1所述的网络切片创建方法，其中，当所述IGP协议为中间系统到中间系统ISIS协议，在ISIS报文中设置表示所述二层成员链路的TE亲和力属性的字段。
  3. 根据权利要求1所述的网络切片创建方法，其中，每个所述网络切片对应具有一个链路资源选择规则，所述链路资源选择规则用于选择具有对应的TE亲和力属性的二层成员链路。
  4. 一种报文转发方法，包括，
    对三层捆绑链路中的各个二层成员链路分别配置流量工程TE亲和力属性，并通过内部网关协议IGP协议泛洪各个所述二层成员链路的TE亲和力属性；
    根据所述二层成员链路的TE亲和力属性，利用灵活算法FA算法创建包含所述二层成员链路的网络切片；
    根据所述网络切片建立至目的节点的转发路径，并基于所述转发路径转发报文。
  5. 根据权利要求4所述的报文转发方法，其中，所述根据所述网络切片建立至目的节点的转发路径，并基于所述转发路径转发报文，包括：
    根据所述网络切片建立至目的节点的最短路径树；
    根据所述网络切片中包含的所述二层成员链路，建立包含有所述二层成员链路的链路信息的路由转发表项；
    根据所述最短路径树和所述路由转发表项转发报文。
  6. 根据权利要求5所述的报文转发方法，其中，还包括：
    对于同一目的节点，不同的所述网络切片内分别分配有不同的段标识；
    根据不同的所述段标识建立不同的标签转发表项，基于所述标签转发表项转发报文，其中，所述标签转发表项包含有所述二层成员链路的链路信息。
  7. 根据权利要求4所述的网络切片创建方法，其中，每个所述网络切片对应具有一个链路资源选择规则，所述链路资源选择规则用于选择具有对应的TE亲和力属性的二层成员链路。
  8. 一种网络切片创建装置，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求1至3中任意一项所述的网络切片创建方法。
  9. 一种报文转发装置，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求4至7中任意一项所述的报文转发方法。
  10. 一种计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令用于执行权利要求1至3中任意一项所述的网络切片创建方法或用于执行权利要求4至7中任意一项所述的报文转发方法。
PCT/CN2020/122492 2019-12-25 2020-10-21 网络切片创建方法、报文转发方法及其装置 WO2021129085A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP20908342.7A EP4084407A4 (en) 2019-12-25 2020-10-21 METHOD AND APPARATUS FOR GENERATION OF NETWORK SLICES AND METHOD AND APPARATUS FOR MESSAGE FORWARDING
US17/786,339 US20230032778A1 (en) 2019-12-25 2020-12-21 Network slice creation method and apparatus, and packet forwarding method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911355517.1 2019-12-25
CN201911355517.1A CN113037527B (zh) 2019-12-25 2019-12-25 网络切片创建方法、报文转发方法及其装置

Publications (1)

Publication Number Publication Date
WO2021129085A1 true WO2021129085A1 (zh) 2021-07-01

Family

ID=76458288

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/122492 WO2021129085A1 (zh) 2019-12-25 2020-10-21 网络切片创建方法、报文转发方法及其装置

Country Status (4)

Country Link
US (1) US20230032778A1 (zh)
EP (1) EP4084407A4 (zh)
CN (1) CN113037527B (zh)
WO (1) WO2021129085A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109831382B (zh) * 2019-02-13 2020-08-14 华为技术有限公司 一种路径计算方法、装置及设备
CN113556784B (zh) * 2021-07-29 2023-05-26 新华三技术有限公司 网络切片实现方法、装置及电子设备
CN115051944B (zh) * 2022-07-15 2023-07-21 中国电信股份有限公司 端到端切片创建方法、装置、设备及存储介质
CN117768900A (zh) * 2022-09-15 2024-03-26 中兴通讯股份有限公司 网络切片的创建的方法、装置及网络侧设备

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101013995A (zh) * 2007-02-12 2007-08-08 华为技术有限公司 网络节点设备、网络系统及隧道建立方法
CN103780431A (zh) * 2014-01-27 2014-05-07 杭州华三通信技术有限公司 一种te隧道的管理方法和设备
US20160353422A1 (en) * 2015-06-01 2016-12-01 Huawei Technologies Co., Ltd. System and Method for Provision and Distribution of Spectrum Resources
US20190200209A1 (en) * 2017-12-22 2019-06-27 Lenovo (Singapore) Pte. Ltd. Network slice selection assistance information configuration
CN110233765A (zh) * 2019-06-23 2019-09-13 何梓菁 一种低时延网络切片方法和设备

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8942256B1 (en) * 2012-01-06 2015-01-27 Juniper Networks, Inc. Advertising with a layer three routing protocol constituent link attributes of a layer two bundle
CN109600768B (zh) * 2017-09-30 2022-06-07 华为技术有限公司 网络切片的管理方法、设备及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101013995A (zh) * 2007-02-12 2007-08-08 华为技术有限公司 网络节点设备、网络系统及隧道建立方法
CN103780431A (zh) * 2014-01-27 2014-05-07 杭州华三通信技术有限公司 一种te隧道的管理方法和设备
US20160353422A1 (en) * 2015-06-01 2016-12-01 Huawei Technologies Co., Ltd. System and Method for Provision and Distribution of Spectrum Resources
US20190200209A1 (en) * 2017-12-22 2019-06-27 Lenovo (Singapore) Pte. Ltd. Network slice selection assistance information configuration
CN110233765A (zh) * 2019-06-23 2019-09-13 何梓菁 一种低时延网络切片方法和设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4084407A4 *

Also Published As

Publication number Publication date
CN113037527B (zh) 2024-04-09
EP4084407A1 (en) 2022-11-02
US20230032778A1 (en) 2023-02-02
EP4084407A4 (en) 2023-01-18
CN113037527A (zh) 2021-06-25

Similar Documents

Publication Publication Date Title
EP3836490B1 (en) Vpn cross-domain implementation method, device, and border node
WO2021129085A1 (zh) 网络切片创建方法、报文转发方法及其装置
US11700198B2 (en) Transmission control method, node, network system and storage medium
CN109995634B (zh) 一种组播虚拟专用网络的承载方法和设备
WO2016066072A1 (zh) 实现nvo3网络与mpls网络之间通信的方法和装置
CN111385207B (zh) 一种业务数据的转发方法、网络设备及网络系统
CN108574639A (zh) Evpn报文处理方法、设备及系统
KR102653760B1 (ko) 네트워크 슬라이싱 구현 방법, 장치 및 컨트롤러
CN108574630A (zh) Evpn报文处理方法、设备及系统
WO2020186803A1 (zh) 一种故障保护方法、节点及存储介质
WO2021164402A1 (zh) 路由方法、路由装置及计算机可读存储介质
CN111935013B (zh) 流量转发控制方法及装置、流量转发方法及芯片、交换机
KR20070005654A (ko) 주소 기반 캐리어 네트워크의 구별 전달
US20100165884A1 (en) Ethernet Spanning Tree Provision
CN113132235B (zh) 基于虚电路的数据报文处理方法、转发表项的构建方法
WO2019205836A1 (zh) 一种数据报文转发的方法及装置
CN113904981B (zh) 一种路由信息处理方法、装置、电子设备和存储介质
WO2020244304A1 (zh) 路由信息发送的方法、路由选路的方法和装置
CN104247346B (zh) 分组交换网络中的伪线路扩展的群组消息传送
WO2023274083A1 (zh) 路由发布和转发报文的方法、装置、设备和存储介质
JP2015512587A (ja) パケット交換網における擬似回線グループ
WO2021115397A1 (zh) 业务链转发控制方法及装置、业务组网
US8352637B2 (en) Techniques for resolving network connectivity
US8781320B2 (en) Automatically switched optical network and method for data transmission in the network
WO2022042610A1 (zh) 信息处理方法、网络控制器、节点及计算机可读存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20908342

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2020908342

Country of ref document: EP

Effective date: 20220725